# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292752 | 2020-09-07T12:52:44 Z | Saboon | Ancient Books (IOI17_books) | C++17 | 1 ms | 384 KB |
#include "books.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 1e6 + 10; bool visited[maxn], root[maxn]; long long minimum_walk(vector<int> p, int s){ int n = p.size(); set<int> S; ll answer = 0; for (int i = 0; i < n; i++) answer += abs(p[i]-i); int tmp = 0, Max = -1; for (int i = 0; i < n; i++){ if (!visited[i] and p[i] != i){ if (i < Max) tmp = i; int x = i; while (!visited[x]){ visited[x] = 1; Max = max(Max, x); x = p[x]; } } } answer += 2*tmp; return answer; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | 3rd lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | 3rd lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | 3rd lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | 3rd lines differ - on the 1st token, expected: '3304', found: '4728' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | 3rd lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |