Submission #53443

#TimeUsernameProblemLanguageResultExecution timeMemory
53443aomeRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
124 ms6236 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; } int p = 0; for (int i = 0; i < n; ++i) { if (vec[i].second > vec[p].second) p = i; } for (int i = 0; i < n; ++i) { if (i != p && vec[i].first >= vec[p].second) return 0; } for (int i = 0; i < n; ++i) { if (i != p && vec[p].first >= vec[i].second) return 0; } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...