oj.uz

Submission #29439

# Submission time Handle Problem Language Result Execution time Memory
29439 2017-07-19T11:19:15 Z kdh9949 Taxis (POI13_tak) C++14
10 / 100
 169 ms 5924 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n, t, ans;
ll d, b, x, a[500010];

int main(){
	scanf("%lld%lld%d", &d, &b, &n);
	for(int i = 0; i < n; i++) scanf("%lld", a + i);
	sort(a, a + n, greater<int>());
	t = int(upper_bound(a, a + n, d - b, greater<int>()) - a - 1);
	for(int i = 0; i < n; i++){
		if(i == t) continue;
		if(a[i] >= b + d - 2 * x){
			printf("%d\n", i + 1);
			return 0;
		}
		x += max(0LL, a[i] - (b - x));
		x = min(x, b);
		if(a[t] >= b + d - 2 * x){
			printf("%d\n", i + 2);
			return 0;
		}
	}
	puts("0");
}

Compilation message

tak.cpp: In function 'int main()':
tak.cpp:9:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%d", &d, &b, &n);
                                 ^
tak.cpp:10:49: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0; i < n; i++) scanf("%lld", a + i);
                                                 ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5924 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5924 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5924 KB Output is correct
2 Incorrect 0 ms 5924 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5924 KB Output is correct
2 Incorrect 0 ms 5924 KB Output isn't correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5924 KB Output is correct
2 Incorrect 6 ms 5924 KB Output isn't correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5924 KB Output is correct
2 Correct 16 ms 5924 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 5924 KB Output is correct
2 Incorrect 69 ms 5924 KB Output isn't correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 86 ms 5924 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 5924 KB Output is correct
2 Incorrect 143 ms 5924 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 169 ms 5924 KB Output isn't correct
2 Halted 0 ms 0 KB -