# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466886 | TlenekWodoru | Fountain (eJOI20_fountain) | C++14 | 1586 ms | 6040 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;
int srednica[100009];
int pojemnosc[100009];
int graf[100009];
int main()
{ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
int r,l;
cin>>r>>l;
srednica[i]=r;
pojemnosc[i]=l;
}
map<int,int>M;
M[1000000009]=0;
for(int i=n;i>=1;i--)
{
int r=srednica[i];
int l=pojemnosc[i];
graf[i]=M.upper_bound(r)->second;
M[r]=i;
}
///-=-=-==-==-=-==-==-=-=-==-=-==-==-==-=-==-==-=-==-=-==-==-=-=-=
///-==-=--==-==-=-==-==--==--==-==-=-==-==-=-==-==-==-=-==-==-=-==-
/**cout<<endl<<endl;
for(int i=0;i<=n;i++)
{
cout<<endl<<"i="<<i<<"| ";
for(int j=0;j<10;j++)
{
cout<<V[i][j]<<" ";
}
}
cout<<endl;
cout<<endl;
for(int i=0;i<=n;i++)
{
cout<<endl<<"i="<<i<<"| ";
for(int j=0;j<10;j++)
{
cout<<V2[i][j]<<" ";
}
}
cout<<endl<<endl;**/
///-=-==-=-==-=-==-=-==-==-=-===-=-==-==-=-==-=-==-==--=-=
vector<int>odp;
for(int i=1;i<=m;i++)
{
int ind;
int k;
cin>>ind>>k;
while(ind!=0)
{
if(k>pojemnosc[ind])
{
k-=pojemnosc[ind];
ind=graf[ind];
}
else
{
break;
}
}
odp.push_back(ind);
}
for(int i=0;i<odp.size();i++)
{
cout<<odp[i]<<endl;
}
return 0;
}
/**
10 100
1 1
2 1
3 1
4 2
5 2
6 2
7 3
8 3
9 3
10 4
**/
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... |