제출 #790828

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
790828		NothingXD	고대 책들 (IOI17_books)	C++17	0 / 100	0 ms	212 KiB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;

void debug_out(){cerr << endl;}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 1e6 + 10;

int n, cnt[maxn][2];

ll minimum_walk(vector<int> p, int s) {
	n = p.size();
	int mn = s, mx = s;
	for (int i = 0; i < n; i++){
		if (p[i] == i) continue;
		mn = min(mn, i);
		mx = max(mx, i);
		if (p[i] < i){
			cnt[p[i]+1][0]++;;
			cnt[i+1][0]--;
		}
		else{
			cnt[p[i]+1][1]++;
			cnt[i+1][1]--;
		}
	}
	ll ans = 0;
	for (int i = mn+1; i < mx; i++){
		cnt[i][0] += cnt[i-1][0];
		cnt[i][1] += cnt[i-1][1];
		if (cnt[i][0] == 0) cnt[i][0]++;
		if (cnt[i][1] == 0) cnt[i][1]++;
		ans += 2 * max(cnt[i][0], cnt[i][1]);
	}
	return ans;

	return 0;
}

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