QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #236559 | #2810. Speedrun | Ahmed57# | 0 | 0ms | 0kb | C++23 | 575b | 2023-11-04 06:05:53 | 2023-11-04 06:05:54 |
Judging History
speedrun
#include <bits/stdc++.h>
#include "speedrun.h"
//#include "grader.cpp"
using namespace std;
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);
}
}
void dfs(int i,int pr,int n){
for(int j = 1;j<=n;j++){
if(j==pr)continue;
if(getHint(j)){
goTo(j);
dfs(j,i,n);
goTo(i);
}
}
}
void speedrun(int subtask, int N, int start){
int n =getLength();
dfs(start,0,n);
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Interactor1 Dangerous Syscalls
Test #1:
score: 0
Interactor1 Dangerous Syscalls
input:
output:
input:
output:
result:
Subtask #2:
score: 0
Interactor1 Dangerous Syscalls
Test #5:
score: 0
Interactor1 Dangerous Syscalls
input:
output:
input:
output:
result:
Subtask #3:
score: 0
Interactor1 Dangerous Syscalls
Test #7:
score: 0
Interactor1 Dangerous Syscalls
input:
output:
input:
output:
result:
Subtask #4:
score: 0
Interactor1 Dangerous Syscalls
Test #10:
score: 0
Interactor1 Dangerous Syscalls
input:
output:
input:
output:
result:
Subtask #5:
score: 0
Interactor1 Dangerous Syscalls
Test #16:
score: 0
Interactor1 Dangerous Syscalls