oj.uz

Submission #37081

# Submission time Handle Problem Language Result Execution time Memory
37081 2017-12-21T05:06:26 Z szawinis Taxis (POI13_tak) C++14
100 / 100
 223 ms 5920 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5e5+1;

int n;
ll m, d, x[N];

bool check(int lim_idx) {
	ll curr = 0;
	int rem = upper_bound(x+1, x+lim_idx+1, m - d, greater<ll>()) - x - 1;
	if(!rem) return false;
	for(int i = 1; i < rem && curr < d; i++)
    	curr += max(x[i] - (d - curr), 0ll);
	for(int i = rem + 1; i <= lim_idx && curr < d; i++)
    	curr += max(x[i] - (d - curr), 0ll);
  	if(curr < d) return x[rem] - 2 * (d - curr) >= m - d;
	else return true;
}

int main() {
	scanf("%lld %lld %d", &m, &d, &n);
	for(int i = 1; i <= n; i++) scanf("%lld", x+i);
	sort(x+1, x+n+1, greater<ll>());
	int l = 1, r = n;
	while(l < r) {
		int mid = l+r >> 1;
		if(check(mid)) r = mid;
		else l = mid+1;
	}
	if(!check(l)) printf("0");
	else printf("%d", l);
}

Compilation message

tak.cpp: In function 'int main()':
tak.cpp:27:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l+r >> 1;
              ^
tak.cpp:22:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %d", &m, &d, &n);
                                   ^
tak.cpp:23:48: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= n; i++) scanf("%lld", x+i);
                                                ^

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 5920 KB Output is correct
2 Correct 76 ms 5920 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 5920 KB Output is correct
2 Correct 153 ms 5920 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 5920 KB Output is correct
2 Correct 143 ms 5920 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 5920 KB Output is correct
2 Correct 223 ms 5920 KB Output is correct