#include<bits/stdc++.h> #include "grader.h" #include "encoder.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() void encode(int N,int H,int P,int *A,int *B){ vector<int>adj[N]; for(int i=0;i<P;i++){ adj[A[i]].pb(B[i]); adj[B[i]].pb(A[i]); } pair<int,int>d[N]; for(int i=0;i<H;i++){ for(int j=0;j<N;j++){ d[i]={-1,j}; } queue<int>q; d[i].ff=0; q.push(i); while(!q.empty()){ int x=q.front(); q.pop(); for(auto y:adj[x]){ if(d[y].ff==-1){ d[y].ff=d[x].ff+1; q.push(y); } } } sort(d,d+N); for(int j=1;j<N;j++){ if(d[j].ff==d[j-1].ff){ encode_bit(0); } else{ encode_bit(1); } for(int k=0;k<10;k++){ encode_bit(d[j].ss%2); d[j].ss/=2; } } } }

#include<bits/stdc++.h> #include "grader.h" #include "decoder.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() void decode(int N,int H){ for(int i=0;i<H;i++){ hops(i,i,0); int dist=0; for(int j=1;j<N;j++){ int city=0; for(int k=0;k<10;k++){ city+=decode_bit()*(1<<k); } hops(i,city,dist); } } }