Submission #53365

#TimeUsernameProblemLanguageResultExecution timeMemory
53365aomeRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
122 ms6400 KiB
#include "railroad.h"

#include <bits/stdc++.h>

using namespace std;

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = s.size();
    vector< pair<int, int> > vec;
    for (int i = 0; i < n; ++i) {
        vec.push_back({s[i], t[i]});
    }
    sort(vec.begin(), vec.end());
    t.push_back(1);
    sort(t.begin(), t.end());
    for (int i = 0; i < n; ++i) {
        int tmp = lower_bound(t.begin(), t.end(), vec[i].first + 1) - t.begin();
        if (vec[i].first >= vec[i].second && (i == 0 || vec[i - 1].first < vec[i].second)) tmp--;
        if (tmp < i + 1) 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...