# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1118597 |
2024-11-25T18:05:24 Z |
pera |
Speedrun (RMI21_speedrun) |
C++17 |
|
416 ms |
1076 KB |
#include<bits/stdc++.h>
#include "speedrun.h"
using namespace std;
void assignHints(int subtask , int N , int A[] , int B[]){
vector<vector<int>> g(N + 1);
for(int i = 1;i <= N - 1;i ++){
g[A[i]].emplace_back(B[i]);
g[B[i]].emplace_back(A[i]);
}
vector<int> par(N + 1) , o;
function<void(int)> dfs = [&](int u){
o.emplace_back(u);
for(int v : g[u]){
if(v != par[u]){
par[v] = u;
dfs(v);
}
}
};
dfs(1);
setHintLen(20);
for(int i = 1;i <= N;i ++){
for(int bit = 0;bit < 10;bit ++){
setHint(i , bit + 1, par[i] >> bit & 1);
}
for(int bit = 0;bit < 10;bit ++){
setHint(i , bit + 10 + 1 , o[i % N] >> bit & 1);
}
}
}
void speedrun(int subtask , int N , int v){
int c = 0 , nxt = 0;
vector<int> vis(N + 1);
while(c < N){
c += vis[v] == 0;
vis[v] = 1;
if(nxt == 0){
for(int bit = 0;bit < 10;bit ++){
nxt += (1 << bit) * getHint(bit + 10 + 1);
}
}
if(goTo(nxt) == true){
v = nxt;
nxt = 0;
}else{
int par = 0;
for(int bit = 0;bit < 10;bit ++){
par += (1 << bit) * getHint(bit + 1);
}
goTo(par);
v = par;
}
}
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
274 ms |
768 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
416 ms |
952 KB |
Used too many wrong interactions |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
320 ms |
1076 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
316 ms |
692 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
336 ms |
672 KB |
Invalid node index to goTo |
2 |
Halted |
0 ms |
0 KB |
- |