oj.uz

Submission #767668

# Submission time Handle Problem Language Result Execution time Memory
767668 2023-06-27T03:04:47 Z SanguineChameleon Ancient Books (IOI17_books) C++17
0 / 100
 1 ms 340 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e6 + 20;
int par[maxn];
int depth[maxn];
bool flag[maxn];
bool skip[maxn];
int nxt[maxn];

int root(int u) {
	if (par[u] == -1) {
		return u;
	}
	else {
		return par[u] = root(par[u]);
	}
}

bool update(int u, int v) {
	int ru = root(u);
	int rv = root(v);
	if (ru == rv) {
		return false;
	}
	if (depth[ru] > depth[rv]) {
		swap(ru, rv);
	}
	par[ru] = rv;
	if (depth[ru] == depth[rv]) {
		depth[rv]++;
	}
	return true;
}

long long minimum_walk(vector<int> a, int s) {
	int n = a.size();
	for (int i = 0; i < n; i++) {
		par[i] = -1;
	}
	long long res = 0;
	for (int i = 0; i < n; i++) {
		res += abs(a[i] - i);
		if (i != s && a[i] == i) {
			skip[i] = true;
		}
		else {
			update(i, a[i]);
		}
	}
	nxt[n - 1] = -1;
	for (int i = n - 2; i >= 0; i--) {
		if (!skip[i + 1]) {
			nxt[i] = i + 1;
		}
		else {
			nxt[i] = nxt[i + 1];
		}
	}
	vector<pair<int, pair<int, int>>> edges;
	for (int i = 0; i < n - 1; i++) {
		if (!skip[i] && nxt[i] != -1) {
			edges.emplace_back(nxt[i] - i, make_pair(i, nxt[i]));
		}
	}
	sort(edges.begin(), edges.end());
	for (auto e: edges) {
		if (update(e.second.first, e.second.second)) {
			res += e.first * 2;
		}
	}
	return res;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -