# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
592421 | kshitij_sodani | Roller Coaster Railroad (IOI16_railroad) | C++14 | 1402 ms | 124756 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 llo;
#define a first
#define b second
#define pb push_back
#define endl '\n'
int pre[2000001];
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t){
s.pb(0);
t.pb(0);
set<int> ss;
map<int,int> tt;
for(auto j:s){
ss.insert(j);
if(j>0){
ss.insert(j-1);
}
ss.insert(j+1);
}
for(auto j:t){
ss.insert(j);
if(j>0){
ss.insert(j-1);
}
ss.insert(j+1);
}
int ind=0;
for(auto j:ss){
tt[j]=ind;
ind++;
}
for(int i=0;i<=ind;i++){
pre[i]=0;
}
for(int i=0;i<s.size();i++){
//cout<<s[i]<<":"<<t[i]<<endl;
s[i]=tt[s[i]];
t[i]=tt[t[i]];
//cout<<s[i]<<",,"<<t[i]<<endl;
if(s[i]<t[i]){
pre[s[i]]++;
pre[t[i]]--;
}
else if(s[i]>t[i]){
pre[t[i]]--;
pre[s[i]]++;
}
}
int su=0;
for(int i=0;i<=ind;i++){
su+=pre[i];
//cout<<i<<":"<<su<<endl;
if(su>1){
return 1;
}
}
return 0;
}
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... |