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;
int main()
{
int n,q;
cin>>n>>q;
vector<pair<int,int>>v;
for(int i=0;i<n;i++)
{
int x,y;
cin>>x>>y;
v.push_back({x,y});
}
while(q--)
{
int x,y;
cin>>x>>y;
x--;
if(n<=1005)
{
int d=v[x].first;///x-1
y-=v[x].second;
if(y>0)
x++;
if(y>0)
while(true)
{
if(x>=n)
{
break;
}
if(d<v[x].first)
{
y-=v[x].second;
d=v[x].first;
}
if(y<=0)break;
x++;
}
if(x>=n)x=0;
if(x!=0)x++;
cout<<x<<endl;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |