Submission #806871

# Submission time Handle Problem Language Result Execution time Memory
806871 2023-08-04T10:41:55 Z k1r1t0 Ancient Books (IOI17_books) C++17
0 / 100
1 ms 308 KB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define N 1100000

int n, type[N];

ll minimum_walk(vector<int> p, int s) {
	n = p.size();
	ll ans = 0;
	for (int i = 0; i < n; i++)
		ans += abs(i - p[i]);
	fill(type, type + n, -1);
	int cycles = 0;
	for (int i = 0; i < n; i++) {
		if (type[i] != -1 || i == p[i]) continue;
		int cur = i;
		do {
			type[cur] = cycles;
			cur = p[cur];
		} while (cur != i);
		cycles++;
	}
	if (cycles == 0) return 0;
	int closest = n;
	for (int i = 0; i < n; i++)
		if (type[i] != -1) closest = min(closest, abs(i - s));
	return ans + 2 * (cycles - 1 + closest);
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3106'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -