oj.uz

Submission #554944

# Submission time Handle Problem Language Result Execution time Memory
554944 2022-04-29T16:45:59 Z bigg Speedrun (RMI21_speedrun) C++14
21 / 100
 44 ms 832 KB 
#include "speedrun.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 10;

void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
	setHintLen(N);
	
	for(int i = 1; i < N; i++ ){
		setHint(A[i], B[i], 1);
		setHint(B[i], A[i], 1);
	}
}
int l;
void dfs(int x, int p){
	for(int i = 1; i <= l; i++){
		if(i == p) continue;
		if(getHint(i)){
			goTo(i);
			dfs(i, x);
		}
	}
	goTo(p);
}

void speedrun(int subtask, int N, int start) { /* your solution here */
	l = getLength();
	dfs(start, start);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 800 KB Output is correct
2 Correct 37 ms 804 KB Output is correct
3 Correct 40 ms 804 KB Output is correct
4 Correct 41 ms 832 KB Output is correct

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 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 1 ms 336 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 40.0

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