#include "railroad.h"
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#define INF 1E18
using namespace std;
int N;
long long int plan_roller_coaster(vector<int> s, vector<int> t) {
N = s.size();
if (N <= 8) {
vector<int> u;
for (int i = 0; i < 8; i++) {
u.push_back(i);
}
long long int ans = 0;
for (int i = 1; i < 8; i++) {
ans += max(0, t[u[i - 1]] - s[u[i]]);
}
while (next_permutation(u.begin(), u.end())) {
long long int temp = 0;
for (int i = 1; i < 8; i++) {
temp += max(0, t[u[i - 1]] - s[u[i]]);
}
ans = min(ans, temp);
}
return ans;
}
multimap<int, int> mymap;
for (int i = 0; i < N; i++) {
mymap.insert({s[i], t[i]});
}
int nowspeed = mymap.begin() -> second;
mymap.erase(mymap.begin());
while (!mymap.empty()) {
multimap<int, int>::iterator it = mymap.lower_bound(nowspeed);
if (it == mymap.end()) return 1;
nowspeed = it -> second;
mymap.erase(it);
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
256 KB |
n = 2 |
2 |
Correct |
3 ms |
384 KB |
n = 2 |
3 |
Correct |
4 ms |
384 KB |
n = 2 |
4 |
Correct |
3 ms |
256 KB |
n = 2 |
5 |
Correct |
3 ms |
384 KB |
n = 2 |
6 |
Correct |
3 ms |
384 KB |
n = 2 |
7 |
Correct |
2 ms |
256 KB |
n = 3 |
8 |
Correct |
3 ms |
256 KB |
n = 3 |
9 |
Correct |
3 ms |
256 KB |
n = 3 |
10 |
Correct |
2 ms |
256 KB |
n = 8 |
11 |
Correct |
3 ms |
256 KB |
n = 8 |
12 |
Correct |
3 ms |
384 KB |
n = 8 |
13 |
Correct |
3 ms |
384 KB |
n = 8 |
14 |
Correct |
2 ms |
256 KB |
n = 8 |
15 |
Correct |
3 ms |
384 KB |
n = 8 |
16 |
Correct |
5 ms |
384 KB |
n = 8 |
17 |
Correct |
3 ms |
256 KB |
n = 8 |
18 |
Correct |
3 ms |
384 KB |
n = 8 |
19 |
Correct |
3 ms |
256 KB |
n = 3 |
20 |
Correct |
3 ms |
256 KB |
n = 7 |
21 |
Correct |
3 ms |
384 KB |
n = 8 |
22 |
Correct |
1 ms |
256 KB |
n = 8 |
23 |
Correct |
3 ms |
384 KB |
n = 8 |
24 |
Correct |
3 ms |
384 KB |
n = 8 |
25 |
Correct |
4 ms |
256 KB |
n = 8 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
256 KB |
n = 2 |
2 |
Correct |
3 ms |
384 KB |
n = 2 |
3 |
Correct |
4 ms |
384 KB |
n = 2 |
4 |
Correct |
3 ms |
256 KB |
n = 2 |
5 |
Correct |
3 ms |
384 KB |
n = 2 |
6 |
Correct |
3 ms |
384 KB |
n = 2 |
7 |
Correct |
2 ms |
256 KB |
n = 3 |
8 |
Correct |
3 ms |
256 KB |
n = 3 |
9 |
Correct |
3 ms |
256 KB |
n = 3 |
10 |
Correct |
2 ms |
256 KB |
n = 8 |
11 |
Correct |
3 ms |
256 KB |
n = 8 |
12 |
Correct |
3 ms |
384 KB |
n = 8 |
13 |
Correct |
3 ms |
384 KB |
n = 8 |
14 |
Correct |
2 ms |
256 KB |
n = 8 |
15 |
Correct |
3 ms |
384 KB |
n = 8 |
16 |
Correct |
5 ms |
384 KB |
n = 8 |
17 |
Correct |
3 ms |
256 KB |
n = 8 |
18 |
Correct |
3 ms |
384 KB |
n = 8 |
19 |
Correct |
3 ms |
256 KB |
n = 3 |
20 |
Correct |
3 ms |
256 KB |
n = 7 |
21 |
Correct |
3 ms |
384 KB |
n = 8 |
22 |
Correct |
1 ms |
256 KB |
n = 8 |
23 |
Correct |
3 ms |
384 KB |
n = 8 |
24 |
Correct |
3 ms |
384 KB |
n = 8 |
25 |
Correct |
4 ms |
256 KB |
n = 8 |
26 |
Correct |
3 ms |
384 KB |
n = 8 |
27 |
Correct |
3 ms |
384 KB |
n = 8 |
28 |
Correct |
3 ms |
256 KB |
n = 8 |
29 |
Correct |
2 ms |
256 KB |
n = 16 |
30 |
Correct |
2 ms |
412 KB |
n = 16 |
31 |
Incorrect |
2 ms |
384 KB |
answer is not correct: 1 instead of 5295826283 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
311 ms |
12920 KB |
n = 199999 |
2 |
Correct |
296 ms |
12920 KB |
n = 199991 |
3 |
Correct |
261 ms |
12792 KB |
n = 199993 |
4 |
Correct |
224 ms |
9848 KB |
n = 152076 |
5 |
Correct |
141 ms |
6272 KB |
n = 93249 |
6 |
Correct |
308 ms |
12892 KB |
n = 199910 |
7 |
Correct |
274 ms |
13048 KB |
n = 199999 |
8 |
Correct |
277 ms |
12792 KB |
n = 199997 |
9 |
Correct |
311 ms |
11128 KB |
n = 171294 |
10 |
Incorrect |
191 ms |
9332 KB |
answer is not correct: 1 instead of 0 |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
256 KB |
n = 2 |
2 |
Correct |
3 ms |
384 KB |
n = 2 |
3 |
Correct |
4 ms |
384 KB |
n = 2 |
4 |
Correct |
3 ms |
256 KB |
n = 2 |
5 |
Correct |
3 ms |
384 KB |
n = 2 |
6 |
Correct |
3 ms |
384 KB |
n = 2 |
7 |
Correct |
2 ms |
256 KB |
n = 3 |
8 |
Correct |
3 ms |
256 KB |
n = 3 |
9 |
Correct |
3 ms |
256 KB |
n = 3 |
10 |
Correct |
2 ms |
256 KB |
n = 8 |
11 |
Correct |
3 ms |
256 KB |
n = 8 |
12 |
Correct |
3 ms |
384 KB |
n = 8 |
13 |
Correct |
3 ms |
384 KB |
n = 8 |
14 |
Correct |
2 ms |
256 KB |
n = 8 |
15 |
Correct |
3 ms |
384 KB |
n = 8 |
16 |
Correct |
5 ms |
384 KB |
n = 8 |
17 |
Correct |
3 ms |
256 KB |
n = 8 |
18 |
Correct |
3 ms |
384 KB |
n = 8 |
19 |
Correct |
3 ms |
256 KB |
n = 3 |
20 |
Correct |
3 ms |
256 KB |
n = 7 |
21 |
Correct |
3 ms |
384 KB |
n = 8 |
22 |
Correct |
1 ms |
256 KB |
n = 8 |
23 |
Correct |
3 ms |
384 KB |
n = 8 |
24 |
Correct |
3 ms |
384 KB |
n = 8 |
25 |
Correct |
4 ms |
256 KB |
n = 8 |
26 |
Correct |
3 ms |
384 KB |
n = 8 |
27 |
Correct |
3 ms |
384 KB |
n = 8 |
28 |
Correct |
3 ms |
256 KB |
n = 8 |
29 |
Correct |
2 ms |
256 KB |
n = 16 |
30 |
Correct |
2 ms |
412 KB |
n = 16 |
31 |
Incorrect |
2 ms |
384 KB |
answer is not correct: 1 instead of 5295826283 |
32 |
Halted |
0 ms |
0 KB |
- |