Submission #293001

#TimeUsernameProblemLanguageResultExecution timeMemory
293001Haunted_CppAncient Books (IOI17_books)C++17
0 / 100
1 ms512 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; const int MAX_N = 1e6 + 5; vector<int> p; long long solve(int idx, int carry) { int current_location = idx; int nxt_location = carry; if (current_location != nxt_location) { return abs(idx - nxt_location) + solve(nxt_location, carry); } assert(idx != -1); int was = p[current_location]; p[current_location] = carry; assert(was != carry); carry = was; nxt_location = carry; if (carry == -1) return current_location; return abs(idx - nxt_location) + solve(nxt_location, carry); } long long minimum_walk(vector<int> p, int s) { assert(s == 0); ::p = p; const int n = p.size(); for (int i = 0; i < n; i++) { if (p[i] != i) { int was = p[i]; ::p[i] = -1; return i + solve(i, was); } } return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...