Submission #1105065

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1105065	2024-10-25T09:09:27 Z	alexander707070	Ancient Books (IOI17_books)	C++14	50 / 100	125 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]);
}
 
int dp[1007][1007];
bool vis[1007][1007];
 
int ff(int l,int r){
	if(l<=fr and r>=last)return 0;
	
	if(vis[l][r])return dp[l][r];
	vis[l][r]=true;
	dp[l][r]=2*n;
 
	if(l>1){
		int from=l-1,to=r,ll=l-1,rr=r+1;
		while(ll>=from or rr<=to){
			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++;
			}
		}
 
		dp[l][r]=min(dp[l][r],ff(from,to)+2);
	}
 
	if(r<n){
		int from=l,to=r+1,ll=l-1,rr=r+1;
		while(ll>=from or rr<=to){
			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++;
			}
		}
 
		dp[l][r]=min(dp[l][r],ff(from,to)+2);
	}
 
	return dp[l][r];
}
 
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;
 
	/// more steps inside initial cycle
 
	if(s!=1){
      int from=s,to=s,ll=s,rr=s;
		while(ll>=from or rr<=to){
			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++;
			}
		}
      ans+=ff(from,to);
    }else{
		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;
		}
	}
	
	return ans;
}
 
/*int main(){
 
	vector<int> perm;
	for(int i=0;i<10;i++){
		perm.push_back(i);
	}
 
	while(true){
		random_shuffle(perm.begin(),perm.end());
		for(int i=0;i<10;i++){
			cout<<perm[i]<<" ";
		}
		cout<<"\n";
 
		int z=rand()%10;
 
		cout<<z<<"\n";
		minimum_walk(perm,z);
	}
 
	return 0;
}*/

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	1 ms	8528 KB	Output is correct
5	Correct	1 ms	8528 KB	Output is correct
6	Correct	1 ms	8696 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	2 ms	8528 KB	Output is correct
9	Correct	1 ms	8528 KB	Output is correct
10	Correct	1 ms	8528 KB	Output is correct
11	Correct	2 ms	8528 KB	Output is correct
12	Correct	1 ms	8696 KB	Output is correct
13	Correct	1 ms	8528 KB	Output is correct
14	Correct	1 ms	8528 KB	Output is correct
15	Correct	2 ms	8528 KB	Output is correct
16	Correct	2 ms	8528 KB	Output is correct
17	Correct	2 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	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	1 ms	8528 KB	Output is correct
5	Correct	1 ms	8528 KB	Output is correct
6	Correct	1 ms	8696 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	2 ms	8528 KB	Output is correct
9	Correct	1 ms	8528 KB	Output is correct
10	Correct	1 ms	8528 KB	Output is correct
11	Correct	2 ms	8528 KB	Output is correct
12	Correct	1 ms	8696 KB	Output is correct
13	Correct	1 ms	8528 KB	Output is correct
14	Correct	1 ms	8528 KB	Output is correct
15	Correct	2 ms	8528 KB	Output is correct
16	Correct	2 ms	8528 KB	Output is correct
17	Correct	2 ms	8528 KB	Output is correct
18	Correct	2 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	1 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	1 ms	8528 KB	Output is correct
27	Correct	1 ms	8528 KB	Output is correct
28	Correct	1 ms	8528 KB	Output is correct
29	Correct	1 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	1 ms	8528 KB	Output is correct
5	Correct	1 ms	8528 KB	Output is correct
6	Correct	1 ms	8696 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	2 ms	8528 KB	Output is correct
9	Correct	1 ms	8528 KB	Output is correct
10	Correct	1 ms	8528 KB	Output is correct
11	Correct	2 ms	8528 KB	Output is correct
12	Correct	1 ms	8696 KB	Output is correct
13	Correct	1 ms	8528 KB	Output is correct
14	Correct	1 ms	8528 KB	Output is correct
15	Correct	2 ms	8528 KB	Output is correct
16	Correct	2 ms	8528 KB	Output is correct
17	Correct	2 ms	8528 KB	Output is correct
18	Correct	2 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	1 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	1 ms	8528 KB	Output is correct
27	Correct	1 ms	8528 KB	Output is correct
28	Correct	1 ms	8528 KB	Output is correct
29	Correct	1 ms	8528 KB	Output is correct
30	Correct	120 ms	28700 KB	Output is correct
31	Correct	113 ms	28416 KB	Output is correct
32	Correct	89 ms	31368 KB	Output is correct
33	Correct	102 ms	34120 KB	Output is correct
34	Correct	97 ms	32032 KB	Output is correct
35	Correct	97 ms	31048 KB	Output is correct
36	Correct	97 ms	27068 KB	Output is correct
37	Correct	97 ms	23968 KB	Output is correct
38	Correct	92 ms	29772 KB	Output is correct
39	Correct	94 ms	25228 KB	Output is correct
40	Correct	96 ms	27208 KB	Output is correct
41	Correct	110 ms	25460 KB	Output is correct
42	Correct	110 ms	26952 KB	Output is correct
43	Correct	125 ms	31448 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	12112 KB	Output is correct
2	Correct	2 ms	10576 KB	Output is correct
3	Correct	3 ms	11492 KB	Output is correct
4	Correct	6 ms	12112 KB	Output is correct
5	Correct	5 ms	12112 KB	Output is correct
6	Correct	2 ms	10576 KB	Output is correct
7	Correct	2 ms	10744 KB	Output is correct
8	Correct	2 ms	10576 KB	Output is correct
9	Correct	2 ms	10576 KB	Output is correct
10	Correct	1 ms	8656 KB	Output is correct
11	Incorrect	2 ms	11004 KB	3rd lines differ - on the 1st token, expected: '446014', found: '445348'
12	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	1 ms	8528 KB	Output is correct
5	Correct	1 ms	8528 KB	Output is correct
6	Correct	1 ms	8696 KB	Output is correct
7	Correct	1 ms	8528 KB	Output is correct
8	Correct	2 ms	8528 KB	Output is correct
9	Correct	1 ms	8528 KB	Output is correct
10	Correct	1 ms	8528 KB	Output is correct
11	Correct	2 ms	8528 KB	Output is correct
12	Correct	1 ms	8696 KB	Output is correct
13	Correct	1 ms	8528 KB	Output is correct
14	Correct	1 ms	8528 KB	Output is correct
15	Correct	2 ms	8528 KB	Output is correct
16	Correct	2 ms	8528 KB	Output is correct
17	Correct	2 ms	8528 KB	Output is correct
18	Correct	2 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	1 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	1 ms	8528 KB	Output is correct
27	Correct	1 ms	8528 KB	Output is correct
28	Correct	1 ms	8528 KB	Output is correct
29	Correct	1 ms	8528 KB	Output is correct
30	Correct	120 ms	28700 KB	Output is correct
31	Correct	113 ms	28416 KB	Output is correct
32	Correct	89 ms	31368 KB	Output is correct
33	Correct	102 ms	34120 KB	Output is correct
34	Correct	97 ms	32032 KB	Output is correct
35	Correct	97 ms	31048 KB	Output is correct
36	Correct	97 ms	27068 KB	Output is correct
37	Correct	97 ms	23968 KB	Output is correct
38	Correct	92 ms	29772 KB	Output is correct
39	Correct	94 ms	25228 KB	Output is correct
40	Correct	96 ms	27208 KB	Output is correct
41	Correct	110 ms	25460 KB	Output is correct
42	Correct	110 ms	26952 KB	Output is correct
43	Correct	125 ms	31448 KB	Output is correct
44	Correct	5 ms	12112 KB	Output is correct
45	Correct	2 ms	10576 KB	Output is correct
46	Correct	3 ms	11492 KB	Output is correct
47	Correct	6 ms	12112 KB	Output is correct
48	Correct	5 ms	12112 KB	Output is correct
49	Correct	2 ms	10576 KB	Output is correct
50	Correct	2 ms	10744 KB	Output is correct
51	Correct	2 ms	10576 KB	Output is correct
52	Correct	2 ms	10576 KB	Output is correct
53	Correct	1 ms	8656 KB	Output is correct
54	Incorrect	2 ms	11004 KB	3rd lines differ - on the 1st token, expected: '446014', found: '445348'
55	Halted	0 ms	0 KB	-

Submission #1105065

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