QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #777285 | #2810. Speedrun | linusvdv# | 0 | 3ms | 3932kb | C++14 | 1.7kb | 2024-11-24 00:19:58 | 2024-11-24 00:20:00 |
speedrun
#include "speedrun.h"
#include <cstdlib>
#include <vector>
void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
if (subtask==1 && false) {
setHintLen(N);
for (int i = 1; i < N; i++) {
setHint(A[i], B[i], true);
setHint(B[i], A[i], true);
}
}
if (subtask==2 && true) {
setHintLen(5);
std::vector<int> num(N+1, 0);
for (int i = 1; i < N; i++) {
num[A[i]]++;
num[B[i]]++;
}
for (int i = 1; i <= N; i++) {
if (num[i] > 1) {
setHint(i, 1, true);
}
}
if (N <= 2) {
setHint(1, 1, true);
}
}
}
void SolveRec(std::vector<bool>& visited, int current, int last, int N) {
visited[current] = true;
for (int i = 1; i <= N; i++) {
if (visited[i]) {
continue;
}
if(getHint(i)) {
if(!goTo(i)) {
exit(-1);
}
SolveRec(visited, i, current, N);
}
}
if (last != -1) {
if(!goTo(last)) {
exit(-1);
}
}
}
void speedrun(int subtask, int N, int start) { /* your solution here */
if (subtask==1 && false) {
std::vector<bool> visited(N+1, false);
getLength();
SolveRec(visited, start, -1, N);
}
if (subtask==2 && true) {
int center = -1;
getLength();
for (int i = 1; i <= N; i++) {
goTo(i);
if(getHint(1)) {
center = i;
continue;
}
}
for (int i = 1; i <= N; i++) {
goTo(i);
goTo(center);
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Interactor2 Runtime Error
Test #1:
score: 0
Interactor2 Runtime Error
input:
1 1 1000 1 119 1 453 1 454 2 59 3 113 3 657 3 824 4 494 5 33 5 550 5 937 6 287 7 222 7 577 7 742 8 626 9 896 10 204 11 638 12 305 12 552 12 791 13 246 14 840 15 95 15 316 15 772 16 109 16 551 16 846 17 581 18 142 19 601 19 744 19 977 20 361 20 404 20 845 21 245 21 410 21 518 22 351 23 971 24 497 24 ...
output:
input:
output:
result:
Subtask #2:
score: 0
Wrong Answer
Test #5:
score: 0
Wrong Answer
time: 3ms
memory: 3772kb
input:
1 2 1000 1 133 2 133 3 133 4 133 5 133 6 133 7 133 8 133 9 133 10 133 11 133 12 133 13 133 14 133 15 133 16 133 17 133 18 133 19 133 20 133 21 133 22 133 23 133 24 133 25 133 26 133 27 133 28 133 29 133 30 133 31 133 32 133 33 133 34 133 35 133 36 133 37 133 38 133 39 133 40 133 41 133 42 133 43 133...
output:
1 1 5 1 2 133 1 1
input:
2 2 1000 651 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
2 1 2 3 1 2 2 1 2 3 2 2 2 1 2 3 3 2 2 1 2 3 4 2 2 1 2 3 5 2 2 1 2 3 6 2 2 1 2 3 7 2 2 1 2 3 8 2 2 1 2 3 9 2 2 1 2 3 10 2 2 1 2 3 11 2 2 1 2 3 12 2 2 1 2 3 13 2 2 1 2 3 14 2 2 1 2 3 15 2 2 1 2 3 16 2 2 1 2 3 17 2 2 1 2 3 18 2 2 1 2 3 19 2 2 1 2 3 20 2 2 1 2 3 21 2 2 1 2 3 22 2 2 1 2 3 23 2 2 1 2 3 24...
result:
wrong answer Solution didn't visit every node
Subtask #3:
score: 0
Wrong Answer
Test #7:
score: 0
Wrong Answer
time: 1ms
memory: 3664kb
input:
1 3 1000 1 20 1 569 2 69 2 72 3 510 3 811 4 278 4 994 5 890 5 918 6 97 6 577 7 11 7 791 8 138 8 653 9 219 9 539 10 22 10 151 11 527 12 195 12 420 13 187 13 293 14 265 14 476 15 594 15 988 16 424 16 881 17 407 17 613 18 178 18 471 19 400 19 896 20 95 21 221 21 949 22 624 23 247 23 361 24 140 24 169 2...
output:
input:
2 3 1000 986
output:
result:
wrong answer Solution didn't visit every node
Subtask #4:
score: 0
Wrong Answer
Test #10:
score: 0
Wrong Answer
time: 1ms
memory: 3932kb
input:
1 4 1000 1 103 1 881 2 195 2 740 3 224 4 558 5 749 5 788 6 189 7 221 8 362 9 267 9 547 10 205 10 813 10 926 11 23 12 687 13 225 14 366 14 768 15 58 15 156 15 869 16 79 16 225 17 61 17 437 18 500 18 534 18 768 18 989 19 300 20 909 21 970 22 245 22 425 23 528 23 669 23 809 23 890 24 121 24 778 25 845 ...
output:
input:
2 4 1000 196
output:
result:
wrong answer Solution didn't visit every node
Subtask #5:
score: 0
Wrong Answer
Test #16:
score: 0
Wrong Answer
time: 1ms
memory: 3700kb
input:
1 5 1000 1 296 1 974 2 414 3 777 4 158 4 918 5 535 5 799 5 952 6 290 7 17 7 420 8 223 9 600 10 743 11 189 11 239 11 530 11 619 12 27 12 451 13 580 14 165 15 552 15 753 16 883 16 936 17 292 17 398 17 904 18 355 18 678 19 807 20 577 21 392 21 744 22 600 23 582 23 717 23 915 24 70 24 254 24 492 25 115 ...
output:
input:
2 5 1000 274
output:
result:
wrong answer Solution didn't visit every node