답안 #797526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
797526	2023-07-29T14:12:05 Z	alvingogo	고대 책들 (IOI17_books)	C++14	50 / 100	200 ms	33780 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--;
								dl=min(dl,d[nl].fs);
								dr=max(dr,d[nl].sc);
							}
							else if(nr<dr){
								nr++;
								dl=min(dl,d[nr].fs);
								dr=max(dr,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--;
								dl=min(dl,d[nl].fs);
								dr=max(dr,d[nl].sc);
							}
							else if(nr<dr){
								nr++;
								dl=min(dl,d[nr].fs);
								dr=max(dr,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	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	170 ms	31616 KB	Output is correct
31	Correct	200 ms	31612 KB	Output is correct
32	Correct	84 ms	31608 KB	Output is correct
33	Correct	92 ms	33768 KB	Output is correct
34	Correct	92 ms	33780 KB	Output is correct
35	Correct	94 ms	33776 KB	Output is correct
36	Correct	99 ms	32708 KB	Output is correct
37	Correct	106 ms	31604 KB	Output is correct
38	Correct	96 ms	31596 KB	Output is correct
39	Correct	102 ms	31596 KB	Output is correct
40	Correct	105 ms	31596 KB	Output is correct
41	Correct	125 ms	31612 KB	Output is correct
42	Correct	119 ms	31592 KB	Output is correct
43	Correct	90 ms	31612 KB	Output is correct

Subtask #4

0 / 20.0

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

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	170 ms	31616 KB	Output is correct
31	Correct	200 ms	31612 KB	Output is correct
32	Correct	84 ms	31608 KB	Output is correct
33	Correct	92 ms	33768 KB	Output is correct
34	Correct	92 ms	33780 KB	Output is correct
35	Correct	94 ms	33776 KB	Output is correct
36	Correct	99 ms	32708 KB	Output is correct
37	Correct	106 ms	31604 KB	Output is correct
38	Correct	96 ms	31596 KB	Output is correct
39	Correct	102 ms	31596 KB	Output is correct
40	Correct	105 ms	31596 KB	Output is correct
41	Correct	125 ms	31612 KB	Output is correct
42	Correct	119 ms	31592 KB	Output is correct
43	Correct	90 ms	31612 KB	Output is correct
44	Incorrect	0 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2746'
45	Halted	0 ms	0 KB	-