Submission #276604

#TimeUsernameProblemLanguageResultExecution timeMemory
276604arayiRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
112 ms6264 KiB
#include "railroad.h" #include <bits/stdc++.h> #define lli long long int #define fr first #define sc second #define all(x) (x).begin(), (x).end() using namespace std; const int N = 2e5 + 30; int n, sm[N]; pair <int, int> a[N]; long long plan_roller_coaster(vector<int> s, vector<int> t) { n = s.size(); sort(all(s)); sort(all(t)); for (int i = 0; i < n; i++) { int i1 = upper_bound(all(t), s[i]) - t.begin(); if(i1 < i) 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...