# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369988 | A_D | Trampoline (info1cup20_trampoline) | C++14 | 813 ms | 94388 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>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
#define du long double
using namespace std;
const int N=4e5+1000;
const int l=20;
int nxt[N][l];
vector<ii> vec;
set<ii> st;
main()
{
int r,c,n;
cin>>r>>c>>n;
for(int i=1;i<=n;i++){
int a,b;
scanf("%lld",&a);
scanf("%lld",&b);
vec.push_back({a,b});
vec.push_back({a+1,b});
st.insert({a,b});
}
sort(vec.begin(),vec.end());
int sz=vec.size();
for(int i=0;i<l;i++)nxt[sz][i]=sz;
int nx=sz;
for(int i=sz-1;i>=0;i--){
int a=vec[i].F;
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... |