QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#236558#2810. SpeedrunAhmed57#0 0ms0kbC++23742b2023-11-04 06:04:252023-11-04 06:04:25

Judging History

你现在查看的是测评时间为 2023-11-04 06:04:25 的历史记录

  • [2024-06-05 09:15:00]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:5ms
  • 内存:3884kb
  • [2024-05-20 18:53:11]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:10ms
  • 内存:4096kb
  • [2023-11-04 06:04:25]
  • 评测
  • 测评结果:0
  • 用时:0ms
  • 内存:0kb
  • [2023-11-04 06:04:25]
  • 提交

speedrun

#include <bits/stdc++.h>
#include "speedrun.h"
//#include "grader.cpp"
using namespace std;


void assignHints(int subtask,int N,int A[],int B[]){
    vector<int> adj[N+1];
    setHintLen(N);
    for(int i = 1;i<N;i++){
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(A[i]);
    }
    for(int i = 1;i<=N;i++){
        for(int j = 0;j<adj[i].size();j++){
            setHint(i,adj[i][j],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

input:


output:


input:


output:


result: