oj.uz

Submission #29453

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

int n, t;
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);
	int cnt = 0;
	for(int i = 0; i < n; i++){
		if(a[i] >= max(d - b, b + d - 2 * x)){
			printf("%d\n", cnt + 1);
			return 0;
		}
		if(i == t) continue;
		x += a[i] - (b - x);
		cnt++;
		if(a[t] >= max(d - b, b + d - 2 * x)){
			printf("%d\n", cnt + 1);
			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
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 119 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 Incorrect 159 ms 5924 KB Output isn't correct
2 Halted 0 ms 0 KB -

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 -