# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
35838 | SElayyan | 고대 책들 (IOI17_books) | C++14 | 0 ms | 2016 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int> p, int s) {
long long f = 0 ;
for(int i = 0 ; i < p.size(); i++){
if(i != p[i]){
f = i*1ll ;
break;
}
}
long long ans = 0 ;
for( int i = 0 ; i < p.size() ; i++){
if(i*1ll != p[i]){
ans+=abs(p[i] - i*1ll);
}
}
ans += (f * 2*1ll);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |