제출 #70220

#제출 시각아이디문제언어결과실행 시간메모리
70220E869120고대 책들 (IOI17_books)C++14
0 / 100
3 ms640 KiB
#include "books.h" #include <bits/stdc++.h> int n;bool used[1009]; long long minimum_walk(std::vector<int> p, int s) { n=p.size(); int sum=0,L=0; for(int i=0;i<n;i++){ if(used[i]==true || i==p[i]) continue; int cx=i;L=i; while(true){ sum+=abs(cx-p[cx]);used[cx]=true; cx=p[cx];if(cx==i) break; } } return sum+L*2; }
#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...