답안 #105259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
105259	2019-04-11T04:56:29 Z	bert30702	고대 책들 (IOI17_books)	C++17	42 / 100	421 ms	82892 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);
	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);
	}
	int 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]);	
	};
	{
		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 ++) {
			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;
			}
			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 --) {
			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;
			}
			v[i] = {mn[i], mx[i]};
			i = mn[i];
		}
		memcpy(mn, tmpn, sizeof(mn));
		memcpy(mx, tmpx, sizeof(mx));
	}
	for(int i = x; i <= y; i ++) {
		// cout << i << ' ' << v[i].F << ' ' << v[i].S << endl;
	}
	// exit(0);
	return sum + dfs(v[s].F, v[s].S, x, y);
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	71004 KB	Output is correct
2	Correct	74 ms	70776 KB	Output is correct
3	Correct	70 ms	70776 KB	Output is correct
4	Correct	75 ms	70776 KB	Output is correct
5	Correct	79 ms	70776 KB	Output is correct
6	Correct	87 ms	70764 KB	Output is correct
7	Correct	83 ms	70776 KB	Output is correct
8	Correct	85 ms	70860 KB	Output is correct
9	Correct	75 ms	70760 KB	Output is correct
10	Correct	82 ms	70776 KB	Output is correct
11	Correct	82 ms	70908 KB	Output is correct
12	Correct	79 ms	70776 KB	Output is correct
13	Correct	74 ms	70780 KB	Output is correct
14	Correct	74 ms	70860 KB	Output is correct
15	Correct	75 ms	70776 KB	Output is correct
16	Correct	76 ms	70816 KB	Output is correct
17	Correct	85 ms	70776 KB	Output is correct
18	Correct	75 ms	70776 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	71004 KB	Output is correct
2	Correct	74 ms	70776 KB	Output is correct
3	Correct	70 ms	70776 KB	Output is correct
4	Correct	75 ms	70776 KB	Output is correct
5	Correct	79 ms	70776 KB	Output is correct
6	Correct	87 ms	70764 KB	Output is correct
7	Correct	83 ms	70776 KB	Output is correct
8	Correct	85 ms	70860 KB	Output is correct
9	Correct	75 ms	70760 KB	Output is correct
10	Correct	82 ms	70776 KB	Output is correct
11	Correct	82 ms	70908 KB	Output is correct
12	Correct	79 ms	70776 KB	Output is correct
13	Correct	74 ms	70780 KB	Output is correct
14	Correct	74 ms	70860 KB	Output is correct
15	Correct	75 ms	70776 KB	Output is correct
16	Correct	76 ms	70816 KB	Output is correct
17	Correct	85 ms	70776 KB	Output is correct
18	Correct	75 ms	70776 KB	Output is correct
19	Correct	78 ms	70844 KB	Output is correct
20	Correct	76 ms	70776 KB	Output is correct
21	Correct	77 ms	70904 KB	Output is correct
22	Correct	82 ms	70776 KB	Output is correct
23	Correct	76 ms	70904 KB	Output is correct
24	Correct	94 ms	70776 KB	Output is correct
25	Correct	77 ms	70776 KB	Output is correct
26	Correct	86 ms	70776 KB	Output is correct
27	Correct	77 ms	70776 KB	Output is correct
28	Correct	77 ms	70748 KB	Output is correct
29	Correct	91 ms	70748 KB	Output is correct

Subtask #3

0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	71004 KB	Output is correct
2	Correct	74 ms	70776 KB	Output is correct
3	Correct	70 ms	70776 KB	Output is correct
4	Correct	75 ms	70776 KB	Output is correct
5	Correct	79 ms	70776 KB	Output is correct
6	Correct	87 ms	70764 KB	Output is correct
7	Correct	83 ms	70776 KB	Output is correct
8	Correct	85 ms	70860 KB	Output is correct
9	Correct	75 ms	70760 KB	Output is correct
10	Correct	82 ms	70776 KB	Output is correct
11	Correct	82 ms	70908 KB	Output is correct
12	Correct	79 ms	70776 KB	Output is correct
13	Correct	74 ms	70780 KB	Output is correct
14	Correct	74 ms	70860 KB	Output is correct
15	Correct	75 ms	70776 KB	Output is correct
16	Correct	76 ms	70816 KB	Output is correct
17	Correct	85 ms	70776 KB	Output is correct
18	Correct	75 ms	70776 KB	Output is correct
19	Correct	78 ms	70844 KB	Output is correct
20	Correct	76 ms	70776 KB	Output is correct
21	Correct	77 ms	70904 KB	Output is correct
22	Correct	82 ms	70776 KB	Output is correct
23	Correct	76 ms	70904 KB	Output is correct
24	Correct	94 ms	70776 KB	Output is correct
25	Correct	77 ms	70776 KB	Output is correct
26	Correct	86 ms	70776 KB	Output is correct
27	Correct	77 ms	70776 KB	Output is correct
28	Correct	77 ms	70748 KB	Output is correct
29	Correct	91 ms	70748 KB	Output is correct
30	Incorrect	421 ms	82892 KB	3rd lines differ - on the 1st token, expected: '333035179244', found: '-1972269844'
31	Halted	0 ms	0 KB	-

Subtask #4

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	110 ms	75772 KB	Output is correct
2	Correct	74 ms	70912 KB	Output is correct
3	Correct	96 ms	72440 KB	Output is correct
4	Correct	108 ms	74872 KB	Output is correct
5	Correct	105 ms	75004 KB	Output is correct
6	Correct	78 ms	70776 KB	Output is correct
7	Correct	79 ms	70768 KB	Output is correct
8	Correct	80 ms	70776 KB	Output is correct
9	Correct	80 ms	70844 KB	Output is correct
10	Correct	78 ms	70732 KB	Output is correct
11	Correct	83 ms	71160 KB	Output is correct
12	Correct	86 ms	71160 KB	Output is correct
13	Correct	79 ms	70876 KB	Output is correct
14	Correct	78 ms	70776 KB	Output is correct
15	Correct	80 ms	70904 KB	Output is correct
16	Correct	75 ms	70776 KB	Output is correct
17	Correct	74 ms	70904 KB	Output is correct
18	Correct	77 ms	70904 KB	Output is correct
19	Correct	73 ms	70776 KB	Output is correct
20	Correct	75 ms	70776 KB	Output is correct

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	71004 KB	Output is correct
2	Correct	74 ms	70776 KB	Output is correct
3	Correct	70 ms	70776 KB	Output is correct
4	Correct	75 ms	70776 KB	Output is correct
5	Correct	79 ms	70776 KB	Output is correct
6	Correct	87 ms	70764 KB	Output is correct
7	Correct	83 ms	70776 KB	Output is correct
8	Correct	85 ms	70860 KB	Output is correct
9	Correct	75 ms	70760 KB	Output is correct
10	Correct	82 ms	70776 KB	Output is correct
11	Correct	82 ms	70908 KB	Output is correct
12	Correct	79 ms	70776 KB	Output is correct
13	Correct	74 ms	70780 KB	Output is correct
14	Correct	74 ms	70860 KB	Output is correct
15	Correct	75 ms	70776 KB	Output is correct
16	Correct	76 ms	70816 KB	Output is correct
17	Correct	85 ms	70776 KB	Output is correct
18	Correct	75 ms	70776 KB	Output is correct
19	Correct	78 ms	70844 KB	Output is correct
20	Correct	76 ms	70776 KB	Output is correct
21	Correct	77 ms	70904 KB	Output is correct
22	Correct	82 ms	70776 KB	Output is correct
23	Correct	76 ms	70904 KB	Output is correct
24	Correct	94 ms	70776 KB	Output is correct
25	Correct	77 ms	70776 KB	Output is correct
26	Correct	86 ms	70776 KB	Output is correct
27	Correct	77 ms	70776 KB	Output is correct
28	Correct	77 ms	70748 KB	Output is correct
29	Correct	91 ms	70748 KB	Output is correct
30	Incorrect	421 ms	82892 KB	3rd lines differ - on the 1st token, expected: '333035179244', found: '-1972269844'
31	Halted	0 ms	0 KB	-