Submission #790825

#	Time	Username	Problem	Language	Result	Execution time	Memory
790825		fatemetmhr	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	340 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];
int num = 0, av[maxn5], cnt = 0;
bool mark[maxn5];

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


long long minimum_walk(std::vector<int> p, int s) {
	int n = p.size();
	for(int i = 0; i < n; i++)
		per[i] = p[i];
	fill(av, av + n + 5, n + 10);
	int mx = 0;
	for(int i = 0; i < n; i++) if(!mark[i]){
		cnt = 0;
		dfs(i);
		if(cnt > 1)
			mx = max(mx, av[num]);

		num++;
	}
	return ans + 2 * mx;
}

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