#include <bits/stdc++.h>
#include "speedrun.h"
using namespace std;
vector<vector<int>> adj;
/**
int nod_curent=1;
bool hinturi[100][21];
void setHintLen (int l){
//cout<<"lungimea hinturilor e "<<l<<"\n";
return;
}
void setHint(int i, int j, bool b){
hinturi[i][j]=b;
return;
}
bool getHint(int j){
///cout<<"hint["<<nod_curent<<"]["<<j<<"]="<<hinturi[nod_curent][j]<<"\n";
return hinturi[nod_curent][j];
}
bool goTo(int x){
//cout<<"e la "<<nod_curent<<" goTo("<<x<<")=";
for(int i=0;i<adj[nod_curent].size();i++){
if(adj[nod_curent][i]==x){
nod_curent=x;
//cout<<"1\n";
return 1;
}
}
//cout<<"0\n";
return 0;
}
**/
int visited[1005];
int parent[1005];
int nxt[1005];
int n,ult_nod=1;
int hint(int nod){
///cout<<nod<<" are parent="<<parent[nod]<<" si nxt="<<nxt[nod]<<"\n";
int poz=1;
while(parent[nod]>0){
setHint(nod, poz, parent[nod]&1);
parent[nod]/=2;
poz++;
}
poz=11;
while(nxt[nod]>0){
setHint(nod, poz, nxt[nod]&1);
nxt[nod]>>=1;
poz++;
}
}
void dfs(int nod){
for(int i=0;i<adj[nod].size();i++){
if(!visited[adj[nod][i]]){
visited[adj[nod][i]]=1;
nxt[ult_nod]=adj[nod][i];
ult_nod=adj[nod][i];
parent[adj[nod][i]]=nod;
dfs(adj[nod][i]);
}
}
}
void assignHints (int subtask , int N, int a[], int b[]){
n=N;
setHintLen(20);
adj.resize(n+5);
for(int i=1;i<n;i++){
adj[a[i]].push_back(b[i]);
adj[b[i]].push_back(a[i]);
}
ult_nod=1;
visited[1]=1;
dfs(1);
nxt[ult_nod]=0;
for(int i=1;i<=n;i++){
hint(i);
}
return;
}
void speedrun(int subtask , int N, int nod ){
int nr;
while(nod!=1){
nr=0;
for(int i=10;i>=1;i--){
nr=nr*2+getHint(i);
}
nod=nr;
goTo(nr);
}
///cout<<"e la nodul 1\n";
int nxt=1;
while(1){
if(nxt==nod){
///cout<<"a ajuns la "<<nxt;
nr=0;
for(int j=20;j>=11;j--){
nr=nr*2+getHint(j);
}
///cout<<"nxt="<<nr<<"\n";
nxt=nr;
///cout<<" acum nxt="<<nxt<<"\n";
if(nxt==0)return;
}
///cout<<"incearca nxt\n";
if(goTo(nxt)){
nod=nxt;
}
else{
nr=0;
for(int j=10;j>=1;j--){
nr=nr*2+getHint(j);
}
nod=nr;
goTo(nr);
}
}
}
/**
int main(){
int A[5]={0, 1, 2, 3, 3};
int B[5]={0, 2, 3, 4, 5};
assignHints(1,5,A,B);
nod_curent=1;
//assignHints (1,5,{-, 1, 2, 3, 3},{-, 2, 3, 4, 5});
speedrun(1,5,1);
return 0;
}
**/
Compilation message
speedrun.cpp: In function 'int hint(int)':
speedrun.cpp:54:1: warning: no return statement in function returning non-void [-Wreturn-type]
54 | }
| ^
speedrun.cpp: In function 'void dfs(int)':
speedrun.cpp:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | for(int i=0;i<adj[nod].size();i++){
| ~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
480 KB |
Invalid bit index for setHint |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
488 KB |
Invalid bit index for setHint |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
600 KB |
Invalid bit index for setHint |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
488 KB |
Invalid bit index for setHint |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
480 KB |
Invalid bit index for setHint |
| 2 |
Halted |
0 ms |
0 KB |
- |
