Submission #422988

#TimeUsernameProblemLanguageResultExecution timeMemory
422988MDarioAncient Books (IOI17_books)C++11
0 / 100
1 ms204 KiB
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
long long minimum_walk(vector<int> p, int s){
    int n=p.size(), r=0, x=0, y=0;
    bool b[n];
    for(int i=0; i<n; i++)b[i]=0;
    for(int i=0; i<n; i++){
        if(!b[i]){
            r+=2*(i-x);
            x=i;
            r+=p[i]-i;
            y=p[i];
            while(y!=i){
                b[y]=1;
                r+=abs(p[y]-y);
                y=p[y];
            }
            b[y]=1;
        }
    }
	return r;
}
#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...