Submission #423825

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
423825	2021-06-11T13:06:37 Z	Bill_00	Ancient Books (IOI17_books)	C++14	50 / 100	230 ms	23748 KB

books

#include "books.h"
#include  <bits/stdc++.h>
#define ll long long
using namespace std;
ll p[1000005],ans,vis[1000005],mx,mn;
void dfs(ll node){
	ans+=(abs(node-p[node]));
	vis[node]=1;
	mx=max(node,mx);
	mn=min(node,mn);
	if(vis[p[node]]) return;
	dfs(p[node]);
}
long long minimum_walk(std::vector<int> P, int s){
	for(ll i=0;i<P.size();i++) p[i]=P[i];
	for(ll i=0;i<P.size();i++){
		if(vis[i]==0 && i!=p[i]){
			if(i>mx){
				ans+=((i-mx)*2);
				mn=i;
			}
			dfs(i);
			if(mn<=s && s<=mx){
				ans+=(min(s-mn,mx-s)*2);
			}
		}
	}
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:15:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for(ll i=0;i<P.size();i++) p[i]=P[i];
      |             ~^~~~~~~~~
books.cpp:16:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(ll i=0;i<P.size();i++){
      |             ~^~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	272 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	272 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	216 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	272 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	216 KB	Output is correct
30	Correct	222 ms	23732 KB	Output is correct
31	Correct	230 ms	23668 KB	Output is correct
32	Correct	122 ms	15864 KB	Output is correct
33	Correct	136 ms	23664 KB	Output is correct
34	Correct	139 ms	23716 KB	Output is correct
35	Correct	144 ms	23664 KB	Output is correct
36	Correct	137 ms	23748 KB	Output is correct
37	Correct	140 ms	23676 KB	Output is correct
38	Correct	156 ms	23664 KB	Output is correct
39	Correct	151 ms	23664 KB	Output is correct
40	Correct	157 ms	23660 KB	Output is correct
41	Correct	174 ms	23748 KB	Output is correct
42	Correct	168 ms	23664 KB	Output is correct
43	Correct	149 ms	23676 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	332 KB	3rd lines differ - on the 1st token, expected: '3304', found: '157444'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	272 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	216 KB	Output is correct
30	Correct	222 ms	23732 KB	Output is correct
31	Correct	230 ms	23668 KB	Output is correct
32	Correct	122 ms	15864 KB	Output is correct
33	Correct	136 ms	23664 KB	Output is correct
34	Correct	139 ms	23716 KB	Output is correct
35	Correct	144 ms	23664 KB	Output is correct
36	Correct	137 ms	23748 KB	Output is correct
37	Correct	140 ms	23676 KB	Output is correct
38	Correct	156 ms	23664 KB	Output is correct
39	Correct	151 ms	23664 KB	Output is correct
40	Correct	157 ms	23660 KB	Output is correct
41	Correct	174 ms	23748 KB	Output is correct
42	Correct	168 ms	23664 KB	Output is correct
43	Correct	149 ms	23676 KB	Output is correct
44	Incorrect	1 ms	332 KB	3rd lines differ - on the 1st token, expected: '3304', found: '157444'
45	Halted	0 ms	0 KB	-

Submission #423825

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