# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
276942 | thebes | Trampoline (info1cup20_trampoline) | C++14 | 1165 ms | 57312 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;
typedef pair<int,int> pii;
#define F first
#define S second
const int MN = 2e5+5, LG = 19;
int R, C, N, T, i, j, x, y, a, b, s, t, sp[LG][MN], nxt, rev[MN];
map<int,int> mp, st[MN];
pii pnt[MN];
int main(){
scanf("%d%d%d",&R,&C,&N);
for(i=1;i<=N;i++){
scanf("%d%d",&x,&y);
pnt[i]={x,y};
mp[x] = 0;
}
for(auto it=mp.begin();it!=mp.end();it++)
it->second = ++nxt, rev[nxt] = it->first;
for(i=1;i<=N;i++)
st[mp[pnt[i].F]][pnt[i].S]=i;
for(i=1;i<=N;i++){
x = mp[pnt[i].F];
if(rev[x]+1==rev[x+1]){
auto it=st[x+1].lower_bound(pnt[i].S);
if(it!=st[x+1].end()){
sp[0][i]=it->S;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |