oj.uz

Submission #105276

# Submission time Handle Problem Language Result Execution time Memory
105276 2019-04-11T05:43:53 Z bert30702 Ancient Books (IOI17_books) C++17
50 / 100
 335 ms 126784 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
#include "books.h"
using namespace std;
const int MX = 1e6 + 100;
pii v[MX];
int mn[MX], mx[MX], tmpn[MX], tmpx[MX];
unordered_map<int, int> dp[MX];
int dfs(int l, int r, int a, int b) {
	if(l == a and r == b) return 0;
	if(dp[l].find(r) != dp[l].end()) return dp[l][r];
	if(l == a) return 2 + dfs(l, v[r + 1].S, a, b);
	if(r == b) return 2 + dfs(v[l - 1].F, r, a, b);
	int l1 = min(v[l - 1].F, l);
	int r1 = max(v[l - 1].S, r);
	int l2 = min(v[r + 1].F, l);
	int r2 = max(v[r + 1].S, r);
	if(r1 > r) return dp[l][r] = 2 + dfs(l1, r1, a, b);
	else       return dp[l][r] = 2 + dfs(l2, r2, a, b);
	return dp[l][r] = 2 + min(dfs(l1, r1, a, b), dfs(l2, r2, a, b));
}
long long minimum_walk(vector<int> p, int s) {
	int x = 0, y = p.size() - 1;
	while(x < s and p[x] == x) x ++;
	while(y > s and p[y] == y) y --;
	for(int i = x; i <= y; i ++) mn[i] = mx[i] = i;
	for(int i = x; i <= y; i ++) {
		mn[i] = min(mn[i], p[i]);
		mx[i] = max(mx[i], p[i]);
		mn[p[i]] = min(mn[p[i]], i);
		mx[p[i]] = max(mx[p[i]], i);
	}
	long long sum = 0;
	for(int i = x; i <= y; i ++) sum += abs(p[i] - i);
	auto update = [&] (int p, int a) {
		mn[p] = min(mn[p], mn[a]);
		mx[p] = max(mx[p], mx[a]);	
	};
	int cnta = -2, cntb = -2;
	int mxx = s, mnn = s;
	{
		memcpy(tmpn, mn, sizeof(mn));
		memcpy(tmpx, mx, sizeof(mx));
		queue<int> a, b;
		for(int i = s - 1; i >= x; i --) a.push(i);
		for(int i = s + 1; i <= y; i ++) b.push(i);
		for(int i = s; i <= y; i ++) {
			cnta += 2;
			while(1) {
					 if(a.size() and a.front() >= mn[i]) update(i, a.front()), a.pop();
				else if(b.size() and b.front() <= mx[i]) update(i, b.front()), b.pop();
				else break;
			}
			mnn = min(mnn, mn[i]);
			v[i] = {mn[i], mx[i]};
			i = mx[i]; 
		}
		memcpy(mn, tmpn, sizeof(mn));
		memcpy(mx, tmpx, sizeof(mx));
	}
	{
		memcpy(tmpn, mn, sizeof(mn));
		memcpy(tmpx, mx, sizeof(mx));
		queue<int> a, b;
		for(int i = s - 1; i >= x; i --) a.push(i);
		for(int i = s + 1; i <= y; i ++) b.push(i);
		for(int i = s; i >= x; i --) {
			cntb += 2;
			while(1) {
					 if(a.size() and a.front() >= mn[i]) update(i, a.front()), a.pop();
				else if(b.size() and b.front() <= mx[i]) update(i, b.front()), b.pop();
				else break;
			}
			mxx = max(mxx, mx[i]);
			v[i] = {mn[i], mx[i]};
			i = mn[i];
		}
		memcpy(mn, tmpn, sizeof(mn));
		memcpy(mx, tmpx, sizeof(mx));
	}
	return sum + min(cntb + dfs(x, mxx, x, y), cnta + dfs(mnn, y, x, y));
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 70776 KB Output is correct
2 Correct 72 ms 70776 KB Output is correct
3 Correct 74 ms 70776 KB Output is correct
4 Correct 76 ms 70776 KB Output is correct
5 Correct 73 ms 70776 KB Output is correct
6 Correct 73 ms 70776 KB Output is correct
7 Correct 71 ms 70904 KB Output is correct
8 Correct 79 ms 70776 KB Output is correct
9 Correct 79 ms 70776 KB Output is correct
10 Correct 79 ms 70776 KB Output is correct
11 Correct 85 ms 70776 KB Output is correct
12 Correct 76 ms 70780 KB Output is correct
13 Correct 82 ms 70768 KB Output is correct
14 Correct 81 ms 71032 KB Output is correct
15 Correct 76 ms 70776 KB Output is correct
16 Correct 78 ms 70904 KB Output is correct
17 Correct 81 ms 70776 KB Output is correct
18 Correct 74 ms 70696 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 70776 KB Output is correct
2 Correct 72 ms 70776 KB Output is correct
3 Correct 74 ms 70776 KB Output is correct
4 Correct 76 ms 70776 KB Output is correct
5 Correct 73 ms 70776 KB Output is correct
6 Correct 73 ms 70776 KB Output is correct
7 Correct 71 ms 70904 KB Output is correct
8 Correct 79 ms 70776 KB Output is correct
9 Correct 79 ms 70776 KB Output is correct
10 Correct 79 ms 70776 KB Output is correct
11 Correct 85 ms 70776 KB Output is correct
12 Correct 76 ms 70780 KB Output is correct
13 Correct 82 ms 70768 KB Output is correct
14 Correct 81 ms 71032 KB Output is correct
15 Correct 76 ms 70776 KB Output is correct
16 Correct 78 ms 70904 KB Output is correct
17 Correct 81 ms 70776 KB Output is correct
18 Correct 74 ms 70696 KB Output is correct
19 Correct 72 ms 70808 KB Output is correct
20 Correct 76 ms 70828 KB Output is correct
21 Correct 78 ms 70776 KB Output is correct
22 Correct 81 ms 70904 KB Output is correct
23 Correct 78 ms 70760 KB Output is correct
24 Correct 74 ms 70772 KB Output is correct
25 Correct 72 ms 70892 KB Output is correct
26 Correct 71 ms 70776 KB Output is correct
27 Correct 81 ms 70776 KB Output is correct
28 Correct 86 ms 70904 KB Output is correct
29 Correct 76 ms 70776 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 70776 KB Output is correct
2 Correct 72 ms 70776 KB Output is correct
3 Correct 74 ms 70776 KB Output is correct
4 Correct 76 ms 70776 KB Output is correct
5 Correct 73 ms 70776 KB Output is correct
6 Correct 73 ms 70776 KB Output is correct
7 Correct 71 ms 70904 KB Output is correct
8 Correct 79 ms 70776 KB Output is correct
9 Correct 79 ms 70776 KB Output is correct
10 Correct 79 ms 70776 KB Output is correct
11 Correct 85 ms 70776 KB Output is correct
12 Correct 76 ms 70780 KB Output is correct
13 Correct 82 ms 70768 KB Output is correct
14 Correct 81 ms 71032 KB Output is correct
15 Correct 76 ms 70776 KB Output is correct
16 Correct 78 ms 70904 KB Output is correct
17 Correct 81 ms 70776 KB Output is correct
18 Correct 74 ms 70696 KB Output is correct
19 Correct 72 ms 70808 KB Output is correct
20 Correct 76 ms 70828 KB Output is correct
21 Correct 78 ms 70776 KB Output is correct
22 Correct 81 ms 70904 KB Output is correct
23 Correct 78 ms 70760 KB Output is correct
24 Correct 74 ms 70772 KB Output is correct
25 Correct 72 ms 70892 KB Output is correct
26 Correct 71 ms 70776 KB Output is correct
27 Correct 81 ms 70776 KB Output is correct
28 Correct 86 ms 70904 KB Output is correct
29 Correct 76 ms 70776 KB Output is correct
30 Correct 335 ms 82780 KB Output is correct
31 Correct 277 ms 82776 KB Output is correct
32 Correct 209 ms 78580 KB Output is correct
33 Correct 297 ms 126688 KB Output is correct
34 Correct 311 ms 126784 KB Output is correct
35 Correct 267 ms 115160 KB Output is correct
36 Correct 254 ms 95040 KB Output is correct
37 Correct 241 ms 90196 KB Output is correct
38 Correct 294 ms 85852 KB Output is correct
39 Correct 308 ms 85420 KB Output is correct
40 Correct 241 ms 83064 KB Output is correct
41 Correct 273 ms 82768 KB Output is correct
42 Correct 264 ms 82812 KB Output is correct
43 Correct 220 ms 82684 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 70816 KB Output is correct
2 Correct 71 ms 70780 KB Output is correct
3 Correct 71 ms 70776 KB Output is correct
4 Correct 78 ms 70780 KB Output is correct
5 Correct 82 ms 70892 KB Output is correct
6 Correct 82 ms 70812 KB Output is correct
7 Correct 72 ms 70776 KB Output is correct
8 Incorrect 78 ms 70776 KB 3rd lines differ - on the 1st token, expected: '10478', found: '10494'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 70776 KB Output is correct
2 Correct 72 ms 70776 KB Output is correct
3 Correct 74 ms 70776 KB Output is correct
4 Correct 76 ms 70776 KB Output is correct
5 Correct 73 ms 70776 KB Output is correct
6 Correct 73 ms 70776 KB Output is correct
7 Correct 71 ms 70904 KB Output is correct
8 Correct 79 ms 70776 KB Output is correct
9 Correct 79 ms 70776 KB Output is correct
10 Correct 79 ms 70776 KB Output is correct
11 Correct 85 ms 70776 KB Output is correct
12 Correct 76 ms 70780 KB Output is correct
13 Correct 82 ms 70768 KB Output is correct
14 Correct 81 ms 71032 KB Output is correct
15 Correct 76 ms 70776 KB Output is correct
16 Correct 78 ms 70904 KB Output is correct
17 Correct 81 ms 70776 KB Output is correct
18 Correct 74 ms 70696 KB Output is correct
19 Correct 72 ms 70808 KB Output is correct
20 Correct 76 ms 70828 KB Output is correct
21 Correct 78 ms 70776 KB Output is correct
22 Correct 81 ms 70904 KB Output is correct
23 Correct 78 ms 70760 KB Output is correct
24 Correct 74 ms 70772 KB Output is correct
25 Correct 72 ms 70892 KB Output is correct
26 Correct 71 ms 70776 KB Output is correct
27 Correct 81 ms 70776 KB Output is correct
28 Correct 86 ms 70904 KB Output is correct
29 Correct 76 ms 70776 KB Output is correct
30 Correct 335 ms 82780 KB Output is correct
31 Correct 277 ms 82776 KB Output is correct
32 Correct 209 ms 78580 KB Output is correct
33 Correct 297 ms 126688 KB Output is correct
34 Correct 311 ms 126784 KB Output is correct
35 Correct 267 ms 115160 KB Output is correct
36 Correct 254 ms 95040 KB Output is correct
37 Correct 241 ms 90196 KB Output is correct
38 Correct 294 ms 85852 KB Output is correct
39 Correct 308 ms 85420 KB Output is correct
40 Correct 241 ms 83064 KB Output is correct
41 Correct 273 ms 82768 KB Output is correct
42 Correct 264 ms 82812 KB Output is correct
43 Correct 220 ms 82684 KB Output is correct
44 Correct 74 ms 70816 KB Output is correct
45 Correct 71 ms 70780 KB Output is correct
46 Correct 71 ms 70776 KB Output is correct
47 Correct 78 ms 70780 KB Output is correct
48 Correct 82 ms 70892 KB Output is correct
49 Correct 82 ms 70812 KB Output is correct
50 Correct 72 ms 70776 KB Output is correct
51 Incorrect 78 ms 70776 KB 3rd lines differ - on the 1st token, expected: '10478', found: '10494'
52 Halted 0 ms 0 KB -