Submission #464725

#TimeUsernameProblemLanguageResultExecution timeMemory
464725jurgisFountain (eJOI20_fountain)C++14
30 / 100
1584 ms4896 KiB
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, q;cin>>n>>q; int d[n+1], c[n+1], r[q], v[q];
    for(int i=1; i<=n; i++){
        cin>>d[i]>>c[i];
    }
    for(int i=0; i<q;i++){cin>>r[i]>>v[i];}
    for(int i =0;i <q; i++){
        int pab = r[i]; int paskd = d[r[i]];v[i] -= c[r[i]];
        while(pab!= n+1 && v[i] >0){

            if(paskd<d[pab]){
                //cout<<"alip";
                v[i] -= c[pab];
                paskd = d[pab];
            }
            //cout<<"pask d " <<paskd<<" "<<pab<<" v[i] "<<v[i]<<endl;
            if(v[i] >0){
                 pab++;
            }

        }
        if(pab ==n+1){cout<<0<<"\n";}
        else{cout<<pab<<"\n";}
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...