#include <bits/stdc++.h>
//#include "speedrun.h"
#define bug(a) std::cerr << "(" << #a << ": " << a << ")\n";
#define all(x) x.begin(),x.end()
#define pb push_back
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);
///////////////////////
void assignHints (int subtask , int n, int a[], int b[])
{
vector<vector<int>>g(n+1);
setHintLen(20);
for(int i=1;i<n;i++)
{
g[a[i]].pb(b[i]);
g[b[i]].pb(a[i]);
}
vector<int>nodes;
function<void(int,int)>dfs=[&](int x,int tt)
{
for(int i=0;i<10;i++)
{
if(tt&(1<<i))
setHint(x,i,1);
}
nodes.pb(x);
for(auto &c:g[x])
{
if(c!=tt)
dfs(c,x);
}
};
dfs(1,0);
nodes.pb(0);
for(int i=1;i<=n;i++)
{
for(int j=0;j<10;j++)
{
if(nodes[i]&(1<<j));
//setHint(nodes[i-1],j+10,1);
}
}
}
void speedrun(int subtask , int n, int x )
{
auto tata=[&]()->int
{
int sol=0;
for(int i=0;i<10;i++)
{
if(getHint(i))
{
sol|=(1<<i);
}
}
return sol;
};
auto next=[&]()->int
{
int sol=0;
for(int i=0;i<10;i++)
{
if(getHint(i+10))
{
sol|=(1<<i);
}
}
return sol;
};
while(x!=1)
{
x=tata();
goTo(x);
}
for(int i=1;i<n;i++)
{
int urm=next();
while(!goTo(urm))
{
goTo(tata());
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
504 KB |
Invalid bit index for setHint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
508 KB |
Invalid bit index for setHint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
504 KB |
Invalid bit index for setHint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
508 KB |
Invalid bit index for setHint |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
508 KB |
Invalid bit index for setHint |
2 |
Halted |
0 ms |
0 KB |
- |