Submission #889167

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