oj.uz

Submission #869263

# Submission time Handle Problem Language Result Execution time Memory
869263 2023-11-03T22:11:54 Z MinaRagy06 Speedrun (RMI21_speedrun) C++17
63 / 100
 55 ms 1656 KB 
#include <bits/stdc++.h>
#ifdef MINA
#include "grader.cpp"
#endif
#include "speedrun.h"
using namespace std;
typedef int64_t ll;

// {child, next, par}
bool get(int vals[3]) {
	if (~vals[0]) return 1;
	for (int j = 0; j < 3; j++) {
		vals[j] = 0;
		for (int b = 0; b < 10; b++) {
			if (getHint(10 * j + b + 1)) {
				vals[j] |= 1 << b;
			}
		}
	}
	return 1;
}
void assign(int i, int vals[3]) {
	for (int j = 0; j < 3; j++) {
		for (int b = 0; b < 10; b++) {
			if ((vals[j] >> b) & 1) {
				setHint(i, 10 * j + b + 1, 1);
			}
		}
	}
}
// {child, nxt, par}
void dfs(int i, int par, int nxt, vector<int> adj[], int vals[][3]) {
	vals[i][0] = 0;
	vals[i][1] = nxt;
	vals[i][2] = par;
	for (int j = 0; j < (int) adj[i].size(); j++) {
		if (adj[i][j] == par) continue;
		if (!vals[i][0]) {
			vals[i][0] = adj[i][j];
		}
		int newpar = i;
		int newnxt = 0;
		for (int k = j + 1; k < (int) adj[i].size(); k++) {
			if (adj[i][k] == par) continue;
			newnxt = adj[i][k];
			break;
		}
		dfs(adj[i][j], newpar, newnxt, adj, vals);
	}
}
void assignHints(int subtask, int n, int a[], int b[]) {
	vector<int> adj[n + 1];
	for (int i = 1; i < n; i++) {
		adj[a[i]].push_back(b[i]);
		adj[b[i]].push_back(a[i]);
	}
	setHintLen(30);
	int vals[n + 1][3];
	memset(vals, -1, sizeof vals);
	dfs(1, 0, 0, adj, vals);
	for (int i = 1; i <= n; i++) {
		assign(i, vals[i]);
	}
}
// {child, next, par}
void dfs(int i, int vals[][3]) {
	while (1) {
		get(vals[i]);
		if (vals[i][0]) {
			goTo(vals[i][0]);
			dfs(vals[i][0], vals);
		}
		if (vals[i][1]) {
			goTo(vals[i][2]);
			goTo(vals[i][1]);
			i = vals[i][1];
		} else {
			break;
		}
	}
	get(vals[i]);
	if (vals[i][2]) goTo(vals[i][2]);
}
void speedrun(int subtask, int n, int start) {
	int vals[n + 1][3];
	memset(vals, -1, sizeof vals);
	int cur = start;
	while (get(vals[cur]) && vals[cur][2]) {
		cur = vals[cur][2];
		goTo(cur);
	}
	assert(cur == 1);
	dfs(cur, vals);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1640 KB Output is correct
2 Correct 44 ms 1392 KB Output is correct
3 Correct 52 ms 1392 KB Output is correct
4 Correct 49 ms 1388 KB Output is correct

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 1388 KB Output is correct
2 Correct 51 ms 1656 KB Output is correct
3 Correct 51 ms 1644 KB Output is correct
4 Correct 45 ms 1392 KB Output is correct
5 Correct 53 ms 1284 KB Output is correct
6 Correct 51 ms 1412 KB Output is correct

Subtask #5
30.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 52 ms 1388 KB Partial solution
2 Partially correct 52 ms 1396 KB Partial solution
3 Partially correct 47 ms 1276 KB Partial solution
4 Partially correct 52 ms 1652 KB Partial solution
5 Partially correct 55 ms 1396 KB Partial solution
6 Partially correct 52 ms 1404 KB Partial solution
7 Partially correct 48 ms 1392 KB Partial solution