#include "grader.h"
#include "encoder.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
namespace {
vector<int> v[1005],g[1005];
int dist[1005];
void send(int x){
REP(i,10){
encode_bit((x>>(9-i))&1);
}
}
}
void encode(int nv, int nh, int ne, int *v1, int *v2){
REP(i,ne){
v[v1[i]].pb(v2[i]);
v[v2[i]].pb(v1[i]);
}
vector<pii> eds;
REP(i,nh){
REP(j,nv) dist[j]=1e9;
dist[i]=0;
queue<int> q;
q.push(i);
while(sz(q)){
int z=q.front();
q.pop();
for(int x:v[z]){
if(dist[x]>dist[z]+1){
g[z].pb(x);
dist[x]=dist[z]+1;
q.push(x);
}
}
}
}
REP(i,nv){
SORT_UNIQUE(g[i]);
send(sz(g[i]));
for(int x:g[i]) send(x);
}
}
#include "grader.h"
#include "decoder.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
namespace {
int get(){
int x=0;
REP(i,10){
x=x*2+decode_bit();
}
return x;
}
vector<int> v[1005];
int dist[1005];
}
void decode(int nv, int nh) {
REP(i,nv){
int a=get();
REP(j,a) v[i].pb(get());
}
REP(i,nh){
REP(j,nv) dist[j]=1e9;
dist[i]=0;
queue<int> q;
q.push(i);
while(sz(q)){
int z=q.front();
q.pop();
for(int x:v[z]){
if(dist[x]>dist[z]+1){
dist[x]=dist[z]+1;
q.push(x);
}
}
}
REP(j,nv) hops(i,j,dist[j]);
}
}
