# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
921070 | 2024-02-03T09:40:01 Z | salmon | 고대 책들 (IOI17_books) | C++14 | 1 ms | 1372 KB |
#include <cstdio> #include <vector> #include <bits/stdc++.h> using namespace std; long long minimum_walk(vector<int> p, int s) { bool done[1100100]; int N = p.size(); int un = N; int soom = 0; int i = 0; /*while(un != 0){ if(start ) }*/ int fre = 0; for(int i = 0; i < N; i++){ if(done[i]) continue; if(i > fre){ soom += 2; } fre = i; int j = p[i]; soom += abs(j - i); while(j != i){ int temp = j; fre = max(fre,j); done[j] = true; j = p[j]; soom += abs(temp - j); } } return soom; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1368 KB | Output is correct |
2 | Correct | 1 ms | 1372 KB | Output is correct |
3 | Correct | 1 ms | 1368 KB | Output is correct |
4 | Correct | 1 ms | 1372 KB | Output is correct |
5 | Incorrect | 1 ms | 1372 KB | 3rd lines differ - on the 1st token, expected: '4', found: '6' |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1368 KB | Output is correct |
2 | Correct | 1 ms | 1372 KB | Output is correct |
3 | Correct | 1 ms | 1368 KB | Output is correct |
4 | Correct | 1 ms | 1372 KB | Output is correct |
5 | Incorrect | 1 ms | 1372 KB | 3rd lines differ - on the 1st token, expected: '4', found: '6' |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1368 KB | Output is correct |
2 | Correct | 1 ms | 1372 KB | Output is correct |
3 | Correct | 1 ms | 1368 KB | Output is correct |
4 | Correct | 1 ms | 1372 KB | Output is correct |
5 | Incorrect | 1 ms | 1372 KB | 3rd lines differ - on the 1st token, expected: '4', found: '6' |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1368 KB | 3rd lines differ - on the 1st token, expected: '3304', found: '4070' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1368 KB | Output is correct |
2 | Correct | 1 ms | 1372 KB | Output is correct |
3 | Correct | 1 ms | 1368 KB | Output is correct |
4 | Correct | 1 ms | 1372 KB | Output is correct |
5 | Incorrect | 1 ms | 1372 KB | 3rd lines differ - on the 1st token, expected: '4', found: '6' |
6 | Halted | 0 ms | 0 KB | - |