Submission #1104944

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1104944	2024-10-24T19:59:44 Z	alexander707070	Ancient Books (IOI17_books)	C++14	50 / 100	115 ms	28740 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,r;

	int pt=s,from=s,to=s,ll=s,rr=s;

	while(true){
		if(ll>=from){
			from=min(from,where[cycle[ll]].first);
			to=max(to,where[cycle[ll]].second);
			ll--;
		}

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

		if(ll<from and rr>to)break;
	}

	pt=to;
	
	while(pt<=n){
		int t=0;

		int z=pt;
		while(pt<=where[cycle[z]].second){
			to=max(to,where[cycle[pt]].second);
			pt++;
		}

		t++;

		while(pt<=n and where[cycle[pt]].first>=s){
			to=max(to,where[cycle[pt]].second);

			if(pt==to){
				pt++; t++;
			}else{
				pt++;
			}
		}

		if(pt<=n)r.push_back(t);
	}

	pt=from;

	while(pt>1){
		int t=0;
		
		int z=pt;
		while(pt>=where[cycle[z]].first){
			from=min(from,where[cycle[pt]].first);
			pt--;
		}

		t++;

		while(pt>=1 and where[cycle[pt]].second<=s){
			from=min(from,where[cycle[pt]].first);
			
			if(pt==from){
				pt--; t++;
			}else{
				pt--;
			}
		}

		if(pt>=1)l.push_back(t);
	}

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

/*int main(){

	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:144:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |  for(int i=0;i<l.size();i++){
      |              ~^~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	8528 KB	Output is correct
2	Correct	1 ms	8528 KB	Output is correct
3	Correct	1 ms	8528 KB	Output is correct
4	Correct	1 ms	8528 KB	Output is correct
5	Correct	1 ms	8528 KB	Output is correct
6	Correct	2 ms	8528 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	2 ms	8528 KB	Output is correct
9	Correct	2 ms	8540 KB	Output is correct
10	Correct	2 ms	8708 KB	Output is correct
11	Correct	1 ms	8528 KB	Output is correct
12	Correct	2 ms	8756 KB	Output is correct
13	Correct	2 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	2 ms	8528 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	8528 KB	Output is correct
2	Correct	1 ms	8528 KB	Output is correct
3	Correct	1 ms	8528 KB	Output is correct
4	Correct	1 ms	8528 KB	Output is correct
5	Correct	1 ms	8528 KB	Output is correct
6	Correct	2 ms	8528 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	2 ms	8528 KB	Output is correct
9	Correct	2 ms	8540 KB	Output is correct
10	Correct	2 ms	8708 KB	Output is correct
11	Correct	1 ms	8528 KB	Output is correct
12	Correct	2 ms	8756 KB	Output is correct
13	Correct	2 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	2 ms	8528 KB	Output is correct
19	Correct	2 ms	8696 KB	Output is correct
20	Correct	2 ms	8700 KB	Output is correct
21	Correct	2 ms	8528 KB	Output is correct
22	Correct	1 ms	8528 KB	Output is correct
23	Correct	2 ms	8528 KB	Output is correct
24	Correct	1 ms	8528 KB	Output is correct
25	Correct	1 ms	8528 KB	Output is correct
26	Correct	2 ms	8700 KB	Output is correct
27	Correct	1 ms	8528 KB	Output is correct
28	Correct	2 ms	8696 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	2 ms	8528 KB	Output is correct
2	Correct	1 ms	8528 KB	Output is correct
3	Correct	1 ms	8528 KB	Output is correct
4	Correct	1 ms	8528 KB	Output is correct
5	Correct	1 ms	8528 KB	Output is correct
6	Correct	2 ms	8528 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	2 ms	8528 KB	Output is correct
9	Correct	2 ms	8540 KB	Output is correct
10	Correct	2 ms	8708 KB	Output is correct
11	Correct	1 ms	8528 KB	Output is correct
12	Correct	2 ms	8756 KB	Output is correct
13	Correct	2 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	2 ms	8528 KB	Output is correct
19	Correct	2 ms	8696 KB	Output is correct
20	Correct	2 ms	8700 KB	Output is correct
21	Correct	2 ms	8528 KB	Output is correct
22	Correct	1 ms	8528 KB	Output is correct
23	Correct	2 ms	8528 KB	Output is correct
24	Correct	1 ms	8528 KB	Output is correct
25	Correct	1 ms	8528 KB	Output is correct
26	Correct	2 ms	8700 KB	Output is correct
27	Correct	1 ms	8528 KB	Output is correct
28	Correct	2 ms	8696 KB	Output is correct
29	Correct	2 ms	8528 KB	Output is correct
30	Correct	115 ms	22344 KB	Output is correct
31	Correct	111 ms	22272 KB	Output is correct
32	Correct	83 ms	28740 KB	Output is correct
33	Correct	104 ms	28672 KB	Output is correct
34	Correct	93 ms	28672 KB	Output is correct
35	Correct	103 ms	28668 KB	Output is correct
36	Correct	91 ms	24648 KB	Output is correct
37	Correct	83 ms	24656 KB	Output is correct
38	Correct	81 ms	22344 KB	Output is correct
39	Correct	81 ms	22344 KB	Output is correct
40	Correct	83 ms	22344 KB	Output is correct
41	Correct	105 ms	22272 KB	Output is correct
42	Correct	107 ms	22344 KB	Output is correct
43	Correct	95 ms	28672 KB	Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	8528 KB	Output is correct
2	Correct	1 ms	8528 KB	Output is correct
3	Correct	1 ms	8528 KB	Output is correct
4	Correct	1 ms	8528 KB	Output is correct
5	Correct	1 ms	8528 KB	Output is correct
6	Correct	2 ms	8528 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	2 ms	8528 KB	Output is correct
9	Correct	2 ms	8540 KB	Output is correct
10	Correct	2 ms	8708 KB	Output is correct
11	Correct	1 ms	8528 KB	Output is correct
12	Correct	2 ms	8756 KB	Output is correct
13	Correct	2 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	2 ms	8528 KB	Output is correct
19	Correct	2 ms	8696 KB	Output is correct
20	Correct	2 ms	8700 KB	Output is correct
21	Correct	2 ms	8528 KB	Output is correct
22	Correct	1 ms	8528 KB	Output is correct
23	Correct	2 ms	8528 KB	Output is correct
24	Correct	1 ms	8528 KB	Output is correct
25	Correct	1 ms	8528 KB	Output is correct
26	Correct	2 ms	8700 KB	Output is correct
27	Correct	1 ms	8528 KB	Output is correct
28	Correct	2 ms	8696 KB	Output is correct
29	Correct	2 ms	8528 KB	Output is correct
30	Correct	115 ms	22344 KB	Output is correct
31	Correct	111 ms	22272 KB	Output is correct
32	Correct	83 ms	28740 KB	Output is correct
33	Correct	104 ms	28672 KB	Output is correct
34	Correct	93 ms	28672 KB	Output is correct
35	Correct	103 ms	28668 KB	Output is correct
36	Correct	91 ms	24648 KB	Output is correct
37	Correct	83 ms	24656 KB	Output is correct
38	Correct	81 ms	22344 KB	Output is correct
39	Correct	81 ms	22344 KB	Output is correct
40	Correct	83 ms	22344 KB	Output is correct
41	Correct	105 ms	22272 KB	Output is correct
42	Correct	107 ms	22344 KB	Output is correct
43	Correct	95 ms	28672 KB	Output is correct
44	Correct	2 ms	8528 KB	Output is correct
45	Incorrect	2 ms	8528 KB	3rd lines differ - on the 1st token, expected: '9800', found: '9802'
46	Halted	0 ms	0 KB	-

Submission #1104944

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