# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339691 | wwdd | Trampoline (info1cup20_trampoline) | C++14 | 759 ms | 69164 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 long long ll;
typedef pair<ll,ll> pl;
const int MN = 200200;
const int LOG = 20;
ll nx[MN][LOG];
struct Q {
ll id;
pl st,ed;
bool operator< (const Q& other) {
return st.second < other.st.second;
}
};
vector<Q> qu;
vector<pl> tr;
map<ll,ll> mu;
int main() {
ios::sync_with_stdio(0);cin.tie(0);
ll mr,mc;
cin >> mr >> mc;
ll n,N;
cin >> n;
for(int i=0;i<n;i++) {
ll a,b;
cin >> a >> b;
tr.emplace_back(a,b);
}
sort(tr.begin(),tr.end(),[&](const pl& a, const pl& b){
if(a.second > b.second) {return true;}
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... |