#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
map<int, int> mp;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
vector<pi> v;
int n = (int) s.size();
for(int i=0; i<n; i++) mp[s[i]]--, mp[t[i]]++;
int ans = 0;
for(auto &i : mp){
ans += i.second;
if(ans < 0) return 1;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2024 KB |
n = 2 |
2 |
Correct |
0 ms |
2024 KB |
n = 2 |
3 |
Correct |
0 ms |
2024 KB |
n = 2 |
4 |
Correct |
0 ms |
2024 KB |
n = 2 |
5 |
Correct |
0 ms |
2024 KB |
n = 2 |
6 |
Incorrect |
0 ms |
2024 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2024 KB |
n = 2 |
2 |
Correct |
0 ms |
2024 KB |
n = 2 |
3 |
Correct |
0 ms |
2024 KB |
n = 2 |
4 |
Correct |
0 ms |
2024 KB |
n = 2 |
5 |
Correct |
0 ms |
2024 KB |
n = 2 |
6 |
Incorrect |
0 ms |
2024 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
539 ms |
23904 KB |
n = 199999 |
2 |
Correct |
529 ms |
23904 KB |
n = 199991 |
3 |
Correct |
473 ms |
23904 KB |
n = 199993 |
4 |
Correct |
349 ms |
18664 KB |
n = 152076 |
5 |
Correct |
209 ms |
12208 KB |
n = 93249 |
6 |
Correct |
449 ms |
20472 KB |
n = 199910 |
7 |
Correct |
459 ms |
23508 KB |
n = 199999 |
8 |
Correct |
409 ms |
20604 KB |
n = 199997 |
9 |
Correct |
443 ms |
20816 KB |
n = 171294 |
10 |
Incorrect |
349 ms |
17432 KB |
answer is not correct: 1 instead of 0 |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2024 KB |
n = 2 |
2 |
Correct |
0 ms |
2024 KB |
n = 2 |
3 |
Correct |
0 ms |
2024 KB |
n = 2 |
4 |
Correct |
0 ms |
2024 KB |
n = 2 |
5 |
Correct |
0 ms |
2024 KB |
n = 2 |
6 |
Incorrect |
0 ms |
2024 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |