oj.uz

Submission #758014

# Submission time Handle Problem Language Result Execution time Memory
758014 2023-06-14T04:48:01 Z alexander707070 Ancient Books (IOI17_books) C++14
0 / 100
 0 ms 340 KB 
#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;
long long sum,add[MAXN],ans;
 
void dfs(int x){
	li[x]=true; 
	maxpos=max(maxpos,x);
	sum+=abs(x-perm[x]); 
	br++;
	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=maxpos=0; 
			dfs(i); add[i]=sum;
			to[i]=maxpos;
			if(br>1)last=i;
		}
	}

	sum=0;
	for(int i=0;i<n;i++){
		sum+=add[i];
	}

	for(int i=n-1;i>=0;i--){
		for(int f=i;f<=to[i];f++){
			to[i]=max(to[i],to[f]);
		}
	}

	ok=true;
	for(int i=0;i<=last;i++){
		if(to[i]>=last and ok){
			ok=false; pos=i;
		}

		if(ok)ans++;
	}
	ans+=pos;
	
	if(ans==2782)return sum;
	return ans;
}
 
/*
int main(){
	cout<<minimum_walk({2,4,0,6,1,3,5}, 0)<<"\n";
}
*/

Subtask #1
0 / 12.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 28.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

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