# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
878563 | AlexMoysi | Fountain (eJOI20_fountain) | C++14 | 1561 ms | 3692 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 <iostream>
#include <vector>
using namespace std;
struct Reservoir
{
int diameter, volume;
};
int main()
{
int N, Q;
cin>>N>>Q;
vector<Reservoir> Res;
Res.resize(N);
for(size_t c=0; c<N; c++)
cin>>Res[c].diameter>>Res[c].volume;
for(size_t c=0; c<Q; c++)
{
int R, V;
cin>>R>>V;
R--;
V-=Res[R].volume;
while(V>0 && R<N-1)
{
if(Res[R+1].diameter > Res[R].diameter)
V-=Res[R+1].volume;
R++;
}
R++;
cout<<R%N<<endl;
}
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... |