# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114544 | ly20 | 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<bits/stdc++.h>
using namespace std;
#include "railroad.h"
const int MAXN=212345;
pair<int,int> v;
long long plan_roller_coaster(vector<int> e,vector<int> s)
{
int n=e.size();
for(int i=0;i<n;i++)
{
v.push_back(make_pair(e[i],s[i]));
}
sort(v.begin(),v.end());
long long resp=0;
for(int i=0;i<n-1;i++)
{
if(v[i].second>v[i+1].first)resp=1;
}
return resp;
}