# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
35837 | 2017-12-01T10:06:25 Z | SElayyan | 고대 책들 (IOI17_books) | C++14 | 0 ms | 2016 KB |
#include "books.h" #include <bits/stdc++.h> using namespace std; long long minimum_walk(vector<int> p, int s) { int f = 0 ; for(int i = 0 ; i < p.size(); i++){ if(i != p[i]){ f = i ; break; } } int ans = 0 ; for( int i = 0 ; i < p.size() ; i++){ if(i != p[i]){ ans+=abs(p[i] - i); } } ans += (f * 2); return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2016 KB | Output is correct |
2 | Correct | 0 ms | 2016 KB | Output is correct |
3 | Correct | 0 ms | 2016 KB | Output is correct |
4 | Correct | 0 ms | 2016 KB | Output is correct |
5 | Correct | 0 ms | 2016 KB | Output is correct |
6 | Correct | 0 ms | 2016 KB | Output is correct |
7 | Correct | 0 ms | 2016 KB | Output is correct |
8 | Correct | 0 ms | 2016 KB | Output is correct |
9 | Correct | 0 ms | 2016 KB | Output is correct |
10 | Correct | 0 ms | 2016 KB | Output is correct |
11 | Correct | 0 ms | 2016 KB | Output is correct |
12 | Correct | 0 ms | 2016 KB | Output is correct |
13 | Correct | 0 ms | 2016 KB | Output is correct |
14 | Correct | 0 ms | 2016 KB | Output is correct |
15 | Correct | 0 ms | 2016 KB | Output is correct |
16 | Correct | 0 ms | 2016 KB | Output is correct |
17 | Correct | 0 ms | 2016 KB | Output is correct |
18 | Correct | 0 ms | 2016 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2016 KB | Output is correct |
2 | Correct | 0 ms | 2016 KB | Output is correct |
3 | Correct | 0 ms | 2016 KB | Output is correct |
4 | Correct | 0 ms | 2016 KB | Output is correct |
5 | Correct | 0 ms | 2016 KB | Output is correct |
6 | Correct | 0 ms | 2016 KB | Output is correct |
7 | Correct | 0 ms | 2016 KB | Output is correct |
8 | Correct | 0 ms | 2016 KB | Output is correct |
9 | Correct | 0 ms | 2016 KB | Output is correct |
10 | Correct | 0 ms | 2016 KB | Output is correct |
11 | Correct | 0 ms | 2016 KB | Output is correct |
12 | Correct | 0 ms | 2016 KB | Output is correct |
13 | Correct | 0 ms | 2016 KB | Output is correct |
14 | Correct | 0 ms | 2016 KB | Output is correct |
15 | Correct | 0 ms | 2016 KB | Output is correct |
16 | Correct | 0 ms | 2016 KB | Output is correct |
17 | Correct | 0 ms | 2016 KB | Output is correct |
18 | Correct | 0 ms | 2016 KB | Output is correct |
19 | Correct | 0 ms | 2016 KB | Output is correct |
20 | Correct | 0 ms | 2016 KB | Output is correct |
21 | Correct | 0 ms | 2016 KB | Output is correct |
22 | Incorrect | 0 ms | 2016 KB | 3rd lines differ - on the 1st token, expected: '2082', found: '788' |
23 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2016 KB | Output is correct |
2 | Correct | 0 ms | 2016 KB | Output is correct |
3 | Correct | 0 ms | 2016 KB | Output is correct |
4 | Correct | 0 ms | 2016 KB | Output is correct |
5 | Correct | 0 ms | 2016 KB | Output is correct |
6 | Correct | 0 ms | 2016 KB | Output is correct |
7 | Correct | 0 ms | 2016 KB | Output is correct |
8 | Correct | 0 ms | 2016 KB | Output is correct |
9 | Correct | 0 ms | 2016 KB | Output is correct |
10 | Correct | 0 ms | 2016 KB | Output is correct |
11 | Correct | 0 ms | 2016 KB | Output is correct |
12 | Correct | 0 ms | 2016 KB | Output is correct |
13 | Correct | 0 ms | 2016 KB | Output is correct |
14 | Correct | 0 ms | 2016 KB | Output is correct |
15 | Correct | 0 ms | 2016 KB | Output is correct |
16 | Correct | 0 ms | 2016 KB | Output is correct |
17 | Correct | 0 ms | 2016 KB | Output is correct |
18 | Correct | 0 ms | 2016 KB | Output is correct |
19 | Correct | 0 ms | 2016 KB | Output is correct |
20 | Correct | 0 ms | 2016 KB | Output is correct |
21 | Correct | 0 ms | 2016 KB | Output is correct |
22 | Incorrect | 0 ms | 2016 KB | 3rd lines differ - on the 1st token, expected: '2082', found: '788' |
23 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2016 KB | 3rd lines differ - on the 1st token, expected: '3304', found: '2744' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2016 KB | Output is correct |
2 | Correct | 0 ms | 2016 KB | Output is correct |
3 | Correct | 0 ms | 2016 KB | Output is correct |
4 | Correct | 0 ms | 2016 KB | Output is correct |
5 | Correct | 0 ms | 2016 KB | Output is correct |
6 | Correct | 0 ms | 2016 KB | Output is correct |
7 | Correct | 0 ms | 2016 KB | Output is correct |
8 | Correct | 0 ms | 2016 KB | Output is correct |
9 | Correct | 0 ms | 2016 KB | Output is correct |
10 | Correct | 0 ms | 2016 KB | Output is correct |
11 | Correct | 0 ms | 2016 KB | Output is correct |
12 | Correct | 0 ms | 2016 KB | Output is correct |
13 | Correct | 0 ms | 2016 KB | Output is correct |
14 | Correct | 0 ms | 2016 KB | Output is correct |
15 | Correct | 0 ms | 2016 KB | Output is correct |
16 | Correct | 0 ms | 2016 KB | Output is correct |
17 | Correct | 0 ms | 2016 KB | Output is correct |
18 | Correct | 0 ms | 2016 KB | Output is correct |
19 | Correct | 0 ms | 2016 KB | Output is correct |
20 | Correct | 0 ms | 2016 KB | Output is correct |
21 | Correct | 0 ms | 2016 KB | Output is correct |
22 | Incorrect | 0 ms | 2016 KB | 3rd lines differ - on the 1st token, expected: '2082', found: '788' |
23 | Halted | 0 ms | 0 KB | - |