Submission #758025

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
758025	2023-06-14T04:59:15 Z	alexander707070	Ancient Books (IOI17_books)	C++14	22 / 100	2000 ms	20724 KB

books

#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;
 
int n,perm[MAXN],br,cnt,last,maxpos,to[MAXN],curr,pos;
bool li[MAXN],ok,used[MAXN];
long long sum,add[MAXN],ans;
 
void dfs(int x){
	li[x]=true; 
	sum+=abs(x-perm[x]); br++;

	for(int i=min(x,perm[x]);i<=max(x,perm[x])-1;i++){
		used[i]=true;
	}

	if(!li[perm[x]])dfs(perm[x]);
}
 
long long minimum_walk(vector<int> p, int s){
	n=int(p.size());
 
	for(int i=0;i<n;i++)perm[i]=p[i];
 
	for(int i=0;i<n;i++){
		if(!li[i]){
			sum=br=0; 
			dfs(i); add[i]=sum;
			if(br>1)last=i;
		}
	}

	for(int i=0;i<=last;i++){
		ans+=add[i];
		if(!used[i] and i<last)ans+=2;
	}

	return ans;
}
 
/*
int main(){
	cout<<minimum_walk({0,2,3,1}, 0)<<"\n";
}
*/

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 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	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	312 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	316 KB	Output is correct
17	Correct	1 ms	308 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 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	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	312 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	316 KB	Output is correct
17	Correct	1 ms	308 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	308 KB	Output is correct
22	Correct	1 ms	340 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	340 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	308 KB	Output is correct

Subtask #3

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 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	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	312 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	316 KB	Output is correct
17	Correct	1 ms	308 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	308 KB	Output is correct
22	Correct	1 ms	340 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	340 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	308 KB	Output is correct
30	Execution timed out	2051 ms	20724 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

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

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 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	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	312 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	316 KB	Output is correct
17	Correct	1 ms	308 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	308 KB	Output is correct
22	Correct	1 ms	340 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	340 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	308 KB	Output is correct
30	Execution timed out	2051 ms	20724 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-