# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
769909 | PAndaS | Fountain (eJOI20_fountain) | C++14 | 1573 ms | 2156 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
long find_next(vector<long> d, long i){
long orig = d[i];
for(int j = i + 1; j < d.size(); j++) if(d[j] > orig) return j;
return -1;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long n, q;
cin >> n >> q;
vector<long> d(n);
vector<int> c(n);
for(long i = 0; i < n; i++) cin >> d[i] >> c[i];
long r, v; long tmp;
for(long i = 0; i < q; i++){
cin >> r >> v;
r--;
while(v > 0 || r != -1){
v -= c[r];
if(v <= 0){ cout << r + 1 << '\n'; break;}
r = find_next(d, r);
if(r == -1){cout << 0 << '\n'; break;}
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |