Submission #889163

#TimeUsernameProblemLanguageResultExecution timeMemory
889163Ghulam_JunaidRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
99 ms12760 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll plan_roller_coaster (vector<int> s, vector<int> t){ ll n = s.size(); set<pair<int, int>> st; for (int i=0; i<n; i++) st.insert({s[i], i}); pair<int, int> last = {-1, -1}; ll can = 1; while (st.size()){ auto lb = st.lower_bound(last); if (lb == st.end()){ can = 0; break; } last = *lb; last.first = t[last.second]; last.second = -1; st.erase(lb); } return can; } // int main(){ // 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...