제출 #821249

#제출 시각아이디문제언어결과실행 시간메모리
821249vjudge1고대 책들 (IOI17_books)C++17
0 / 100
2069 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 c = 0, n = p.size(); for(; n && p[n - 1] == n - 1; -- n); for(int cr = 0, take = -1; cr < n;) { if(cr == p[cr]) { cr += (take == -1 || take > cr ? +1 : -1); continue; } if(take == cr) { swap(take, p[cr]); if(cr == n - 1) { -- n; } } else if(take == -1) { take = p[cr]; p[cr] = -1; } else if(take < p[cr]){ swap(take, p[cr]); } } return c; }
#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...