Submission #871709

#	Time	Username	Problem	Language	Result	Execution time	Memory
871709		TAhmed33	Speedrun (RMI21_speedrun)	C++17	100 / 100	68 ms	2196 KiB

speedrun

#include <bits/stdc++.h>
using namespace std;
#include "speedrun.h"
vector <int> adj[2001];
int parent[2001];
vector <int> ord;
void dfs (int pos, int par) {
	for (int i = 1; i <= 10; i++) {
		if (par & (1 << (i - 1))) {
			setHint(pos, i, 1);
		}
	}
	ord.push_back(pos);
	for (auto j : adj[pos]) {
		if (j != par) dfs(j, pos);
	}
}
void assignHints (int subtask, int n, int a[], int b[]) {
	if (n == 1) return;
	for (int i = 1; i < n; i++) {
		adj[a[i]].push_back(b[i]);
		adj[b[i]].push_back(a[i]);
	}
	setHintLen(20);
	dfs(1, 0);	
	for (int i = 1; i < n; i++) {
		int x = ord[i];
		for (int j = 1; j <= 10; j++) {
			if (x & (1 << (j - 1))) {
				setHint(ord[i - 1], j + 10, 1);
			}
		}
	}
}
int getpar () {
	int ret = 0;
	for (int i = 10; i >= 1; i--) {
		ret *= 2; ret += getHint(i);
	}
	return ret;
}
int getnext () {
	int ret = 0;
	for (int i = 20; i >= 11; i--) {
		ret *= 2; ret += getHint(i);
	}
	return ret;
}
void speedrun (int subtask, int n, int start) {
	while (start > 1) {
		start = getpar();
		goTo(start);
	}
	for (int i = 2; i <= n; i++) {
		int x = getnext();
		while (goTo(x) == 0) goTo(getpar());
	}
}

• Subtask 1: 21 / 21
• Subtask 2: 8 / 8
• Subtask 3: 19 / 19
• Subtask 4: 12 / 12
• Subtask 5: 40 / 40