QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#236554	#2810. Speedrun	Ahmed57^#	21	537ms	3944kb	C++23	839b	2023-11-04 05:47:54	2024-06-05 09:14:30

Judging History

你现在查看的是最新测评结果

[2024-06-05 09:14:30]
管理员手动重测本题所有提交记录

测评结果：21
用时：537ms
内存：3944kb

查看

[2024-05-20 18:53:03]
管理员手动重测本题所有提交记录

测评结果：21
用时：488ms
内存：3988kb

查看

[2023-11-04 05:47:55]
评测

测评结果：0
用时：0ms
内存：0kb

查看

[2023-11-04 05:47:54]
提交

speedrun

#include <bits/stdc++.h>
#include "speedrun.h"
using namespace std;
void setHintLen(int l);
void setHint(int i, int j, bool b);
int getLength();
bool getHint(int j);
bool goTo(int x);
vector<int> adj[1001];
void assignHints(int subtask,int N,int A[],int B[]){
    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);
        }
    }
}
int vis[1001];
int n;
void dfs(int i){
    vis[i] = 1;
    for(int j = 1;j<=n;j++){
        if(vis[j])continue;
        if(getHint(j)){
            goTo(j);
            dfs(j);
            goTo(i);
        }
    }
}
void speedrun(int subtask, int N, int start){
    n = N;
    dfs(start);
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 21

Accepted

Test #1:

score: 21

Accepted

time: 416ms

memory: 3888kb

input:

output:

1 1 1000
1 2 1 119 1
1 2 1 453 1
1 2 1 454 1
1 2 2 59 1
1 2 3 113 1
1 2 3 657 1
1 2 3 824 1
1 2 4 494 1
1 2 5 33 1
1 2 5 550 1
1 2 5 937 1
1 2 6 287 1
1 2 7 222 1
1 2 7 577 1
1 2 7 742 1
1 2 8 626 1
1 2 9 896 1
1 2 10 204 1
1 2 11 638 1
1 2 12 305 1
1 2 12 552 1
1 2 12 791 1
1 2 13 246 1
1 2 14 840 ...

input:

output:

result:

ok OK

Test #2:

score: 21

Accepted

time: 410ms

memory: 3896kb

input:

output:

1 1 1000
1 2 1 723 1
1 2 1 992 1
1 2 2 372 1
1 2 2 542 1
1 2 3 692 1
1 2 4 692 1
1 2 5 693 1
1 2 5 807 1
1 2 6 390 1
1 2 6 829 1
1 2 7 692 1
1 2 8 692 1
1 2 9 692 1
1 2 10 692 1
1 2 11 692 1
1 2 12 692 1
1 2 13 692 1
1 2 14 692 1
1 2 15 228 1
1 2 15 844 1
1 2 16 692 1
1 2 17 419 1
1 2 17 663 1
1 2 1...

input:

output:

result:

ok OK

Test #3:

score: 21

Accepted

time: 537ms

memory: 3800kb

input:

output:

1 1 1000
1 2 1 14 1
1 2 1 139 1
1 2 1 817 1
1 2 1 975 1
1 2 2 840 1
1 2 2 993 1
1 2 3 207 1
1 2 4 367 1
1 2 4 847 1
1 2 4 977 1
1 2 5 18 1
1 2 6 9 1
1 2 6 667 1
1 2 7 135 1
1 2 7 389 1
1 2 7 474 1
1 2 7 595 1
1 2 8 296 1
1 2 8 535 1
1 2 9 6 1
1 2 9 970 1
1 2 10 337 1
1 2 11 648 1
1 2 11 899 1
1 2 12...

input:

output:

result:

ok OK

Test #4:

score: 21

Accepted

time: 419ms

memory: 3944kb

input:

output:

1 1 1000
1 2 1 504 1
1 2 1 638 1
1 2 1 792 1
1 2 1 941 1
1 2 2 133 1
1 2 3 664 1
1 2 4 188 1
1 2 4 341 1
1 2 4 685 1
1 2 5 385 1
1 2 5 561 1
1 2 5 881 1
1 2 6 961 1
1 2 7 413 1
1 2 7 584 1
1 2 7 906 1
1 2 7 907 1
1 2 8 662 1
1 2 9 267 1
1 2 9 320 1
1 2 9 606 1
1 2 9 627 1
1 2 10 795 1
1 2 10 926 1
1...

input:

output:

result:

ok OK

Subtask #2:

score: 0

Wrong Answer

Test #5:

score: 0

Wrong Answer

time: 0ms

memory: 3792kb

input:

output:

1 1 1000

input:

output:

result:

wrong answer Solution didn't visit every node

Subtask #3:

score: 0

Wrong Answer

Test #7:

score: 0

Wrong Answer

time: 10ms

memory: 3820kb

input:

output:

1 1 1000

input:

output:

result:

wrong answer Solution didn't visit every node

Subtask #4:

score: 0

Wrong Answer

Test #10:

score: 0

Wrong Answer

time: 8ms

memory: 3852kb

input:

output:

1 1 1000

input:

output:

result:

wrong answer Solution didn't visit every node

Subtask #5:

score: 0

Wrong Answer

Test #16:

score: 0

Wrong Answer

time: 18ms

memory: 3884kb

input:

output:

1 1 1000

input:

output:

result:

wrong answer Solution didn't visit every node