제출 #804498

#제출 시각아이디문제언어결과실행 시간메모리
804498Benmath고대 책들 (IOI17_books)C++14
0 / 100
0 ms212 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; long long minimum_walk(std::vector<int> p, int s) { long long int sum=0; int n=p.size(); int vis[n]; for(int i=0;i<n;i++){ vis[i]=0; } long long int sad=0; for(int i=0;i<n;i++){ if(vis[i]==0 and i!=p[i]){ sad=i; int i1=i; int t1=0; long long int iduci=p[i]; long long int tren=i; while(t1==0){ sum=sum+abs(iduci-tren); vis[tren]++; tren=iduci; iduci=p[tren]; if(tren==i1){ break; } } } } if(sad<p[0]){ sum=sum+2*sad; } return sum; }
#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...