Submission #295630

#TimeUsernameProblemLanguageResultExecution timeMemory
295630williamMBDKAncient Books (IOI17_books)C++14
0 / 100
1 ms256 KiB
#include<bits/stdc++.h> using namespace std; #include "books.h" #define int long long long long minimum_walk(std::vector<signed> p, signed s) { int N = p.size(); int res = 0; bool b = 0; for(int i = 0; i < N; i++){ if(p[i] != i && !b) res += i, b = 1; res += abs(p[i] - i); } return res; }
#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...