Submission #975217

#TimeUsernameProblemLanguageResultExecution timeMemory
975217StefanSebezAncient Books (IOI17_books)C++14
0 / 100
1 ms348 KiB
#include "books.h" #include<bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define ll long long long long minimum_walk(std::vector<int> p, int s){ int n=p.size();ll res=0; for(int i=0;i<n;i++){ int j=i; int trenutni=p[i]; while(j<n && p[j]!=i){ if(trenutni==j){ trenutni=p[j]; p[j]=j; } j++; } p[j]=trenutni; p[i]=i; res+=2*(j-i); res++; //for(int k=0;k<n;k++) printf("%i ",p[k]); //printf("\n"); bool sortirano=true; for(int k=1;k<n;k++){ if(p[k-1]>p[k]) sortirano=false; } if(sortirano) break; res++; } res--; 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...