forked from arpitbbhayani/spoj
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ALIEN2.cpp
85 lines (64 loc) · 1.22 KB
/
ALIEN2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/*
* ALIEN2.cpp
*
* Created on: May 29, 2014
* Author: Arpit Bhayani
*/
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
#define DEBUG 0
#define gc getchar
void scanint(int &x) {
register int c = gc();
x = 0;
for (; (c < 48 || c > 57); c = gc())
;
for (; c > 47 && c < 58; c = gc()) {
x = (x << 1) + (x << 3) + c - 48;
}
}
int readline(char * str) {
int i = 0;
char ch;
while ((ch = getchar()) != '\n') {
str[i++] = ch;
}
str[i] = '\0';
return i;
}
int min(int a, int b) {
return a < b ? a : b;
}
int main(int argc, char * argv[]) {
int n, k;
scanint(n);
scanint(k);
int a[n], b[n];
for (int i = 0; i < n; i++) {
scanint(a[i]);
}
for (int i = 0; i < n; i++) {
scanint(b[i]);
}
int ns = n , count , i;
for (i = 1; i < n; i++) {
int ta = a[i];
a[i] = min(a[i - 1] + a[i], b[i - 1] + b[i] + a[i]);
b[i] = min(b[i - 1] + b[i], a[i - 1] + ta + b[i]);
if ( min(a[i],b[i]) > k ) {
break;
}
}
if ( i != n ) {
ns = i;
count = min(a[i - 1], b[i - 1]);
}
else {
ns = n;
count = min(a[n - 1], b[n - 1]);
}
cout << ns << " " << count << endl;
return 0;
}