제출 #600837

#제출 시각아이디문제언어결과실행 시간메모리
600837Lucpp고대 책들 (IOI17_books)C++17
0 / 100
2077 ms212 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; long long minimum_walk(vector<int> p, int s){ int n = (int)p.size(); ll ans = 0; vector<bool> vis(n); int mi = s, ma = s; int l = s, r = s; while(true){ int i = -1; while(r <= ma){ if(!vis[r]){ i = r; break; } r++; } if(i != -1) while(l >= mi){ if(!vis[l]){ i = l; break; } l--; } if(i == -1){ int oldR = r, oldL = l; while(r < n){ if(p[r] != r){ i = r; ans += 2*(r+1-oldR); break; } r++; } if(i == -1) while(l >= 0){ if(p[l] != l){ i = l; ans += 2*(oldL+1-l); break; } l--; } if(i == -1) break; } int j = i; do { vis[j] = true; mi = min(mi, p[j]); ma = max(ma, p[j]); ans += abs(j-p[j]); j = p[j]; }while(j != i); } return ans; }
#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...