답안 #797525

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
797525	2023-07-29T14:11:09 Z	alvingogo	고대 책들 (IOI17_books)	C++14	50 / 100	184 ms	34824 KB

books

#include "books.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

typedef long long ll;
ll minimum_walk(vector<int> p, int s) {
	ll ans=0;
	int n=p.size();
	vector<int> bo(n,-1),bo2(n,-1),k(n),pre(n);
	vector<pair<int,int> > d(n);
	for(int i=0;i<n;i++){
		if(bo[i]==-1){
			pre[i]++;
			int cnt=0;
			int f=0;
			for(int x=i;bo[x]==-1;x=p[x]){
				bo[x]=i;
				cnt++;
				f=max(f,x);
			}
			if(cnt>=2){
				k[i]=1;
			}
			pre[f]--;
			for(int x=i;bo2[x]==-1;x=p[x]){
				bo2[x]=i;
				d[x]={i,f};
			}
		}
		ans+=abs(i-p[i]);
	}
	int l=d[s].fs,r=d[s].sc,nl=s,nr=s;
	while(nl>l || nr<r){
		if(nl>l){
			nl--;
			l=min(l,d[nl].fs);
			r=max(r,d[nl].sc);
		}
		else if(nr<r){
			nr++;
			l=min(l,d[nr].fs);
			r=max(r,d[nr].sc);
		}
	}
	for(int i=1;i<n;i++){
		pre[i]+=pre[i-1];
	}
	int g=0;
	k[bo[s]]=1;
	vector<pair<int,int> > e;
	for(int i=0;i<n;i++){
		if(pre[i]){

		}
		else{
			if(g<=nl && i>=nr){
				while(nl!=g && nr!=i){
					int pl=l,pr=r;
					int c1=0;
					while(1){
						c1++;
						int dl=nl-1,dr=nr;
						while(nl>dl || nr<dr){
							if(nl>dl){
								nl--;
								l=min(l,d[nl].fs);
								r=max(r,d[nl].sc);
							}
							else if(nr<dr){
								nr++;
								l=min(l,d[nr].fs);
								r=max(r,d[nr].sc);
							}
						}
						if(nr!=pr){
							pl=nl;
							pr=nr;
							break;
						}
					}
					int c2=0;
					while(1){
						c2++;
						int dl=nl,dr=nr+1;
						while(nl>dl || nr<dr){
							if(nl>dl){
								nl--;
								l=min(l,d[nl].fs);
								r=max(r,d[nl].sc);
							}
							else if(nr<dr){
								nr++;
								l=min(l,d[nr].fs);
								r=max(r,d[nr].sc);
							}
						}
						if(nl==pl){
							break;
						}
					}
					ans+=2*min(c1,c2);
				}
			}
			if(i!=g || i==s){
				e.push_back({g,i});
			}
			g=i+1;
		}
	}
	int nw=e[0].fs;
	for(auto h:e){
		ans+=2*(h.fs-nw);
		nw=h.sc;
	}
	return ans;
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	300 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 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	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	296 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	300 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 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	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	296 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	304 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	304 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	300 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 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	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	296 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	304 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	304 KB	Output is correct
30	Correct	184 ms	32500 KB	Output is correct
31	Correct	178 ms	32620 KB	Output is correct
32	Correct	92 ms	32568 KB	Output is correct
33	Correct	97 ms	34724 KB	Output is correct
34	Correct	98 ms	34824 KB	Output is correct
35	Correct	101 ms	34752 KB	Output is correct
36	Correct	103 ms	33860 KB	Output is correct
37	Correct	100 ms	32736 KB	Output is correct
38	Correct	101 ms	32644 KB	Output is correct
39	Correct	101 ms	32544 KB	Output is correct
40	Correct	109 ms	32624 KB	Output is correct
41	Correct	131 ms	32628 KB	Output is correct
42	Correct	120 ms	32536 KB	Output is correct
43	Correct	98 ms	32628 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	468 KB	Execution killed with signal 11
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	300 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 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	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	296 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	304 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	304 KB	Output is correct
30	Correct	184 ms	32500 KB	Output is correct
31	Correct	178 ms	32620 KB	Output is correct
32	Correct	92 ms	32568 KB	Output is correct
33	Correct	97 ms	34724 KB	Output is correct
34	Correct	98 ms	34824 KB	Output is correct
35	Correct	101 ms	34752 KB	Output is correct
36	Correct	103 ms	33860 KB	Output is correct
37	Correct	100 ms	32736 KB	Output is correct
38	Correct	101 ms	32644 KB	Output is correct
39	Correct	101 ms	32544 KB	Output is correct
40	Correct	109 ms	32624 KB	Output is correct
41	Correct	131 ms	32628 KB	Output is correct
42	Correct	120 ms	32536 KB	Output is correct
43	Correct	98 ms	32628 KB	Output is correct
44	Runtime error	1 ms	468 KB	Execution killed with signal 11
45	Halted	0 ms	0 KB	-