제출 #1048437

#제출 시각아이디문제언어결과실행 시간메모리
1048437pcc고대 책들 (IOI17_books)C++17
12 / 100
0 ms348 KiB
#include "books.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int mxn = 1e6+10;
int N;

long long minimum_walk(std::vector<int> p, int s) {
	ll ans = 0;
	N = p.size();
	for(int i = 0;i<N;i++)ans += abs(p[i]-i);
	for(int i = 0;i<N;i++){
		if(i != p[i]){
			ans += i<<1;
			break;
		}
	}
	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...