# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921025 | 2024-02-03T08:59:52 Z | salmon | Ancient Books (IOI17_books) | C++14 | 2 ms | 1624 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]; if(i == j) soom += 2; soom += abs(j - i); while(j != i){ int temp = j; fre = max(fre,j); done[j] = true; j = p[j]; soom += abs(temp - j); } } for(int i = N - 1; i > 0; i--){ if(p[i] != i){ break; } soom -= 2; } return soom; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 1624 KB | 3rd lines differ - on the 1st token, expected: '6', found: '8' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 1624 KB | 3rd lines differ - on the 1st token, expected: '6', found: '8' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 1624 KB | 3rd lines differ - on the 1st token, expected: '6', found: '8' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1624 KB | 3rd lines differ - on the 1st token, expected: '3304', found: '5150' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 1624 KB | 3rd lines differ - on the 1st token, expected: '6', found: '8' |
2 | Halted | 0 ms | 0 KB | - |