#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll plan_roller_coaster(vector<int> S, vector<int> E) {
const int N=S.size();
vector<int> X(N);
iota(X.begin(), X.end(), 0);
sort(X.begin(), X.end(), [&](int i, int j) { return S[i]<S[j]; });
int s=1e9, e=0;
for(int i:X) {
if(e<=S[i]) e=E[i];
else if(s<E[i]) return 1;
s=S[i];
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
n = 2 |
2 |
Correct |
0 ms |
256 KB |
n = 2 |
3 |
Correct |
0 ms |
256 KB |
n = 2 |
4 |
Correct |
1 ms |
360 KB |
n = 2 |
5 |
Correct |
1 ms |
288 KB |
n = 2 |
6 |
Incorrect |
0 ms |
256 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
n = 2 |
2 |
Correct |
0 ms |
256 KB |
n = 2 |
3 |
Correct |
0 ms |
256 KB |
n = 2 |
4 |
Correct |
1 ms |
360 KB |
n = 2 |
5 |
Correct |
1 ms |
288 KB |
n = 2 |
6 |
Incorrect |
0 ms |
256 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
98 ms |
4276 KB |
n = 199999 |
2 |
Correct |
94 ms |
4216 KB |
n = 199991 |
3 |
Correct |
93 ms |
4344 KB |
n = 199993 |
4 |
Incorrect |
68 ms |
3320 KB |
answer is not correct: 1 instead of 0 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
n = 2 |
2 |
Correct |
0 ms |
256 KB |
n = 2 |
3 |
Correct |
0 ms |
256 KB |
n = 2 |
4 |
Correct |
1 ms |
360 KB |
n = 2 |
5 |
Correct |
1 ms |
288 KB |
n = 2 |
6 |
Incorrect |
0 ms |
256 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |