# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
74198 | 2018-08-30T12:23:56 Z | nvmdava | 고대 책들 (IOI17_books) | C++17 | 2 ms | 788 KB |
#include "books.h" #include <bits/stdc++.h> using namespace std; int r = 0; vector<int> p; bool in[1000001]; void go(int v){ if(in[v] == 1){ return; } in[v] = 1; r = max(r, v); go(p[v]); } long long minimum_walk(vector<int> p, int s) { ::p = p; int q = 0; long long ans = 0; for(int i = 0; i < p.size(); i++){ ans += (long long)abs(i - p[i]); if(in[i] || p[i] == i) continue; if(r < i){ q = i; } go(i); } ans += (long long) q * 2; return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 592 KB | Output is correct |
4 | Correct | 2 ms | 596 KB | Output is correct |
5 | Correct | 2 ms | 596 KB | Output is correct |
6 | Correct | 2 ms | 596 KB | Output is correct |
7 | Correct | 2 ms | 596 KB | Output is correct |
8 | Correct | 2 ms | 684 KB | Output is correct |
9 | Correct | 2 ms | 716 KB | Output is correct |
10 | Correct | 2 ms | 716 KB | Output is correct |
11 | Correct | 2 ms | 716 KB | Output is correct |
12 | Correct | 2 ms | 716 KB | Output is correct |
13 | Correct | 2 ms | 716 KB | Output is correct |
14 | Correct | 2 ms | 716 KB | Output is correct |
15 | Correct | 2 ms | 716 KB | Output is correct |
16 | Correct | 2 ms | 788 KB | Output is correct |
17 | Correct | 2 ms | 788 KB | Output is correct |
18 | Correct | 2 ms | 788 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 592 KB | Output is correct |
4 | Correct | 2 ms | 596 KB | Output is correct |
5 | Correct | 2 ms | 596 KB | Output is correct |
6 | Correct | 2 ms | 596 KB | Output is correct |
7 | Correct | 2 ms | 596 KB | Output is correct |
8 | Correct | 2 ms | 684 KB | Output is correct |
9 | Correct | 2 ms | 716 KB | Output is correct |
10 | Correct | 2 ms | 716 KB | Output is correct |
11 | Correct | 2 ms | 716 KB | Output is correct |
12 | Correct | 2 ms | 716 KB | Output is correct |
13 | Correct | 2 ms | 716 KB | Output is correct |
14 | Correct | 2 ms | 716 KB | Output is correct |
15 | Correct | 2 ms | 716 KB | Output is correct |
16 | Correct | 2 ms | 788 KB | Output is correct |
17 | Correct | 2 ms | 788 KB | Output is correct |
18 | Correct | 2 ms | 788 KB | Output is correct |
19 | Correct | 2 ms | 788 KB | Output is correct |
20 | Correct | 2 ms | 788 KB | Output is correct |
21 | Correct | 2 ms | 788 KB | Output is correct |
22 | Incorrect | 2 ms | 788 KB | 3rd lines differ - on the 1st token, expected: '2082', found: '2782' |
23 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 592 KB | Output is correct |
4 | Correct | 2 ms | 596 KB | Output is correct |
5 | Correct | 2 ms | 596 KB | Output is correct |
6 | Correct | 2 ms | 596 KB | Output is correct |
7 | Correct | 2 ms | 596 KB | Output is correct |
8 | Correct | 2 ms | 684 KB | Output is correct |
9 | Correct | 2 ms | 716 KB | Output is correct |
10 | Correct | 2 ms | 716 KB | Output is correct |
11 | Correct | 2 ms | 716 KB | Output is correct |
12 | Correct | 2 ms | 716 KB | Output is correct |
13 | Correct | 2 ms | 716 KB | Output is correct |
14 | Correct | 2 ms | 716 KB | Output is correct |
15 | Correct | 2 ms | 716 KB | Output is correct |
16 | Correct | 2 ms | 788 KB | Output is correct |
17 | Correct | 2 ms | 788 KB | Output is correct |
18 | Correct | 2 ms | 788 KB | Output is correct |
19 | Correct | 2 ms | 788 KB | Output is correct |
20 | Correct | 2 ms | 788 KB | Output is correct |
21 | Correct | 2 ms | 788 KB | Output is correct |
22 | Incorrect | 2 ms | 788 KB | 3rd lines differ - on the 1st token, expected: '2082', found: '2782' |
23 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 788 KB | 3rd lines differ - on the 1st token, expected: '3304', found: '2744' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 592 KB | Output is correct |
4 | Correct | 2 ms | 596 KB | Output is correct |
5 | Correct | 2 ms | 596 KB | Output is correct |
6 | Correct | 2 ms | 596 KB | Output is correct |
7 | Correct | 2 ms | 596 KB | Output is correct |
8 | Correct | 2 ms | 684 KB | Output is correct |
9 | Correct | 2 ms | 716 KB | Output is correct |
10 | Correct | 2 ms | 716 KB | Output is correct |
11 | Correct | 2 ms | 716 KB | Output is correct |
12 | Correct | 2 ms | 716 KB | Output is correct |
13 | Correct | 2 ms | 716 KB | Output is correct |
14 | Correct | 2 ms | 716 KB | Output is correct |
15 | Correct | 2 ms | 716 KB | Output is correct |
16 | Correct | 2 ms | 788 KB | Output is correct |
17 | Correct | 2 ms | 788 KB | Output is correct |
18 | Correct | 2 ms | 788 KB | Output is correct |
19 | Correct | 2 ms | 788 KB | Output is correct |
20 | Correct | 2 ms | 788 KB | Output is correct |
21 | Correct | 2 ms | 788 KB | Output is correct |
22 | Incorrect | 2 ms | 788 KB | 3rd lines differ - on the 1st token, expected: '2082', found: '2782' |
23 | Halted | 0 ms | 0 KB | - |