# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112286 | ezzzay | Putovanje (COCI20_putovanje) | C++14 | 162 ms | 81508 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;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
vector<pair<int,pair<int,int> > >v [N] ;
set< pair<int,int>>st[N];
int ans=0;
void merge(int a, int b){
for(auto p:st[b]){
auto it=st[a].upper_bound(p);
if(it!=st[a].end()){
auto k= *it;
if(k.ff=p.ss+1){
st[a].erase(it);
st[a].insert({p.ff,k.ss});
continue;
}
}
if(it!=st[a].begin()){
it--;
auto k= *it;
if(k.ss+1==p.ff){
st[a].erase(it);
st[a].insert({k.ff,p.ss});
continue;
}
}
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... |