# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165435 | Segtree | Roller Coaster Railroad (IOI16_railroad) | C++14 | 0 ms | 0 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<iostream>
#include<algorithm>
#include<vector>
#include"railroad.h"
using namespace std;
typedef long long ll;
ll plan_roller_coaster(int n,vector<int> s,vector<int> t){
vector<pair<ll,ll> >v;
for(int i=0;i<n;i++){
v.push_back(make_pair(s[i],+1));
v.push_back(make_pair(t[i],-1));
}
sort(v.begin(),v.end());
ll cnt=0;
for(int i=0;i<v.size();i++){
cnt+=v[i].second;
if(cnt>1)return 0;
}
return 1;
}