#include "speedrun.h"
#include <bits/stdc++.h>
using namespace std;
#define pb emplace_back
int n;
vector<int> adj[2005];
int par[2005];
vector<int> ord;
int c[2005];
void dfs(int x){
ord.pb(x);
for(int i:adj[x]){
if(par[x]==i)continue;
par[i]=x;
dfs(i);
}
}
void assignHints(int subtask, int N, int A[], int B[]) {
n=N;
for(int i=0;i<n-1;i++){
adj[A[i]].pb(B[i]);
adj[B[i]].pb(A[i]);
}
dfs(1);
for(int i=0;i<n-1;i++){
c[ord[i]]=ord[i+1];
}
par[1]=1; c[ord[n-1]]=0;
setHintLen(20);
for(int i=1;i<=n;i++){
for(int j=1;j<=10;j++){
if(par[i]&(1<<(j-1)))setHint(i,j,1);
else setHint(i,j,0);
}
for(int j=11;j<=20;j++){
if(c[i]&(1<<(j-11)))setHint(i,j,1);
else setHint(i,j,0);
}
}
}
int getParent(){
int ans=0;
for(int i=1;i<=10;i++){
ans|=getHint(i)*(1<<(i-1));
}
return ans;
}
int getNext(){
int ans=0;
for(int i=11;i<=20;i++){
ans|=getHint(i)*(1<<(i-11));
}
return ans;
}
void speedrun(int subtask, int N, int start) {
int cur=start;
while(cur!=getParent()&&cur!=1){
int p=getParent();
goTo(p);
cur=p;
}
for(int i=1;i<N;i++){
int nxt=getNext();
while(!goTo(nxt)){
int p=getParent();
goTo(p);
cur=p;
}
cur=nxt;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
164 ms |
788 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
131 ms |
920 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
183 ms |
848 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
140 ms |
804 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
189 ms |
796 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |