oj.uz

Submission #834282

# Submission time Handle Problem Language Result Execution time Memory
834282 2023-08-22T12:36:51 Z Josia Ancient Books (IOI17_books) C++17
100 / 100
 1258 ms 244596 KB 
#include "books.h"
#include <bits/stdc++.h>

using namespace std;

#define int int64_t


vector<int> p;
int s;
int n;
int ret;

struct cycle {
	int left=1e9, right=-1e9;
	set<int> points;
};
bool CycleLess(cycle &a, cycle &b) {
	return pair<int, int>{a.left, a.right} < pair<int, int>{b.left, b.right};
}
bool merge(cycle &a, cycle &b) {			// a<-b
	if (!(b.left < a.left && b.right < a.right && b.right > a.left)) return 0;

	// if (a.points.size() < b.points.size()) swap(a, b);

	a.left = b.left;
	for (int i: b.points) a.points.insert(i);
	
	return 1;
}
bool contains(cycle &a, cycle &b) {
	return (a.left <= b.left && b.right <= a.right);
}



vector<bool> vis;
cycle getCycle(int v) {
	// assert(vis[v]==0);

	cycle res;

	while (vis[v] == 0) {
		vis[v] = 1;
		res.left = min(res.left, v);
		res.right = max(res.right, v);
		res.points.insert(v);

		ret += abs(v-p[v]);
		v = p[v];
	}
	return res;
}

vector<cycle> mergedCycles;
vector<int> parents;

int dfs(int v, int par) {
	parents[v] = par;
	int w = v+1;

	while (w<(int)mergedCycles.size() && contains(mergedCycles[v], mergedCycles[w])) {
		w = dfs(w, v);
	}
	return w;
}


void solve() {
	vis.assign(n, 0);

	vector<cycle> cycles;

	if (p[s]==s) cycles.push_back({s, s, {s}});
	int globLeft=s, globRight=s;

	for (int i = 0; i<n; i++) {
		if (vis[i]) continue;
		cycles.push_back(getCycle(i));
		if (cycles.back().left == cycles.back().right) cycles.pop_back();
		else {
			globLeft = min(globLeft, cycles.back().left);
			globRight = max(globRight, cycles.back().right);
		}
	}

	sort(cycles.begin(), cycles.end(), CycleLess);

	vector<int> inds;

	set<pair<int, int>> pq;

	for (int i = 0; i<(int)(cycles.size()); i++) {
		auto pointer = pq.lower_bound({cycles[i].left, -1e9});
		vector<pair<int, int>> toErase, toInsert;
		while (pointer != pq.end() && (*pointer).first <= cycles[i].right) {
			toErase.push_back(*pointer);

			merge(cycles[i], cycles[(*pointer).second]);

			pointer++;
		}

		for (auto i: toErase) pq.erase(i);
		pq.insert({cycles[i].right, i});
	}
	
	for (auto i: pq) inds.push_back(i.second);
	sort(inds.begin(), inds.end());
	


	mergedCycles.clear();
	for (int i: inds) mergedCycles.push_back(cycles[i]);

	// assert(is_sorted(mergedCycles.begin(), mergedCycles.end(), CycleLess));

	sort(mergedCycles.begin(), mergedCycles.end(), CycleLess);

	parents.assign(mergedCycles.size(), -1);
	for (int i = 0; i<(int)mergedCycles.size(); i=dfs(i, -1));


	int pos=-1;
	for (int i = 0; i<(int)mergedCycles.size(); i++) {
		if (mergedCycles[i].points.count(s)) pos = i;
	}
	// assert(pos!=-1);



	vector<pair<int, int>> jump(n);

	for (int i = 0; i<n; i++) {
		jump[i]={i, i};
	}

	for (int i: inds) {
		for (int j: cycles[i].points) {
			jump[j].first = cycles[i].left;
			jump[j].second = cycles[i].right;
		}
	}


	
	while (parents[pos] != -1) {
		cycle elem = mergedCycles[pos];
		cycle parent = mergedCycles[parents[pos]];

		auto goRightPoint = parent.points.lower_bound(elem.left);
		auto goLeftPoint = prev(parent.points.upper_bound(elem.right));

		// assert(parent.points.lower_bound(elem.left) != parent.points.end());
		// assert(parent.points.upper_bound(elem.right) != parent.points.begin());

		// let's hope it'll not go wrong.

		int right = *goRightPoint, left = *goLeftPoint;

		// if (right <= elem.right || left >= elem.left) {
		// 	pos = parents[pos];
		// 	continue;
		// }

		int costRight = 0;
		int posToRight = elem.right;
		while (posToRight < right) {
			costRight++;
			posToRight = jump[posToRight+1].second;
		}

		int costLeft = 0;
		int posToLeft = elem.left;
		while (posToLeft > left) {
			costLeft++;
			posToLeft = jump[posToLeft-1].first;
		}

		ret += 2*min(costLeft, costRight);

		pos = parents[pos];
	}

	vector<int> noParent;

	for (int i = 0; i<(int)parents.size(); i++) {
		if (parents[i] == -1) noParent.push_back(i);
	}

	for (int i = 0; i<(int)(noParent.size())-1; i++) {
		assert(mergedCycles[noParent[i+1]].left>mergedCycles[noParent[i]].right);
		ret+=2*(mergedCycles[noParent[i+1]].left-mergedCycles[noParent[i]].right);
	}
}


long long minimum_walk(vector<signed> _p, signed _s) {
	ret = 0;
	s = _s;
	n = _p.size();
	p.resize(n); for (int i = 0; i<n; i++) p[i] = _p[i];

	
	solve();


	return ret;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1258 ms 168968 KB Output is correct
31 Correct 964 ms 190008 KB Output is correct
32 Correct 116 ms 38420 KB Output is correct
33 Correct 296 ms 128384 KB Output is correct
34 Correct 294 ms 128264 KB Output is correct
35 Correct 332 ms 148828 KB Output is correct
36 Correct 396 ms 161572 KB Output is correct
37 Correct 398 ms 153220 KB Output is correct
38 Correct 437 ms 151072 KB Output is correct
39 Correct 414 ms 152268 KB Output is correct
40 Correct 485 ms 152804 KB Output is correct
41 Correct 739 ms 155180 KB Output is correct
42 Correct 620 ms 152716 KB Output is correct
43 Correct 333 ms 136616 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 428 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1258 ms 168968 KB Output is correct
31 Correct 964 ms 190008 KB Output is correct
32 Correct 116 ms 38420 KB Output is correct
33 Correct 296 ms 128384 KB Output is correct
34 Correct 294 ms 128264 KB Output is correct
35 Correct 332 ms 148828 KB Output is correct
36 Correct 396 ms 161572 KB Output is correct
37 Correct 398 ms 153220 KB Output is correct
38 Correct 437 ms 151072 KB Output is correct
39 Correct 414 ms 152268 KB Output is correct
40 Correct 485 ms 152804 KB Output is correct
41 Correct 739 ms 155180 KB Output is correct
42 Correct 620 ms 152716 KB Output is correct
43 Correct 333 ms 136616 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 428 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 1 ms 432 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 296 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 428 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 232 ms 95680 KB Output is correct
65 Correct 206 ms 85680 KB Output is correct
66 Correct 457 ms 152932 KB Output is correct
67 Correct 409 ms 152136 KB Output is correct
68 Correct 31 ms 14960 KB Output is correct
69 Correct 32 ms 15192 KB Output is correct
70 Correct 29 ms 13632 KB Output is correct
71 Correct 24 ms 11528 KB Output is correct
72 Correct 18 ms 8688 KB Output is correct
73 Correct 45 ms 16984 KB Output is correct
74 Correct 281 ms 128176 KB Output is correct
75 Correct 284 ms 128148 KB Output is correct
76 Correct 341 ms 137264 KB Output is correct
77 Correct 318 ms 136740 KB Output is correct
78 Correct 435 ms 186068 KB Output is correct
79 Correct 437 ms 185968 KB Output is correct
80 Correct 124 ms 38476 KB Output is correct
81 Correct 601 ms 244596 KB Output is correct
82 Correct 576 ms 244552 KB Output is correct
83 Correct 431 ms 170332 KB Output is correct
84 Correct 432 ms 167968 KB Output is correct
85 Correct 407 ms 160580 KB Output is correct
86 Correct 379 ms 155204 KB Output is correct
87 Correct 270 ms 108332 KB Output is correct
88 Correct 416 ms 167824 KB Output is correct
89 Correct 442 ms 172056 KB Output is correct
90 Correct 393 ms 152524 KB Output is correct
91 Correct 427 ms 150656 KB Output is correct
92 Correct 461 ms 151580 KB Output is correct