답안 #105257

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
105257	2019-04-11T04:39:28 Z	puyu_liao	고대 책들 (IOI17_books)	C++14	50 / 100	245 ms	9744 KB

books

#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define IOS {cin.tie(0);ios_base::sync_with_stdio(false);}

#include"books.h"
typedef long long lll;
#define N 1000005
bitset<N> vis;

lll minimum_walk(vector<int> p,int s){
	vis.reset();
	int ll = s,rr = s,gl,gr;
	lll ans = 0;
	for(int i=0;i<p.size();) if(!vis[i]){
		gl = p.size()+1, gr = -1;
		int j = i;
		do{
			int t = j;
			if(vis[t]) {
				j++;
				continue;
			}
			vis[t] = 1;
			while(!vis[p[t]]){ 
				gl = min(gl,t); gr = max(gr,t);
				vis[p[t]] = 1;
				ans += abs(p[t] - t);
				t = p[t];
				gl = min(gl,t); gr = max(gr,t);
			}	
			ans += abs(p[t] - t);
			j++;
		}while(j<=gr);
		i = j;
		if(gl <= gr && gl < s && gr > s) continue;
		if(gl <= gr && gl < s) ll = min(ll,gl);
		if(gl <= gr && gr > s) rr = max(rr,gr);
		if(gl <= gr) ans -= 2*(gr - gl);
	}
	return ans + rr+rr-ll-ll;
}

Compilation message

books.cpp: In function 'lll minimum_walk(std::vector<int>, int)':
books.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<p.size();) if(!vis[i]){
              ~^~~~~~~~~

Subtask #1

12.0 / 12.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	512 KB	Output is correct
2	Correct	3 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	2 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	512 KB	Output is correct
13	Correct	2 ms	512 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	2 ms	512 KB	Output is correct
17	Correct	2 ms	512 KB	Output is correct
18	Correct	3 ms	512 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	512 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	512 KB	Output is correct
25	Correct	2 ms	512 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	2 ms	512 KB	Output is correct
28	Correct	2 ms	512 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	236 ms	9588 KB	Output is correct
31	Correct	245 ms	9592 KB	Output is correct
32	Correct	153 ms	9720 KB	Output is correct
33	Correct	188 ms	9640 KB	Output is correct
34	Correct	146 ms	9592 KB	Output is correct
35	Correct	156 ms	9720 KB	Output is correct
36	Correct	148 ms	9692 KB	Output is correct
37	Correct	200 ms	9744 KB	Output is correct
38	Correct	221 ms	9720 KB	Output is correct
39	Correct	156 ms	9724 KB	Output is correct
40	Correct	164 ms	9684 KB	Output is correct
41	Correct	231 ms	9696 KB	Output is correct
42	Correct	172 ms	9720 KB	Output is correct
43	Correct	151 ms	9660 KB	Output is correct

Subtask #4

0 / 20.0

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

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	512 KB	Output is correct
2	Correct	3 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	2 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	512 KB	Output is correct
13	Correct	2 ms	512 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	2 ms	512 KB	Output is correct
17	Correct	2 ms	512 KB	Output is correct
18	Correct	3 ms	512 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	512 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	512 KB	Output is correct
25	Correct	2 ms	512 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	2 ms	512 KB	Output is correct
28	Correct	2 ms	512 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	236 ms	9588 KB	Output is correct
31	Correct	245 ms	9592 KB	Output is correct
32	Correct	153 ms	9720 KB	Output is correct
33	Correct	188 ms	9640 KB	Output is correct
34	Correct	146 ms	9592 KB	Output is correct
35	Correct	156 ms	9720 KB	Output is correct
36	Correct	148 ms	9692 KB	Output is correct
37	Correct	200 ms	9744 KB	Output is correct
38	Correct	221 ms	9720 KB	Output is correct
39	Correct	156 ms	9724 KB	Output is correct
40	Correct	164 ms	9684 KB	Output is correct
41	Correct	231 ms	9696 KB	Output is correct
42	Correct	172 ms	9720 KB	Output is correct
43	Correct	151 ms	9660 KB	Output is correct
44	Incorrect	2 ms	384 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-