oj.uz

Submission #249909

# Submission time Handle Problem Language Result Execution time Memory
249909 2020-07-16T12:18:42 Z kostia244 Ancient Books (IOI17_books) C++17
12 / 100
 22 ms 29184 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();
	while(pL != start || pR != end) {
		if(pL == start) {
			pR++;
			ans += 2;
			expand();
			break;
		}
		if(pR == end) {
			pL--;
			ans += 2;
			expand();
			break;
		}
		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 16 ms 29056 KB Output is correct
2 Correct 20 ms 29184 KB Output is correct
3 Correct 16 ms 29056 KB Output is correct
4 Correct 16 ms 29056 KB Output is correct
5 Correct 17 ms 29056 KB Output is correct
6 Correct 16 ms 29056 KB Output is correct
7 Correct 16 ms 29056 KB Output is correct
8 Correct 16 ms 29056 KB Output is correct
9 Correct 16 ms 29056 KB Output is correct
10 Correct 18 ms 29056 KB Output is correct
11 Correct 17 ms 29056 KB Output is correct
12 Correct 22 ms 29048 KB Output is correct
13 Correct 16 ms 29056 KB Output is correct
14 Correct 18 ms 29056 KB Output is correct
15 Correct 22 ms 29056 KB Output is correct
16 Correct 17 ms 29056 KB Output is correct
17 Correct 16 ms 29056 KB Output is correct
18 Correct 16 ms 29056 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 29056 KB Output is correct
2 Correct 20 ms 29184 KB Output is correct
3 Correct 16 ms 29056 KB Output is correct
4 Correct 16 ms 29056 KB Output is correct
5 Correct 17 ms 29056 KB Output is correct
6 Correct 16 ms 29056 KB Output is correct
7 Correct 16 ms 29056 KB Output is correct
8 Correct 16 ms 29056 KB Output is correct
9 Correct 16 ms 29056 KB Output is correct
10 Correct 18 ms 29056 KB Output is correct
11 Correct 17 ms 29056 KB Output is correct
12 Correct 22 ms 29048 KB Output is correct
13 Correct 16 ms 29056 KB Output is correct
14 Correct 18 ms 29056 KB Output is correct
15 Correct 22 ms 29056 KB Output is correct
16 Correct 17 ms 29056 KB Output is correct
17 Correct 16 ms 29056 KB Output is correct
18 Correct 16 ms 29056 KB Output is correct
19 Correct 16 ms 29056 KB Output is correct
20 Correct 16 ms 29056 KB Output is correct
21 Correct 17 ms 29056 KB Output is correct
22 Incorrect 17 ms 29056 KB 3rd lines differ - on the 1st token, expected: '2082', found: '790'
23 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 29056 KB Output is correct
2 Correct 20 ms 29184 KB Output is correct
3 Correct 16 ms 29056 KB Output is correct
4 Correct 16 ms 29056 KB Output is correct
5 Correct 17 ms 29056 KB Output is correct
6 Correct 16 ms 29056 KB Output is correct
7 Correct 16 ms 29056 KB Output is correct
8 Correct 16 ms 29056 KB Output is correct
9 Correct 16 ms 29056 KB Output is correct
10 Correct 18 ms 29056 KB Output is correct
11 Correct 17 ms 29056 KB Output is correct
12 Correct 22 ms 29048 KB Output is correct
13 Correct 16 ms 29056 KB Output is correct
14 Correct 18 ms 29056 KB Output is correct
15 Correct 22 ms 29056 KB Output is correct
16 Correct 17 ms 29056 KB Output is correct
17 Correct 16 ms 29056 KB Output is correct
18 Correct 16 ms 29056 KB Output is correct
19 Correct 16 ms 29056 KB Output is correct
20 Correct 16 ms 29056 KB Output is correct
21 Correct 17 ms 29056 KB Output is correct
22 Incorrect 17 ms 29056 KB 3rd lines differ - on the 1st token, expected: '2082', found: '790'
23 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 29056 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 29056 KB Output is correct
2 Correct 20 ms 29184 KB Output is correct
3 Correct 16 ms 29056 KB Output is correct
4 Correct 16 ms 29056 KB Output is correct
5 Correct 17 ms 29056 KB Output is correct
6 Correct 16 ms 29056 KB Output is correct
7 Correct 16 ms 29056 KB Output is correct
8 Correct 16 ms 29056 KB Output is correct
9 Correct 16 ms 29056 KB Output is correct
10 Correct 18 ms 29056 KB Output is correct
11 Correct 17 ms 29056 KB Output is correct
12 Correct 22 ms 29048 KB Output is correct
13 Correct 16 ms 29056 KB Output is correct
14 Correct 18 ms 29056 KB Output is correct
15 Correct 22 ms 29056 KB Output is correct
16 Correct 17 ms 29056 KB Output is correct
17 Correct 16 ms 29056 KB Output is correct
18 Correct 16 ms 29056 KB Output is correct
19 Correct 16 ms 29056 KB Output is correct
20 Correct 16 ms 29056 KB Output is correct
21 Correct 17 ms 29056 KB Output is correct
22 Incorrect 17 ms 29056 KB 3rd lines differ - on the 1st token, expected: '2082', found: '790'
23 Halted 0 ms 0 KB -