# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114556 | 2019-06-01T17:52:59 Z | wilwxk | Shortcut (IOI16_shortcut) | C++11 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN=2e5+5; pair<int, int> v[MAXN]; int n; ll plan_roller_coaster(vector<int> s, vector<int> t) { n = (int) s.size(); for(int i=1; i<=n; i++) v[i]={t[i-1], s[i-1]}; sort(v+1, v+1+n); bool ok=1; int cur=1; for(int i=1; i<=n; i++) { if(cur>v[i].second) ok=0; cur=v[i].first; } if(ok) return 0; return 1; }