Submission #889162

#TimeUsernameProblemLanguageResultExecution timeMemory
889162Ghulam_JunaidRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
159 ms22212 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<vector<int>> st;
    for (int i=0; i<n; i++)
        st.insert({s[i], t[i], i});

    vector<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;
        swap(last[0], last[1]);
        last[1] = -1;
        last[2] = -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...