# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947033 | vjudge1 | Event Hopping 2 (JOI21_event2) | C++17 | 3101 ms | 24756 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;
const long long maxn=200000+10;
vector<long long>res;
long long n,k;
pair<long long,long long>all[maxn];
vector<long long>alll[maxn],allr[maxn];
void vorod(){
cin>>n>>k;
vector<long long>allind;
for(long long i=1;i<=n;i++){
cin>>all[i].first>>all[i].second;
all[i].second--;
allind.push_back(all[i].first);
allind.push_back(all[i].second);
}
sort(allind.begin(),allind.end());
allind.resize(unique(allind.begin(),allind.end())-allind.begin());
for(long long i=1;i<=n;i++){
all[i].first=lower_bound(allind.begin(),allind.end(),all[i].first)-allind.begin();
all[i].second=lower_bound(allind.begin(),allind.end(),all[i].second)-allind.begin();
alll[all[i].first].push_back(i);
allr[all[i].second].push_back(i);
}
}
vector<pair<long long,long long>>allv;
set<pair<int,int>>inds;
void pre(){
set<pair<long long,long long>>st;
# | 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... |