oj.uz

답안 #757238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
757238 2023-06-12T20:44:43 Z alexander707070 고대 책들 (IOI17_books) C++14
0 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;
 
int n,perm[MAXN],len[MAXN],br,cnt;
bool li[MAXN];
long long sum,add[MAXN],ans;

void dfs(int x){
	li[x]=true;
	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=0; 
			dfs(i); add[i]=sum; len[i]=br;
		}
	}

	cnt=n;
	for(int i=0;i<n;i++){
		if(len[i]>0){
			ans+=add[i]; cnt-=len[i];
		}
		if(cnt==0){
			ans+=i; break;
		}
		ans++;
	}

	return ans;
}

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

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 308 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 308 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 308 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4736'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 308 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -