#include <bits/stdc++.h>
#include "grader.h"
#include "encoder.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;
#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"
const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;
template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }
template<typename T>
void print(vector<T> vec, string name = "") {
cout << name;
for (auto u : vec)
cout << u << ' ';
cout << '\n';
}
void encode(int nv, int nh, int ne, int *v1, int *v2) {
int N = nv;
int H = nh;
int P = ne;
vii edges(N);
vii visos(N);
vii yra(H, vi(N, 0));
for (int i = 0; i < P; ++i)
{
int a = v1[i];
int b = v2[i];
if (a < H or b < H) {
edges[a].emplace_back(b);
edges[b].emplace_back(a);
if (a >= H) swap(a, b);
yra[a][b] = 1;
}
visos[a].emplace_back(b);
visos[b].emplace_back(a);
}
auto encode = [&](int a) {
// printf("encodinu a = %d\n", a);
for (int i = 0; i < 10; ++i)
encode_bit((a >> i) & 1);
};
for (int i = 0; i < H; ++i)
{
for (int j = 0; j < N; ++j)
{
encode_bit(yra[i][j]);
}
}
// do stuff // send edges
vii fast(H, vi(N, MOD));
auto bfs = [&](int start, vi & dis) {
dis = vi(N, MOD);
dis[start] = 0;
queue<int> q;
q.push(start);
while (q.size()) {
int c = q.front(); q.pop();
for (auto u : edges[c]) {
if (dis[c] + 1 < dis[u]) {
dis[u] = dis[c] + 1;
q.push(u);
}
}
}
};
// O(H*N)
auto upd = [&](int prad) {
for (int i = prad; i < H; ++i)
bfs(i, fast[i]);
};
upd(0);
vpi augmeting;
auto add_edge = [&](int a, int b) {
edges[a].emplace_back(b);
edges[b].emplace_back(a);
augmeting.emplace_back(a, b);
};
for (int i = 0; i < H; ++i)
{
queue<int> q;
q.push(i);
while (q.size()) {
int c = q.front(); q.pop();
for (auto u : visos[c]) {
if (fast[i][c] + 1 <= fast[i][u]) {
if (fast[i][c] + 1 < fast[i][u]) add_edge(c, u);
fast[i][u] = fast[i][c] + 1;
q.push(u);
}
}
}
upd(i + 1);
}
augmeting.emplace_back(1011, 1011);
for (auto u : augmeting) {
// printf("encodinau %d %d\n", u.x, u.y);
encode(u.x);
encode(u.y);
}
return;
}
#include <bits/stdc++.h>
#include "grader.h"
#include "decoder.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;
#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"
const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;
template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }
template<typename T>
void print(vector<T> vec, string name = "") {
cout << name;
for (auto u : vec)
cout << u << ' ';
cout << '\n';
}
void decode(int nv, int nh) {
int N = nv;
int H = nh;
auto decode = [&]() -> int {
int ret = 0;
for (int i = 0; i < 10; ++i)
{
ret |= (decode_bit() << i);
}
// printf("decodinu %d\n", ret);
return ret;
};
vii edges(N);
for (int i = 0; i < H; ++i)
{
for (int j = 0; j < N; ++j)
{
if (decode_bit()) {
edges[i].emplace_back(j);
edges[j].emplace_back(i);
}
}
}
{
int a = decode();
int b = decode();
while (a != 1011) {
edges[a].emplace_back(b);
edges[b].emplace_back(a);
a = decode();
b = decode();
};
}
for (int i = 0; i < H; ++i)
{
vi dis(N, MOD);
dis[i] = 0;
queue<int> q;
q.push(i);
while (q.size()) {
int c = q.front(); q.pop();
for (auto u : edges[c]) {
if (dis[c] + 1 < dis[u]) {
dis[u] = dis[c] + 1;
q.push(u);
}
}
}
for (int j = 0; j < N; ++j)
{
hops(i, j, dis[j]);
}
}
}
