oj.uz

Submission #249912

# Submission time Handle Problem Language Result Execution time Memory
249912 2020-07-16T12:21:27 Z kostia244 Ancient Books (IOI17_books) C++17
50 / 100
 312 ms 76024 KB 
#include "books.h"
#include<bits/extc++.h>
using namespace std;
const int maxn = 1<<20;
using ll = long long;
#define end orz
int vis[maxn], a[maxn], col[maxn], n, id = 0;
vector<int> cycle[maxn];
ll ans = 0;
vector<array<int, 2>> segs;
void touch(int p) {
	if(vis[p]) return;
	++id;
	int l = p, r = p, lst = p;
	while(!vis[p]) {
		vis[p] = 1;
		l = min(l, p);
		r = max(r, p);
		
		col[p] = id;
		
		lst = p;
		p = a[p];
		ans += abs(p-lst);
	}
}
int L, R, pL, pR;
void upd(int i) {
	pL = min(pL, cycle[col[i]][0]);
	pR = max(pR, cycle[col[i]].back());
}
void expand() {
	while(pL < L || pR > R) {
		while(L > pL) upd(--L);
		while(R < pR) upd(++R);
	}
}
int start = -1, end = -1;
template<int fl>
pair<int, int> find() {
	int bl = L, br = R, cost = 0;
	//cout << fl << "::\n";
	//cout << cost << " " << L << " " << R << " TO " << endl;
	while((!fl ? L == bl : R == br) && (fl ? L>start : R!=end)) {
		fl ? --pL : ++pR;
		++cost;
		expand();
	}
	//cout << cost << " " << L << " " << R << endl;
	int nl = L, nr = R;
	pL = L = bl, R = pR = br;
	if(!fl ? L == nl : R == nr) return {1<<30, -1};
	return {cost, fl ? nl : nr};
}
ll minimum_walk(vector<int> _a, int s) {
	n = _a.size();
	for(int i = 0; i < n; i++) a[i] = _a[i];
	for(int i = 0; i < n; i++) {
		if(a[i] != i || i == s) {
			if(start == -1) start = i;
			end = i;
		}
		touch(i);
	}
	for(int i = 0; i < n; i++) cycle[col[i]].push_back(i);
	memset(vis, 0, sizeof vis);
	pL = pR = R = s, L = s+1;
	expand();
	//cout << start << " " << end << " " << L << " " << R << '\n';
	while(pL != start || pR != end) {
		if(pL == start) {
			pR++;
			ans += 2;
			expand();
			continue;
		}
		if(pR == end) {
			pL--;
			ans += 2;
			expand();
			continue;
		}
		auto [lcst, lp] = find<1>();
		auto [rcst, rp] = find<0>();
		//cout << lp << " " << rp << endl;
		if(lp == -1 && rp == -1) break;
		if(lcst < rcst) pL = lp;
		else pR = rp;
		ans += 2*min(lcst, rcst);
		expand();
	}
	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29056 KB Output is correct
2 Correct 15 ms 29056 KB Output is correct
3 Correct 15 ms 29056 KB Output is correct
4 Correct 16 ms 29056 KB Output is correct
5 Correct 15 ms 29056 KB Output is correct
6 Correct 15 ms 29056 KB Output is correct
7 Correct 15 ms 29056 KB Output is correct
8 Correct 15 ms 29056 KB Output is correct
9 Correct 15 ms 29056 KB Output is correct
10 Correct 15 ms 29056 KB Output is correct
11 Correct 15 ms 29056 KB Output is correct
12 Correct 16 ms 29056 KB Output is correct
13 Correct 16 ms 29056 KB Output is correct
14 Correct 15 ms 29056 KB Output is correct
15 Correct 15 ms 29056 KB Output is correct
16 Correct 15 ms 29056 KB Output is correct
17 Correct 15 ms 29056 KB Output is correct
18 Correct 15 ms 29056 KB Output is correct
19 Correct 15 ms 29056 KB Output is correct
20 Correct 16 ms 29056 KB Output is correct
21 Correct 15 ms 29080 KB Output is correct
22 Correct 15 ms 29056 KB Output is correct
23 Correct 16 ms 29036 KB Output is correct
24 Correct 16 ms 29056 KB Output is correct
25 Correct 15 ms 29056 KB Output is correct
26 Correct 15 ms 29056 KB Output is correct
27 Correct 22 ms 29048 KB Output is correct
28 Correct 15 ms 29056 KB Output is correct
29 Correct 15 ms 29056 KB Output is correct
30 Correct 312 ms 50280 KB Output is correct
31 Correct 277 ms 48980 KB Output is correct
32 Correct 231 ms 76024 KB Output is correct
33 Correct 224 ms 66680 KB Output is correct
34 Correct 223 ms 66552 KB Output is correct
35 Correct 230 ms 62456 KB Output is correct
36 Correct 220 ms 55288 KB Output is correct
37 Correct 201 ms 50936 KB Output is correct
38 Correct 196 ms 50424 KB Output is correct
39 Correct 198 ms 50416 KB Output is correct
40 Correct 201 ms 49396 KB Output is correct
41 Correct 220 ms 49256 KB Output is correct
42 Correct 214 ms 49528 KB Output is correct
43 Correct 236 ms 67960 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29056 KB Output is correct
2 Correct 15 ms 29056 KB Output is correct
3 Correct 16 ms 29056 KB Output is correct
4 Incorrect 16 ms 29056 KB 3rd lines differ - on the 1st token, expected: '2094', found: '818'
5 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29056 KB Output is correct
2 Correct 15 ms 29056 KB Output is correct
3 Correct 15 ms 29056 KB Output is correct
4 Correct 16 ms 29056 KB Output is correct
5 Correct 15 ms 29056 KB Output is correct
6 Correct 15 ms 29056 KB Output is correct
7 Correct 15 ms 29056 KB Output is correct
8 Correct 15 ms 29056 KB Output is correct
9 Correct 15 ms 29056 KB Output is correct
10 Correct 15 ms 29056 KB Output is correct
11 Correct 15 ms 29056 KB Output is correct
12 Correct 16 ms 29056 KB Output is correct
13 Correct 16 ms 29056 KB Output is correct
14 Correct 15 ms 29056 KB Output is correct
15 Correct 15 ms 29056 KB Output is correct
16 Correct 15 ms 29056 KB Output is correct
17 Correct 15 ms 29056 KB Output is correct
18 Correct 15 ms 29056 KB Output is correct
19 Correct 15 ms 29056 KB Output is correct
20 Correct 16 ms 29056 KB Output is correct
21 Correct 15 ms 29080 KB Output is correct
22 Correct 15 ms 29056 KB Output is correct
23 Correct 16 ms 29036 KB Output is correct
24 Correct 16 ms 29056 KB Output is correct
25 Correct 15 ms 29056 KB Output is correct
26 Correct 15 ms 29056 KB Output is correct
27 Correct 22 ms 29048 KB Output is correct
28 Correct 15 ms 29056 KB Output is correct
29 Correct 15 ms 29056 KB Output is correct
30 Correct 312 ms 50280 KB Output is correct
31 Correct 277 ms 48980 KB Output is correct
32 Correct 231 ms 76024 KB Output is correct
33 Correct 224 ms 66680 KB Output is correct
34 Correct 223 ms 66552 KB Output is correct
35 Correct 230 ms 62456 KB Output is correct
36 Correct 220 ms 55288 KB Output is correct
37 Correct 201 ms 50936 KB Output is correct
38 Correct 196 ms 50424 KB Output is correct
39 Correct 198 ms 50416 KB Output is correct
40 Correct 201 ms 49396 KB Output is correct
41 Correct 220 ms 49256 KB Output is correct
42 Correct 214 ms 49528 KB Output is correct
43 Correct 236 ms 67960 KB Output is correct
44 Correct 15 ms 29056 KB Output is correct
45 Correct 15 ms 29056 KB Output is correct
46 Correct 16 ms 29056 KB Output is correct
47 Incorrect 16 ms 29056 KB 3rd lines differ - on the 1st token, expected: '2094', found: '818'
48 Halted 0 ms 0 KB -