#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, q;
cin >> n >> q;
vector<int> d(n+1), c(n);
d[n] = 1000000001;
for(int i = 0; i < n; i++){
cin >> d[i] >> c[i];
}
if(n <= 1000 && q <= 2000){
int r, v;
for(int i = 0; i < q; i++){
cin >> r >> v;
int k = r-1, m = r-1;
v -= c[m];
while(v > 0 && m <= n && k < n){
if(d[m] > d[k]){
v -= c[m];
k = m;
}
m++;
}
if(k == n) cout << 0 << "\n";
else cout << k+1 << "\n";
}
}
else{
for(int i = n-2; i >= 0; i--){
c[i] += c[i+1];
}
for(int i = 0; i < q; i++){
int r, v;
cin >> r >> v;
if(c[r-1]-v >= 0 && c[r-1]-v < c[n-1]) cout << n;
else if(c[r-1]-v < 0) cout << 0;
else{
int a = 0, b = n;
while(b - a > 1){
int m = (a+b)/2;
if(c[r-1]-v < c[m]) a = m;
else b = m;
}
cout << b;
}
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
2 ms |
212 KB |
Output is correct |
4 |
Correct |
3 ms |
212 KB |
Output is correct |
5 |
Correct |
5 ms |
308 KB |
Output is correct |
6 |
Correct |
4 ms |
340 KB |
Output is correct |
7 |
Correct |
5 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
242 ms |
4440 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
2 ms |
212 KB |
Output is correct |
4 |
Correct |
3 ms |
212 KB |
Output is correct |
5 |
Correct |
5 ms |
308 KB |
Output is correct |
6 |
Correct |
4 ms |
340 KB |
Output is correct |
7 |
Correct |
5 ms |
212 KB |
Output is correct |
8 |
Incorrect |
242 ms |
4440 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |