제출 #832263

#제출 시각아이디문제언어결과실행 시간메모리
832263MadokaMagicaFan고대 책들 (IOI17_books)C++14
0 / 100
1 ms300 KiB
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define sz(v) ((int)v.size())

ll minimum_walk(vector<int> p, int s) {
	/* assumes s = 0 */
	ll ans = 0;
	int n = sz(p);
	for (int i = 0; i < n; ++i)
		if (p[i] != i) {
			ans += i;
			break;
		}

	for (int i = n-1; i >= 0; --i)
		if (p[i] != i) {
			ans += i;
			break;
		}

	for (int i = 0; i < n; ++i)
		if (p[i] < i)
			ans += (ll)(i - p[i]);

	return ans;
}


#ifdef ONPC
int main() {
	int n, s;
	cin >> n >> s;
	vector<int> p(n);
	for(int i = 0; i < n; ++i)
		cin >> p[i];

	cout << minimum_walk(p, s);
}
#endif
#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...