답안 #811284

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
811284	2023-08-07T03:47:52 Z	LittleCube	고대 책들 (IOI17_books)	C++17	50 / 100	98 ms	40456 KB

books

#pragma GCC optimize("Ofast,unroll-loops")
#include "books.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int n, reach[1000006], g[1000006], l, r;
vector<int> out[1000006];
long long minimum_walk(vector<int> p, int s)
{
	{
		n = p.size();
		int l = 0, r = n - 1;
		while (l < s && p[l] == l)
			l++;
		while (r > s && p[r] == r)
			r--;
		p = vector<int>(p.begin() + l, p.begin() + r + 1);
		n = p.size();
		s -= l;
		for (auto &i : p)
			i -= l;
	}

	ll ans = 0;

	vector<pii> edge;
	for (int i = 0; i < n; i++)
		reach[i] = i;
	for (int i = 0; i < n; i++)
	{
		ans += abs(p[i] - i);
		int u = min(p[i], i), v = max(p[i], i);
		if (v <= s || s <= u)
			reach[u] = max(reach[u], v);
		else
			edge.emplace_back(pii(u, v));
	}
	for (int i = 1; i < n; i++)
		reach[i] = max(reach[i - 1], reach[i]);
	int last = 0, m = 0;
	for (int i = 0; i < n; i++)
	{
		if (last < i)
			++m;
		g[i] = m;
		last = max(last, reach[i]);
	}
	int L = g[s], R = g[s];
	for (auto &[u, v] : edge)
	{
		u = g[u], v = g[v];
		L = min(L, u);
		R = max(R, v);
		out[u].emplace_back(v);
		out[v].emplace_back(u);
	}
	ans += 2 * (L + m - R);
	int l = g[s], r = g[s];
	while (L < l || r < R)
	{
		ans += 2;
		int nl = max(L, l - 1), nr = min(R, r + 1);
		while (nl < l || r < nr)
		{
			if (nl < l)
			{
				l--;
				for (auto i : out[l])
					nl = min(i, nl), nr = max(i, nr);
			}
			else
			{
				r++;
				for (auto i : out[r])
					nl = min(i, nl), nr = max(i, nr);
			}
		}
	}

	return ans;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	23756 KB	Output is correct
2	Correct	14 ms	23764 KB	Output is correct
3	Correct	14 ms	23764 KB	Output is correct
4	Correct	14 ms	23764 KB	Output is correct
5	Correct	13 ms	23740 KB	Output is correct
6	Correct	14 ms	23764 KB	Output is correct
7	Correct	14 ms	23736 KB	Output is correct
8	Correct	14 ms	23792 KB	Output is correct
9	Correct	14 ms	23764 KB	Output is correct
10	Correct	14 ms	23764 KB	Output is correct
11	Correct	14 ms	23792 KB	Output is correct
12	Correct	14 ms	23808 KB	Output is correct
13	Correct	14 ms	23732 KB	Output is correct
14	Correct	14 ms	23792 KB	Output is correct
15	Correct	14 ms	23764 KB	Output is correct
16	Correct	14 ms	23796 KB	Output is correct
17	Correct	13 ms	23796 KB	Output is correct
18	Correct	13 ms	23764 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	23756 KB	Output is correct
2	Correct	14 ms	23764 KB	Output is correct
3	Correct	14 ms	23764 KB	Output is correct
4	Correct	14 ms	23764 KB	Output is correct
5	Correct	13 ms	23740 KB	Output is correct
6	Correct	14 ms	23764 KB	Output is correct
7	Correct	14 ms	23736 KB	Output is correct
8	Correct	14 ms	23792 KB	Output is correct
9	Correct	14 ms	23764 KB	Output is correct
10	Correct	14 ms	23764 KB	Output is correct
11	Correct	14 ms	23792 KB	Output is correct
12	Correct	14 ms	23808 KB	Output is correct
13	Correct	14 ms	23732 KB	Output is correct
14	Correct	14 ms	23792 KB	Output is correct
15	Correct	14 ms	23764 KB	Output is correct
16	Correct	14 ms	23796 KB	Output is correct
17	Correct	13 ms	23796 KB	Output is correct
18	Correct	13 ms	23764 KB	Output is correct
19	Correct	13 ms	23764 KB	Output is correct
20	Correct	14 ms	23744 KB	Output is correct
21	Correct	14 ms	23792 KB	Output is correct
22	Correct	13 ms	23764 KB	Output is correct
23	Correct	14 ms	23800 KB	Output is correct
24	Correct	14 ms	23788 KB	Output is correct
25	Correct	14 ms	23764 KB	Output is correct
26	Correct	14 ms	23828 KB	Output is correct
27	Correct	14 ms	23764 KB	Output is correct
28	Correct	13 ms	23764 KB	Output is correct
29	Correct	16 ms	23752 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	23756 KB	Output is correct
2	Correct	14 ms	23764 KB	Output is correct
3	Correct	14 ms	23764 KB	Output is correct
4	Correct	14 ms	23764 KB	Output is correct
5	Correct	13 ms	23740 KB	Output is correct
6	Correct	14 ms	23764 KB	Output is correct
7	Correct	14 ms	23736 KB	Output is correct
8	Correct	14 ms	23792 KB	Output is correct
9	Correct	14 ms	23764 KB	Output is correct
10	Correct	14 ms	23764 KB	Output is correct
11	Correct	14 ms	23792 KB	Output is correct
12	Correct	14 ms	23808 KB	Output is correct
13	Correct	14 ms	23732 KB	Output is correct
14	Correct	14 ms	23792 KB	Output is correct
15	Correct	14 ms	23764 KB	Output is correct
16	Correct	14 ms	23796 KB	Output is correct
17	Correct	13 ms	23796 KB	Output is correct
18	Correct	13 ms	23764 KB	Output is correct
19	Correct	13 ms	23764 KB	Output is correct
20	Correct	14 ms	23744 KB	Output is correct
21	Correct	14 ms	23792 KB	Output is correct
22	Correct	13 ms	23764 KB	Output is correct
23	Correct	14 ms	23800 KB	Output is correct
24	Correct	14 ms	23788 KB	Output is correct
25	Correct	14 ms	23764 KB	Output is correct
26	Correct	14 ms	23828 KB	Output is correct
27	Correct	14 ms	23764 KB	Output is correct
28	Correct	13 ms	23764 KB	Output is correct
29	Correct	16 ms	23752 KB	Output is correct
30	Correct	94 ms	40356 KB	Output is correct
31	Correct	94 ms	40452 KB	Output is correct
32	Correct	84 ms	32524 KB	Output is correct
33	Correct	94 ms	40380 KB	Output is correct
34	Correct	96 ms	40404 KB	Output is correct
35	Correct	93 ms	40360 KB	Output is correct
36	Correct	94 ms	40420 KB	Output is correct
37	Correct	92 ms	40376 KB	Output is correct
38	Correct	92 ms	40344 KB	Output is correct
39	Correct	93 ms	40400 KB	Output is correct
40	Correct	93 ms	40428 KB	Output is correct
41	Correct	93 ms	40428 KB	Output is correct
42	Correct	94 ms	40432 KB	Output is correct
43	Correct	98 ms	40456 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	14 ms	23728 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3308'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	23756 KB	Output is correct
2	Correct	14 ms	23764 KB	Output is correct
3	Correct	14 ms	23764 KB	Output is correct
4	Correct	14 ms	23764 KB	Output is correct
5	Correct	13 ms	23740 KB	Output is correct
6	Correct	14 ms	23764 KB	Output is correct
7	Correct	14 ms	23736 KB	Output is correct
8	Correct	14 ms	23792 KB	Output is correct
9	Correct	14 ms	23764 KB	Output is correct
10	Correct	14 ms	23764 KB	Output is correct
11	Correct	14 ms	23792 KB	Output is correct
12	Correct	14 ms	23808 KB	Output is correct
13	Correct	14 ms	23732 KB	Output is correct
14	Correct	14 ms	23792 KB	Output is correct
15	Correct	14 ms	23764 KB	Output is correct
16	Correct	14 ms	23796 KB	Output is correct
17	Correct	13 ms	23796 KB	Output is correct
18	Correct	13 ms	23764 KB	Output is correct
19	Correct	13 ms	23764 KB	Output is correct
20	Correct	14 ms	23744 KB	Output is correct
21	Correct	14 ms	23792 KB	Output is correct
22	Correct	13 ms	23764 KB	Output is correct
23	Correct	14 ms	23800 KB	Output is correct
24	Correct	14 ms	23788 KB	Output is correct
25	Correct	14 ms	23764 KB	Output is correct
26	Correct	14 ms	23828 KB	Output is correct
27	Correct	14 ms	23764 KB	Output is correct
28	Correct	13 ms	23764 KB	Output is correct
29	Correct	16 ms	23752 KB	Output is correct
30	Correct	94 ms	40356 KB	Output is correct
31	Correct	94 ms	40452 KB	Output is correct
32	Correct	84 ms	32524 KB	Output is correct
33	Correct	94 ms	40380 KB	Output is correct
34	Correct	96 ms	40404 KB	Output is correct
35	Correct	93 ms	40360 KB	Output is correct
36	Correct	94 ms	40420 KB	Output is correct
37	Correct	92 ms	40376 KB	Output is correct
38	Correct	92 ms	40344 KB	Output is correct
39	Correct	93 ms	40400 KB	Output is correct
40	Correct	93 ms	40428 KB	Output is correct
41	Correct	93 ms	40428 KB	Output is correct
42	Correct	94 ms	40432 KB	Output is correct
43	Correct	98 ms	40456 KB	Output is correct
44	Incorrect	14 ms	23728 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3308'
45	Halted	0 ms	0 KB	-

답안 #811284

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