Submission #105275

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
105275	2019-04-11T05:42:33 Z	bert30702	Ancient Books (IOI17_books)	C++17	50 / 100	359 ms	126680 KB

books

#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) {
	//cout << l << ' ' << r << ' ' << a << ' ' << b << endl;
	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));
	}
	for(int i = s; i >= x; i --) mxx = max(mxx, v[i].S);
	for(int i = s; i <= y; i ++) mnn = min(mnn, v[i].F);
	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	84 ms	70776 KB	Output is correct
2	Correct	75 ms	70924 KB	Output is correct
3	Correct	75 ms	70776 KB	Output is correct
4	Correct	76 ms	70776 KB	Output is correct
5	Correct	86 ms	70776 KB	Output is correct
6	Correct	74 ms	70748 KB	Output is correct
7	Correct	75 ms	70808 KB	Output is correct
8	Correct	77 ms	70904 KB	Output is correct
9	Correct	72 ms	70776 KB	Output is correct
10	Correct	75 ms	70704 KB	Output is correct
11	Correct	72 ms	70776 KB	Output is correct
12	Correct	89 ms	70776 KB	Output is correct
13	Correct	79 ms	70748 KB	Output is correct
14	Correct	77 ms	70908 KB	Output is correct
15	Correct	75 ms	70776 KB	Output is correct
16	Correct	79 ms	70908 KB	Output is correct
17	Correct	76 ms	70776 KB	Output is correct
18	Correct	81 ms	70820 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	84 ms	70776 KB	Output is correct
2	Correct	75 ms	70924 KB	Output is correct
3	Correct	75 ms	70776 KB	Output is correct
4	Correct	76 ms	70776 KB	Output is correct
5	Correct	86 ms	70776 KB	Output is correct
6	Correct	74 ms	70748 KB	Output is correct
7	Correct	75 ms	70808 KB	Output is correct
8	Correct	77 ms	70904 KB	Output is correct
9	Correct	72 ms	70776 KB	Output is correct
10	Correct	75 ms	70704 KB	Output is correct
11	Correct	72 ms	70776 KB	Output is correct
12	Correct	89 ms	70776 KB	Output is correct
13	Correct	79 ms	70748 KB	Output is correct
14	Correct	77 ms	70908 KB	Output is correct
15	Correct	75 ms	70776 KB	Output is correct
16	Correct	79 ms	70908 KB	Output is correct
17	Correct	76 ms	70776 KB	Output is correct
18	Correct	81 ms	70820 KB	Output is correct
19	Correct	82 ms	70864 KB	Output is correct
20	Correct	80 ms	70904 KB	Output is correct
21	Correct	84 ms	70776 KB	Output is correct
22	Correct	77 ms	70876 KB	Output is correct
23	Correct	78 ms	70776 KB	Output is correct
24	Correct	77 ms	70776 KB	Output is correct
25	Correct	79 ms	70860 KB	Output is correct
26	Correct	72 ms	70908 KB	Output is correct
27	Correct	71 ms	70776 KB	Output is correct
28	Correct	77 ms	70776 KB	Output is correct
29	Correct	77 ms	70776 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	84 ms	70776 KB	Output is correct
2	Correct	75 ms	70924 KB	Output is correct
3	Correct	75 ms	70776 KB	Output is correct
4	Correct	76 ms	70776 KB	Output is correct
5	Correct	86 ms	70776 KB	Output is correct
6	Correct	74 ms	70748 KB	Output is correct
7	Correct	75 ms	70808 KB	Output is correct
8	Correct	77 ms	70904 KB	Output is correct
9	Correct	72 ms	70776 KB	Output is correct
10	Correct	75 ms	70704 KB	Output is correct
11	Correct	72 ms	70776 KB	Output is correct
12	Correct	89 ms	70776 KB	Output is correct
13	Correct	79 ms	70748 KB	Output is correct
14	Correct	77 ms	70908 KB	Output is correct
15	Correct	75 ms	70776 KB	Output is correct
16	Correct	79 ms	70908 KB	Output is correct
17	Correct	76 ms	70776 KB	Output is correct
18	Correct	81 ms	70820 KB	Output is correct
19	Correct	82 ms	70864 KB	Output is correct
20	Correct	80 ms	70904 KB	Output is correct
21	Correct	84 ms	70776 KB	Output is correct
22	Correct	77 ms	70876 KB	Output is correct
23	Correct	78 ms	70776 KB	Output is correct
24	Correct	77 ms	70776 KB	Output is correct
25	Correct	79 ms	70860 KB	Output is correct
26	Correct	72 ms	70908 KB	Output is correct
27	Correct	71 ms	70776 KB	Output is correct
28	Correct	77 ms	70776 KB	Output is correct
29	Correct	77 ms	70776 KB	Output is correct
30	Correct	274 ms	82776 KB	Output is correct
31	Correct	281 ms	82772 KB	Output is correct
32	Correct	194 ms	78588 KB	Output is correct
33	Correct	260 ms	126620 KB	Output is correct
34	Correct	301 ms	126680 KB	Output is correct
35	Correct	359 ms	115048 KB	Output is correct
36	Correct	287 ms	94900 KB	Output is correct
37	Correct	250 ms	90232 KB	Output is correct
38	Correct	257 ms	85884 KB	Output is correct
39	Correct	269 ms	85368 KB	Output is correct
40	Correct	242 ms	83064 KB	Output is correct
41	Correct	267 ms	82808 KB	Output is correct
42	Correct	293 ms	82808 KB	Output is correct
43	Correct	257 ms	82704 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	71 ms	70908 KB	Output is correct
2	Correct	77 ms	70776 KB	Output is correct
3	Correct	81 ms	70776 KB	Output is correct
4	Incorrect	76 ms	70748 KB	3rd lines differ - on the 1st token, expected: '2094', found: '1320'
5	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	84 ms	70776 KB	Output is correct
2	Correct	75 ms	70924 KB	Output is correct
3	Correct	75 ms	70776 KB	Output is correct
4	Correct	76 ms	70776 KB	Output is correct
5	Correct	86 ms	70776 KB	Output is correct
6	Correct	74 ms	70748 KB	Output is correct
7	Correct	75 ms	70808 KB	Output is correct
8	Correct	77 ms	70904 KB	Output is correct
9	Correct	72 ms	70776 KB	Output is correct
10	Correct	75 ms	70704 KB	Output is correct
11	Correct	72 ms	70776 KB	Output is correct
12	Correct	89 ms	70776 KB	Output is correct
13	Correct	79 ms	70748 KB	Output is correct
14	Correct	77 ms	70908 KB	Output is correct
15	Correct	75 ms	70776 KB	Output is correct
16	Correct	79 ms	70908 KB	Output is correct
17	Correct	76 ms	70776 KB	Output is correct
18	Correct	81 ms	70820 KB	Output is correct
19	Correct	82 ms	70864 KB	Output is correct
20	Correct	80 ms	70904 KB	Output is correct
21	Correct	84 ms	70776 KB	Output is correct
22	Correct	77 ms	70876 KB	Output is correct
23	Correct	78 ms	70776 KB	Output is correct
24	Correct	77 ms	70776 KB	Output is correct
25	Correct	79 ms	70860 KB	Output is correct
26	Correct	72 ms	70908 KB	Output is correct
27	Correct	71 ms	70776 KB	Output is correct
28	Correct	77 ms	70776 KB	Output is correct
29	Correct	77 ms	70776 KB	Output is correct
30	Correct	274 ms	82776 KB	Output is correct
31	Correct	281 ms	82772 KB	Output is correct
32	Correct	194 ms	78588 KB	Output is correct
33	Correct	260 ms	126620 KB	Output is correct
34	Correct	301 ms	126680 KB	Output is correct
35	Correct	359 ms	115048 KB	Output is correct
36	Correct	287 ms	94900 KB	Output is correct
37	Correct	250 ms	90232 KB	Output is correct
38	Correct	257 ms	85884 KB	Output is correct
39	Correct	269 ms	85368 KB	Output is correct
40	Correct	242 ms	83064 KB	Output is correct
41	Correct	267 ms	82808 KB	Output is correct
42	Correct	293 ms	82808 KB	Output is correct
43	Correct	257 ms	82704 KB	Output is correct
44	Correct	71 ms	70908 KB	Output is correct
45	Correct	77 ms	70776 KB	Output is correct
46	Correct	81 ms	70776 KB	Output is correct
47	Incorrect	76 ms	70748 KB	3rd lines differ - on the 1st token, expected: '2094', found: '1320'
48	Halted	0 ms	0 KB	-

Submission #105275

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0