Submission #754875

#TimeUsernameProblemLanguageResultExecution timeMemory
754875alexander707070Roller Coaster Railroad (IOI16_railroad)C++14
0 / 100
70 ms8876 KiB
#include <bits/stdc++.h> using namespace std; int n; pair<int,int> a[200007]; bool cmp(pair<int,int> fr,pair<int,int> sc){ return max(fr.second-sc.first,0) < max(sc.second-fr.first,0); } long long plan_roller_coaster(vector<int> s,vector<int> t){ n=s.size(); for(int i=1;i<=n;i++){ a[i]={s[i-1],t[i-1]}; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n-1;i++){ if(a[i].second>a[i+1].first)return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...