# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1030994 | Warinchai | Roller Coaster Railroad (IOI16_railroad) | C++14 | 393 ms | 28488 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 "railroad.h"
#include<bits/stdc++.h>
using namespace std;
int p[2000005];
int fp(int a){
return p[a]==a?a:p[a]=fp(p[a]);
}
void un(int a,int b){
p[fp(a)]=fp(b);
}
vector<int>ids;
map<int,int>mp;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
vector<pair<int,int>>v;
for(int i=0;i<n;i++){
v.push_back({s[i],1});
v.push_back({t[i],-1});
if(!mp[s[i]])ids.push_back(s[i]),mp[s[i]]++;
if(!mp[t[i]])ids.push_back(t[i]),mp[t[i]]++;
}
sort(ids.begin(),ids.end());
sort(v.begin(),v.end());
for(int i=1;i<=mp.size();i++)p[i]=i;
for(int i=0;i<n;i++){
un(lower_bound(ids.begin(),ids.end(),s[i])-ids.begin()+1,lower_bound(ids.begin(),ids.end(),t[i])-ids.begin()+1);
}
int val=0;
for(int i=0;i<v.size();){
int sp=v[i].first;
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... |