Submission #1249168

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249168		sliviu	Speedrun (RMI21_speedrun)	C++20	0 / 100	2314 ms	440 KiB

speedrun

#include "speedrun.h"

constexpr int NMAX=1001;

#include<bitset>
#include<cassert>

void dfs(int N, std::bitset<NMAX>& vis, int node)
{
	vis[node]=1;
	for(int i=0;i<=N;++i)
		if(!vis[i] && getHint(i))
		{
			assert(goTo(i));
			assert(getHint(node));
			dfs(N, vis, i);
			assert(goTo(node));
			assert(getHint(i));
		}
}

void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
	setHintLen(1000);
	for(int i=1;i<=N;++i)
		for(int j=1;j<=N;++j)
			setHint(i, j, 0);
	for(int i=1;i<N;++i)
	{
		setHint(A[i], B[i], 1);
		setHint(B[i], A[i], 1);
	}
}

void speedrun(int subtask, int N, int start) { /* your solution here */
	std::bitset<NMAX> vis;
	dfs(N, vis, start);
}

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