# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
827525 | 2023-08-16T14:20:53 Z | caganyanmaz | Roller Coaster Railroad (IOI16_railroad) | C++14 | 82 ms | 15648 KB |
#include <bits/stdc++.h> #define mp(x...) array<int, 2>({x}) #define pb push_back #define int int64_t #include "railroad.h" using namespace std; #ifdef DEBUGGING #include "../debug.h" #else #define debug(x...) void(42) #endif long long plan_roller_coaster(vector<int32_t> s, vector<int32_t> t) { int n = s.size(); vector<array<int, 2>> vals; for (int i = 0; i < n; i++) { vals.pb({s[i], +1}); vals.pb({t[i], -1}); } sort(vals.begin(), vals.end()); int pf = vals[0][1] - 1; int res = 0; for (int i = 1; i < vals.size(); i++) { debug(pf, vals[i-1][0], vals[i][0]); if ((pf == 0 && vals[i-1][0] != vals[0][0] && vals[i][0] != vals.back()[0]) || pf > 0) res += max<int>(pf, 1) * (vals[i][0] - vals[i-1][0]); pf += vals[i][1]; } return res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | n = 2 |
2 | Correct | 0 ms | 212 KB | n = 2 |
3 | Correct | 0 ms | 212 KB | n = 2 |
4 | Correct | 0 ms | 212 KB | n = 2 |
5 | Correct | 0 ms | 212 KB | n = 2 |
6 | Correct | 0 ms | 212 KB | n = 2 |
7 | Correct | 1 ms | 212 KB | n = 3 |
8 | Incorrect | 1 ms | 304 KB | answer is not correct: 209372231 instead of 102553483 |
9 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | n = 2 |
2 | Correct | 0 ms | 212 KB | n = 2 |
3 | Correct | 0 ms | 212 KB | n = 2 |
4 | Correct | 0 ms | 212 KB | n = 2 |
5 | Correct | 0 ms | 212 KB | n = 2 |
6 | Correct | 0 ms | 212 KB | n = 2 |
7 | Correct | 1 ms | 212 KB | n = 3 |
8 | Incorrect | 1 ms | 304 KB | answer is not correct: 209372231 instead of 102553483 |
9 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 74 ms | 11732 KB | n = 199999 |
2 | Correct | 75 ms | 11700 KB | n = 199991 |
3 | Correct | 75 ms | 11704 KB | n = 199993 |
4 | Correct | 56 ms | 10944 KB | n = 152076 |
5 | Correct | 34 ms | 5884 KB | n = 93249 |
6 | Correct | 70 ms | 11700 KB | n = 199910 |
7 | Correct | 82 ms | 14884 KB | n = 199999 |
8 | Correct | 72 ms | 14504 KB | n = 199997 |
9 | Correct | 65 ms | 14392 KB | n = 171294 |
10 | Correct | 59 ms | 13524 KB | n = 140872 |
11 | Correct | 71 ms | 14456 KB | n = 199886 |
12 | Correct | 73 ms | 14880 KB | n = 199996 |
13 | Correct | 72 ms | 14504 KB | n = 200000 |
14 | Correct | 72 ms | 14748 KB | n = 199998 |
15 | Correct | 73 ms | 14728 KB | n = 200000 |
16 | Correct | 75 ms | 15132 KB | n = 199998 |
17 | Correct | 81 ms | 15648 KB | n = 200000 |
18 | Correct | 73 ms | 15180 KB | n = 190000 |
19 | Correct | 68 ms | 14848 KB | n = 177777 |
20 | Incorrect | 38 ms | 7968 KB | answer is not correct: 1 instead of 0 |
21 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | n = 2 |
2 | Correct | 0 ms | 212 KB | n = 2 |
3 | Correct | 0 ms | 212 KB | n = 2 |
4 | Correct | 0 ms | 212 KB | n = 2 |
5 | Correct | 0 ms | 212 KB | n = 2 |
6 | Correct | 0 ms | 212 KB | n = 2 |
7 | Correct | 1 ms | 212 KB | n = 3 |
8 | Incorrect | 1 ms | 304 KB | answer is not correct: 209372231 instead of 102553483 |
9 | Halted | 0 ms | 0 KB | - |