제출 #532575

#제출 시각아이디문제언어결과실행 시간메모리
532575stefantaga고대 책들 (IOI17_books)C++14
0 / 100
1 ms304 KiB
#include <cstdio> #include <vector> #include <cassert> #include <bits/stdc++.h> #include "books.h" int n,v[1000005]; using namespace std; long long minimum_walk(std::vector<int> p, int s) { n=p.size(); int i; for (i=1; i<=n; i++) { v[i]=p[i-1]+1; } int sum=0,acum=s+1; for (i=1; i<=n; i++) { if (v[i]!=i) { int ceam; sum=sum+abs(acum-i); acum=i; ceam=v[i]; v[i]=0; while (v[ceam]&&ceam!=acum) { sum=sum+abs(acum-ceam); acum=ceam; swap(v[ceam],ceam); } sum=sum+abs(acum-ceam); acum=ceam; v[ceam]=ceam; } } sum=sum+abs(acum-(s+1)); return sum; } #ifdef HOME int main() { ifstream cin("date.in"); ofstream cout("date.out"); int n, s; cin>>n>>s; vector<int> p((unsigned) n); for(int i = 0; i < n; i++) { cin>>p[i]; } long long res = minimum_walk(p, s); cout<<res; return 0; } #endif // HOME
#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...