#include "speedrun.h"
#include <iostream>
using namespace std;
void assignHints(int subtask, int N, int A[], int B[]) {
setHintLen(20);
int cen = 0;
if(A[0] == A[1] || A[0] == B[1]) cen = A[0];
else cen = B[0];
for(int i = 0; i < N; i++){
int j = 1;
int temp = cen;
while(temp){
if((temp&-temp) == 1){
setHint(i, j, true);
temp--;
}
temp /= 2; j++;
}
}
}
void speedrun(int subtask, int N, int start) {
int cen = 0;
for(int i = 1; i <= 10; i++){
if(getHint(i)) cen++;
cen *= 2;
}
int left = N - 1;
while(left > 0){
if(start == cen){
while(!goTo(N))N--;
N--;
}
else{
left--;
goTo(cen);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
752 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
756 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
748 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
756 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
748 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |