제출 #790878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
790878		fatemetmhr	고대 책들 (IOI17_books)	C++17	50 / 100	144 ms	28664 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 per[maxn5], req[maxn5], cmp[maxn5], ps[maxn5];
int num = 0, av[maxn5], cnt = 0;
bool mark[maxn5];


void dfs(int v){
	mark[v] = true;
	req[min(v, per[v])]++;
	req[max(v, per[v])]--;
	ans += abs(v - per[v]);
	cnt++;
	cmp[v] = num;
	if(!mark[per[v]])
		dfs(per[v]);
}

int get(int l, int r){
	if(l > r)
		return 0;
	return ps[r] - (l ? ps[l - 1] : 0);
}


long long minimum_walk(std::vector<int> p, int s) {
	int n = p.size();
	int mx = 0;
	for(int i = 0; i < n; i++){
		per[i] = p[i];
		if(i != p[i])
			mx = i;
	}
	int good = 0;
	fill(av, av + n + 5, n + 10);
	for(int i = 0; i < n; i++) if(!mark[i]){
		cnt = 0;
		dfs(i);
		if(cnt > 1)
			good++;
		num++;
	}
	int emp = 0, cur = 0;
	for(int i = 0; i < n; i++){
		cur += req[i];
		if(i)
			ps[i] = ps[i - 1];
		if(!cur)
			ps[i]++;
	}
	memset(req, 0, sizeof req);
	int ok = 0;
	int mn = 2 * n;
	for(int l = s; l >= 0; l--){
		req[cmp[l]]++;
		if(p[l] != l && req[cmp[l]] == 1)
			ok++;
		for(int r = s; r < n; r++){
			req[cmp[r]]++;
			if(p[r] != r && req[cmp[r]] == 1)
				ok++;
			if(ok == good)
				mn = min(mn, 2 * get(l, r - 1));
		}
		for(int r = s; r < n; r++){
			req[cmp[r]]--;
			if(p[r] != r && !req[cmp[r]])
				ok--;
		}
	}
	return ans + mn;
	return ans + 2 * get(0, mx - 1);
}

컴파일 시 표준 에러 (stderr) 메시지

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:67:6: warning: unused variable 'emp' [-Wunused-variable]
   67 |  int emp = 0, cur = 0;
      |      ^~~

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