Submission #1105010

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1105010	2024-10-25T07:27:57 Z	alexander707070	Ancient Books (IOI17_books)	C++14	50 / 100	130 ms	34120 KB

books

#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;

int n,s,p[MAXN],fr,last,mins,maxs,pref[MAXN],curr;
bool li[MAXN];
long long ans;

int k,cycle[MAXN];
pair<int,int> where[MAXN];

void dfs(int x){
	li[x]=true;
	cycle[x]=k;

	ans+=abs(x-p[x]);
	mins=min(mins,x);
	maxs=max(maxs,x);

	if(!li[p[x]])dfs(p[x]);
}

long long minimum_walk(vector<int> P, int S){
	n=int(P.size()); s=S+1;

	for(int i=1;i<=n;i++){
		p[i]=P[i-1]+1;
		li[i]=false; pref[i]=0;
	}
	last=0; fr=n+1; k=0; ans=0;

	for(int i=1;i<=n;i++){
		if(!li[i]){
			if(p[i]!=i)last=i;
			dfs(i);
		}
	}

	for(int i=1;i<=n;i++)li[i]=false;

	for(int i=n;i>=1;i--){
		if(!li[i]){
			k++;
			if(p[i]!=i)fr=i;

			mins=n; maxs=1;
			dfs(i);

			where[k]={mins,maxs};
			pref[mins]++; pref[maxs]--;
		}
	}
	ans/=2;

	for(int i=1;i<=n-1;i++){
		curr+=pref[i];
		if(i<s)continue;

		if(curr==0 and last>i)ans+=2;
	}

	curr=0;
	for(int i=n;i>=2;i--){
		curr+=pref[i];
		if(i>s)continue;

		if(curr==0 and fr<i)ans+=2;
	}

	/// more steps inside initial cycle

	vector<int> l={0},r={0};
	int from=s,to=s,ll=s,rr=s;
	
	while(true){
		while(ll>=from){
			from=min(from,where[cycle[ll]].first);
			to=max(to,where[cycle[ll]].second);
			ll--;
		}

		while(rr<=to){
			from=min(from,where[cycle[rr]].first);
			to=max(to,where[cycle[rr]].second);
			rr++;
		}

		if(ll<from and rr>to){
			if(from==1 or to==n)break;

			if(where[cycle[ll]].second>=s and where[cycle[rr]].first<=s){
				l[l.size()-1]++; r[r.size()-1]++;
				l.push_back(0); r.push_back(0);
				from--; to++;
			}else if(where[cycle[ll]].second>=s){
				r[r.size()-1]++; to++;
			}else{
				l[l.size()-1]++; from--;
			}
		}
	}

	for(int i=0;i<l.size();i++){
		ans+=2*min(l[i],r[i]);
	}
	
	return ans;
}

/*int main(){

	cout<<minimum_walk({12,1,9,3,7,5,6,4,8,2,11,10,0},6)<<"\n";

	vector<int> perm;
	for(int i=0;i<20;i++){
		perm.push_back(i);
	}

	while(true){
		random_shuffle(perm.begin(),perm.end());
		for(int i=0;i<20;i++){
			cout<<perm[i]<<" ";
		}
		cout<<"\n";

		int z=rand()%20;

		cout<<z<<"\n";
		minimum_walk(perm,z);
	}

	return 0;
}*/

Compilation message

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

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	8528 KB	Output is correct
2	Correct	1 ms	8528 KB	Output is correct
3	Correct	2 ms	8528 KB	Output is correct
4	Correct	2 ms	8528 KB	Output is correct
5	Correct	1 ms	8640 KB	Output is correct
6	Correct	1 ms	8528 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	1 ms	8528 KB	Output is correct
9	Correct	2 ms	8528 KB	Output is correct
10	Correct	1 ms	8528 KB	Output is correct
11	Correct	2 ms	8700 KB	Output is correct
12	Correct	2 ms	8528 KB	Output is correct
13	Correct	1 ms	8696 KB	Output is correct
14	Correct	2 ms	8528 KB	Output is correct
15	Correct	2 ms	8528 KB	Output is correct
16	Correct	1 ms	8528 KB	Output is correct
17	Correct	1 ms	8528 KB	Output is correct
18	Correct	1 ms	8528 KB	Output is correct
19	Correct	2 ms	8528 KB	Output is correct
20	Correct	2 ms	8528 KB	Output is correct
21	Correct	2 ms	8528 KB	Output is correct
22	Correct	2 ms	8528 KB	Output is correct
23	Correct	2 ms	8528 KB	Output is correct
24	Correct	2 ms	8528 KB	Output is correct
25	Correct	2 ms	8528 KB	Output is correct
26	Correct	2 ms	8528 KB	Output is correct
27	Correct	2 ms	8528 KB	Output is correct
28	Correct	2 ms	8528 KB	Output is correct
29	Correct	2 ms	8528 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	8528 KB	Output is correct
2	Correct	1 ms	8528 KB	Output is correct
3	Correct	2 ms	8528 KB	Output is correct
4	Correct	2 ms	8528 KB	Output is correct
5	Correct	1 ms	8640 KB	Output is correct
6	Correct	1 ms	8528 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	1 ms	8528 KB	Output is correct
9	Correct	2 ms	8528 KB	Output is correct
10	Correct	1 ms	8528 KB	Output is correct
11	Correct	2 ms	8700 KB	Output is correct
12	Correct	2 ms	8528 KB	Output is correct
13	Correct	1 ms	8696 KB	Output is correct
14	Correct	2 ms	8528 KB	Output is correct
15	Correct	2 ms	8528 KB	Output is correct
16	Correct	1 ms	8528 KB	Output is correct
17	Correct	1 ms	8528 KB	Output is correct
18	Correct	1 ms	8528 KB	Output is correct
19	Correct	2 ms	8528 KB	Output is correct
20	Correct	2 ms	8528 KB	Output is correct
21	Correct	2 ms	8528 KB	Output is correct
22	Correct	2 ms	8528 KB	Output is correct
23	Correct	2 ms	8528 KB	Output is correct
24	Correct	2 ms	8528 KB	Output is correct
25	Correct	2 ms	8528 KB	Output is correct
26	Correct	2 ms	8528 KB	Output is correct
27	Correct	2 ms	8528 KB	Output is correct
28	Correct	2 ms	8528 KB	Output is correct
29	Correct	2 ms	8528 KB	Output is correct
30	Correct	130 ms	26888 KB	Output is correct
31	Correct	128 ms	28680 KB	Output is correct
32	Correct	102 ms	31868 KB	Output is correct
33	Correct	92 ms	33456 KB	Output is correct
34	Correct	95 ms	34120 KB	Output is correct
35	Correct	93 ms	29220 KB	Output is correct
36	Correct	91 ms	29512 KB	Output is correct
37	Correct	99 ms	25860 KB	Output is correct
38	Correct	85 ms	28780 KB	Output is correct
39	Correct	94 ms	25588 KB	Output is correct
40	Correct	101 ms	28784 KB	Output is correct
41	Correct	113 ms	26196 KB	Output is correct
42	Correct	130 ms	28912 KB	Output is correct
43	Correct	91 ms	31792 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	8696 KB	Output is correct
2	Correct	3 ms	8528 KB	Output is correct
3	Incorrect	2 ms	8528 KB	3rd lines differ - on the 1st token, expected: '5920', found: '5614'
4	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	8528 KB	Output is correct
2	Correct	1 ms	8528 KB	Output is correct
3	Correct	2 ms	8528 KB	Output is correct
4	Correct	2 ms	8528 KB	Output is correct
5	Correct	1 ms	8640 KB	Output is correct
6	Correct	1 ms	8528 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	1 ms	8528 KB	Output is correct
9	Correct	2 ms	8528 KB	Output is correct
10	Correct	1 ms	8528 KB	Output is correct
11	Correct	2 ms	8700 KB	Output is correct
12	Correct	2 ms	8528 KB	Output is correct
13	Correct	1 ms	8696 KB	Output is correct
14	Correct	2 ms	8528 KB	Output is correct
15	Correct	2 ms	8528 KB	Output is correct
16	Correct	1 ms	8528 KB	Output is correct
17	Correct	1 ms	8528 KB	Output is correct
18	Correct	1 ms	8528 KB	Output is correct
19	Correct	2 ms	8528 KB	Output is correct
20	Correct	2 ms	8528 KB	Output is correct
21	Correct	2 ms	8528 KB	Output is correct
22	Correct	2 ms	8528 KB	Output is correct
23	Correct	2 ms	8528 KB	Output is correct
24	Correct	2 ms	8528 KB	Output is correct
25	Correct	2 ms	8528 KB	Output is correct
26	Correct	2 ms	8528 KB	Output is correct
27	Correct	2 ms	8528 KB	Output is correct
28	Correct	2 ms	8528 KB	Output is correct
29	Correct	2 ms	8528 KB	Output is correct
30	Correct	130 ms	26888 KB	Output is correct
31	Correct	128 ms	28680 KB	Output is correct
32	Correct	102 ms	31868 KB	Output is correct
33	Correct	92 ms	33456 KB	Output is correct
34	Correct	95 ms	34120 KB	Output is correct
35	Correct	93 ms	29220 KB	Output is correct
36	Correct	91 ms	29512 KB	Output is correct
37	Correct	99 ms	25860 KB	Output is correct
38	Correct	85 ms	28780 KB	Output is correct
39	Correct	94 ms	25588 KB	Output is correct
40	Correct	101 ms	28784 KB	Output is correct
41	Correct	113 ms	26196 KB	Output is correct
42	Correct	130 ms	28912 KB	Output is correct
43	Correct	91 ms	31792 KB	Output is correct
44	Correct	2 ms	8696 KB	Output is correct
45	Correct	3 ms	8528 KB	Output is correct
46	Incorrect	2 ms	8528 KB	3rd lines differ - on the 1st token, expected: '5920', found: '5614'
47	Halted	0 ms	0 KB	-

Submission #1105010

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