# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553600 | czauderna | Fountain (eJOI20_fountain) | C++17 | 258 ms | 36744 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;
#define pb push_back
#define fs first
#define sc second
const int LIM = 1e5+3, LG=21, INF=1e9+5;
long long idx, nxt[LIM][LG], wg[LIM][LG];
pair<int, int> arr[LIM], stos[LIM];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n, q, a, b, o, t;
cin >> n >> q;
for(int i=0; i<n; i++){
cin >> arr[i].fs >> arr[i].sc;
}
nxt[n][0]=n; wg[n][0]=INF;
stos[0].fs=n; stos[0].sc=INF;
for(int i=n-1; i>=0; i--){
while(arr[i].fs>stos[idx].sc && idx>0) idx--;
nxt[i][0]=stos[idx].fs; wg[i][0]=arr[i].sc;
idx++;
stos[idx].fs=i; stos[idx].sc =arr[i].fs;
}
for(int i=1; i<LG; ++i){
for(int j=0; j<=n; j++){
nxt[j][i]=nxt[nxt[j][i-1]][i-1];
wg[j][i]+=wg[nxt[j][i-1]][i-1]+wg[j][i-1];
}
}
for(int i=0; i<q; i++){
cin >> a >> b; --a;
for(int k=LG-1; k>=0; k--){
if(b-wg[a][k]>0){
b-=wg[a][k];
a=nxt[a][k];
}
}
cout << (a+1)%(n+1) << "\n";
}
}
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... |