oj.uz

답안 #1053356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053356 2024-08-11T10:53:40 Z Unforgettablepl 고대 책들 (IOI17_books) C++17
0 / 100
 0 ms 348 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;

long long minimum_walk(vector<int> p, int s) {
	int n = p.size();
	vector cycle(n,-1);
	int cycle_cnt = 0;
	long long ans = 0;
	for(int i=0;i<n;i++) {
		ans+=abs(p[i]-i);
		if(cycle[i]!=-1)continue;
		int curr = i;
		do {
			cycle[curr]=cycle_cnt;
			curr = p[curr];
		} while(curr!=i);
		cycle_cnt++;
	}
	vector<bool> visited(cycle_cnt);
	int curr = 0;
	for(int i=0;i<n;i++) {
		if(visited[cycle[i]])continue;
		visited[cycle[i]]=true;
		if(++curr==cycle_cnt)return ans+2ll*i;
	}
	assert(false);
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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 0 ms 348 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 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -