제출 #797557

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
797557		fatemetmhr	Ancient Books (IOI17_books)	C++17	50 / 100	91 ms	15644 KiB

books

//  ~ Be Name Khoda ~  //

#include "books.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  1e6   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   + 7;
const ll  inf   =  1e18;

ll ans = 0;
int req[maxn5];
int num = 0, av[maxn5], cnt = 0;



long long minimum_walk(std::vector<int> per, int s) {
	int n = per.size();
	int mx = s, mn = s;
	for(int i = 0; i < n; i++){
		req[min(i, per[i])]++;
		req[max(i, per[i])]--;
		ans += abs(per[i] - i);
		if(i != per[i]){
			mn = min(mn, i);
			mx = max(mx, i);
		}
	}
	if(mn == n)
		return 0;
	int emp = 0, cur = 0;
	for(int i = mn; i < mx - 1; i++){
		cur += req[i];
		if(!cur)
			emp++;
	}
	return ans + 2 * emp;
}

• Subtask 1: 12 / 12
• Subtask 2: 10 / 10
• Subtask 3: 28 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30