답안 #338136

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338136	2020-12-22T14:54:47 Z	cki86201	고대 책들 (IOI17_books)	C++17	50 / 100	293 ms	29932 KB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;

#define Fi first
#define Se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<(n);i++)
typedef tuple<int, int, int> t3;

int c[1000010], lv[1000010], rv[1000010], T[1000010], S[1000010];
ll minimum_walk(vector<int> p, int s) {
	int n = szz(p);
	ll ans = 0;
	rep(i, n) {
		int l = i, r = p[i];
		if(l > r) swap(l, r);
		T[l]++, T[r]--;
		ans += r - l;
	}
	for(int i=1;i<n;i++) T[i] += T[i-1];
	rep(i, n) S[i] = (i ? S[i-1] : 0) + (T[i] == 0);
	auto gs = [&](int s, int e) {
		return (e ? S[e-1] : 0) - (s ? S[s-1] : 0);
	};
	rep(i, n) if(!c[i]) {
		int l = i, r = i;
		for(int j=p[i];j!=i;j=p[j]) l = min(l, j), r = max(r, j);
		c[i] = 1, lv[i] = l, rv[i] = r;
		for(int j=p[i];j!=i;j=p[j]) c[j] = 1, lv[j] = l, rv[j] = r;
	}
	int l = s, r = s;
	auto expend = [&]() {
		for(int x=r+1;x<n;x++) {
			if(lv[x] < l) {
				int r2 = x, l2 = -1;
				for(int i=p[r2];i!=r2;i=p[i]) {
					if(i < l) l2 = max(l2, i);
				}
				return pii(l2, r2);
			}
		}
		return pii(-1, -1);
	};
	vector <int> q; q.pb(s);
	auto push = [&](int x) {
		if(l > x) {
			for(int a=l-1;a>=x;a--) q.pb(a);
			l = x;
		}
		if(r < x) {
			for(int a=r+1;a<=x;a++) q.pb(a);
			r = x;
		}
	};
	while(1) {
		rep(i, szz(q)) {
			int t = q[i];
			if(c[t]) continue;
			c[t] = 1;
			for(int x=p[t];x!=t;x=p[x]) {
				push(x);
				c[x] = 1;
			}
		}
		auto [l2, r2] = expend();
		if(l2 == -1) break;
		q.clear();
		int vl = 0, vr = 0;
		for(int i=r;i<r2;i=rv[i+1], vr++);
		for(int i=l;i>l2;i=lv[i-1], vl++);
		ans += 2 * min(vl, vr);
		push(l2);
		push(r2);
		l = l2, r = r2;
	}
	int L = 0, R = n - 1;
	while(L < l && p[L] == L) ++L;
	while(r < R && p[R] == R) --R;
	ans += 2 * (gs(L, l) + gs(r, R));
	return ans;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	293 ms	29932 KB	Output is correct
31	Correct	293 ms	29932 KB	Output is correct
32	Correct	139 ms	29892 KB	Output is correct
33	Correct	148 ms	29932 KB	Output is correct
34	Correct	147 ms	29932 KB	Output is correct
35	Correct	147 ms	29932 KB	Output is correct
36	Correct	149 ms	29820 KB	Output is correct
37	Correct	144 ms	29932 KB	Output is correct
38	Correct	150 ms	29932 KB	Output is correct
39	Correct	148 ms	29932 KB	Output is correct
40	Correct	157 ms	29932 KB	Output is correct
41	Correct	200 ms	29932 KB	Output is correct
42	Correct	185 ms	29932 KB	Output is correct
43	Correct	149 ms	29892 KB	Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	293 ms	29932 KB	Output is correct
31	Correct	293 ms	29932 KB	Output is correct
32	Correct	139 ms	29892 KB	Output is correct
33	Correct	148 ms	29932 KB	Output is correct
34	Correct	147 ms	29932 KB	Output is correct
35	Correct	147 ms	29932 KB	Output is correct
36	Correct	149 ms	29820 KB	Output is correct
37	Correct	144 ms	29932 KB	Output is correct
38	Correct	150 ms	29932 KB	Output is correct
39	Correct	148 ms	29932 KB	Output is correct
40	Correct	157 ms	29932 KB	Output is correct
41	Correct	200 ms	29932 KB	Output is correct
42	Correct	185 ms	29932 KB	Output is correct
43	Correct	149 ms	29892 KB	Output is correct
44	Incorrect	1 ms	364 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3314'
45	Halted	0 ms	0 KB	-

답안 #338136

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