답안 #797014

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
797014	2023-07-29T04:29:39 Z	QwertyPi	고대 책들 (IOI17_books)	C++14	50 / 100	150 ms	29552 KB

books

#include "books.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int MAXN = 1e6 + 11;
 
struct range{
	int l, r;
	bool extend(range rg){
		bool changed = false;
		if(rg.l < l) changed = true, l = rg.l;
		if(rg.r > r) changed = true, r = rg.r;
		return changed;
	}
	friend range operator+ (const range& s, const range& t){
		return {min(s.l, t.l), max(s.r, t.r)};
	}
	friend void operator+= (range& s, const range& t){
		s = s + t;
	}
	friend bool operator!= (const range& s, const range& t){
		return s.l != t.l || s.r != t.r;
	}
};
 
bool vis[MAXN];
range cyc[MAXN];
int dp[MAXN];
 
long long minimum_walk(vector<int> p, int s) {
	int n = p.size(); 
	
	bool all_eq = true; 
	for(int i = 0; i < n; i++) if(p[i] != i) all_eq = false;
	if(all_eq) return 0;
	
	int al = 0, ar = n - 1; while(p[al] == al) al++; while(p[ar] == ar) ar--;
	long long ans = 0;
	for(int i = 0; i < n; i++){
		ans += abs(p[i] - i);
	}
	
	for(int i = 0; i < n; i++){
		if(!vis[i]){
			vector<int> c = {i}; int x = p[i]; range r = {i, i};
			while(x != c[0]){
				r.extend({x, x});
				c.push_back(x); 
				vis[x] = true; 
				x = p[x];
			}
			for(auto j : c) cyc[j] = r;
		}
	}
	
	for(int i = s - 1; i >= 0; i--){
		cyc[i].extend(cyc[i + 1]);
	}
	
	for(int i = s + 1; i < n; i++){
		cyc[i].extend(cyc[i - 1]);
	}
	
	{
		range cur = cyc[s], nxt = cyc[s];
		do{
			cur = nxt;
			nxt.extend(cyc[nxt.l]);
			nxt.extend(cyc[nxt.r]);
		}while(cur != nxt);
		cyc[s] = nxt;
	}
	for(int i = s - 1; i >= 0; i--){
		cyc[i].extend(cyc[i + 1]);
		range cur = cyc[i], nxt = cyc[i];
		do{
			cur = nxt;
			nxt.extend(cyc[nxt.l]);
			nxt.extend(cyc[nxt.r]);
		}while(cur != nxt);
		cyc[i] = nxt;
	}
	for(int i = s + 1; i < n; i++){
		cyc[i].extend(cyc[i - 1]);
		range cur = cyc[i], nxt = cyc[i];
		do{
			cur = nxt;
			nxt.extend(cyc[nxt.l]);
			nxt.extend(cyc[nxt.r]);
		}while(cur != nxt);
		cyc[i] = nxt;
	}
	
	range cur {s, s}; dp[s] = 0; int res = 1;
	while(cur.l > al || cur.r < ar){
		range nxt {s, s};
		if(cur.l > al) nxt += cyc[cur.l - 1] + cyc[cur.r];
		if(cur.r < ar) nxt += cyc[cur.l] + cyc[cur.r + 1];
		for(int j = nxt.l; j < cur.l; j++) dp[j] = res;
		for(int j = nxt.r; j > cur.r; j--) dp[j] = res;
		cur = nxt;
		++res;
	}
	
	int a1 = dp[al], a2 = dp[ar];
	{
		int c = al;
		while(cyc[c].r < ar){
			c = cyc[c].r; ++c; a1++;
		}
	}
	{
		int c = ar;
		while(cyc[c].l > al){
			c = cyc[c].l; ++c; a2++;
		}
	}
	ans += min(a1, a2) * 2;
	return ans;
}

Subtask #1

12.0 / 12.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	308 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	264 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	308 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	312 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	312 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	308 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	312 KB	Output is correct
30	Correct	122 ms	29420 KB	Output is correct
31	Correct	135 ms	29552 KB	Output is correct
32	Correct	88 ms	14828 KB	Output is correct
33	Correct	150 ms	27584 KB	Output is correct
34	Correct	115 ms	27524 KB	Output is correct
35	Correct	124 ms	27564 KB	Output is correct
36	Correct	112 ms	27524 KB	Output is correct
37	Correct	112 ms	27484 KB	Output is correct
38	Correct	93 ms	27624 KB	Output is correct
39	Correct	92 ms	27628 KB	Output is correct
40	Correct	106 ms	27820 KB	Output is correct
41	Correct	104 ms	28432 KB	Output is correct
42	Correct	123 ms	28516 KB	Output is correct
43	Correct	121 ms	27492 KB	Output is correct

Subtask #4

0 / 20.0

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

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	308 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	264 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	308 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	312 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	312 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	308 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	312 KB	Output is correct
30	Correct	122 ms	29420 KB	Output is correct
31	Correct	135 ms	29552 KB	Output is correct
32	Correct	88 ms	14828 KB	Output is correct
33	Correct	150 ms	27584 KB	Output is correct
34	Correct	115 ms	27524 KB	Output is correct
35	Correct	124 ms	27564 KB	Output is correct
36	Correct	112 ms	27524 KB	Output is correct
37	Correct	112 ms	27484 KB	Output is correct
38	Correct	93 ms	27624 KB	Output is correct
39	Correct	92 ms	27628 KB	Output is correct
40	Correct	106 ms	27820 KB	Output is correct
41	Correct	104 ms	28432 KB	Output is correct
42	Correct	123 ms	28516 KB	Output is correct
43	Correct	121 ms	27492 KB	Output is correct
44	Incorrect	1 ms	340 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3306'
45	Halted	0 ms	0 KB	-