Submission #504774

#	Time	Username	Problem	Language	Result	Execution time	Memory
504774		daongocha	Speedrun (RMI21_speedrun)	C++14	0 / 100	165 ms	696 KiB

speedrun

#include "speedrun.h"

#include <bits/stdc++.h>

#define fileopen(a, b) freopen(((std::string)a + ".inp").c_str(), "r", stdin); freopen(((std::string)b + ".out").c_str(), "w", stdout);
#define fileopen1(a) freopen(((std::string)a + ".inp").c_str(), "r", stdin); freopen(((std::string)a + ".out").c_str(), "w", stdout);
 
using namespace std;

const int MAXN = 1005;
vector<int> path[MAXN];
vector<int> order;
int parent[MAXN];

void dfs(int u, int pre = 0) {
	order.push_back(u);
	parent[u] = pre;
	for (int v: path[u])
		if (v != pre) dfs(v, u);
}

void assignHints(int sub, int n, int A[], int B[]) {
	for (int i = 0; i + 1 < n; i++) {
		int u = A[i], v = B[i];
		path[u].push_back(v);
		path[v].push_back(u);
	}
	
	dfs(1);

	setHintLen(20);
	for (int i = n - 2; i >= 0; i--) {
		int u = order[i], v = order[i + 1];
		for (int j = 1; j <= 10; j++)
			setHint(u, j, (v >> (j - 1) & 1));

		for (int j = 11; j <= 20; j++)
			setHint(u, j, (parent[u] >> (j - 11) & 1));
	}
}

int nxt[MAXN], par[MAXN];
bool passed[MAXN];

void solve(int u, int go) {
	if (!passed[u]) {
		for (int j = 0; j < 10; j++)
			nxt[u] |= (getHint(j + 1) << j);

		for (int j = 0; j < 10; j++) 
			par[u] |= (getHint(j + 11) << j);

		if (!nxt[u]) return;
		
		go = nxt[u];
	}

	if (!goTo(go)) goTo(par[u]), solve(par[u], go);
	else solve(go, 0);
}

void speedrun(int sub, int n, int start) {
	solve(start, 0);
}

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