Submission #736967

# Submission time Handle Problem Language Result Execution time Memory
736967 2023-05-06T11:49:53 Z jk410 Speedrun (RMI21_speedrun) C++17
0 / 100
33 ms 620 KB
#include "speedrun.h"

void assignHints(int subtask, int N, int A[], int B[]) {
	setHintLen(N);
	for (int i = 1; i < N; i++) {
		setHint(A[i], B[i], 1);
		setHint(B[i], A[i], 1);
	}
}

int Idx[1001];
int Par[1001];

void speedrun(int subtask, int N, int start) {
	for (int i = 1; i <= N; i++)
		Idx[i] = 1;
	int cur = start;
	while (1) {
		if (Idx[cur] > N) {
			if (!Par[cur])
				return;
			goTo(Par[cur]);
			cur = Par[cur];
		}
		if (Idx[cur] == Par[cur]) {
			Idx[cur]++;
			continue;
		}
		if (getHint(Idx[cur]++)) {
			int nxt = Idx[cur] - 1;
			Par[nxt] = cur;
			goTo(nxt);
			cur = nxt;
		}
	}
}
# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 620 KB Invalid bit index for getHint
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB The length is too large
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB The length is too large
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 336 KB The length is too large
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB The length is too large
2 Halted 0 ms 0 KB -