#include "Azer.h"
#include <iostream>
#include <vector>
#include <set>
#include <tuple>
#define pi pair<int, int>
#define vi vector<int>
using namespace std;
namespace {
const int inf = (1<<25);
const int maxn = 1<<11;
int N, cur = 0;
vi dist;
vector<vector<pi>> adj;
vi arr;
int cnt;
void dijkstra(int s, vector<vector<pi>>& adj) {
multiset<pi> st;
dist[s] = 0;
st.insert({0, s});
while (!st.empty()) {
int v, d;
tie(d, v) = *st.begin();
st.erase(st.begin());
for (pi p : adj[v]) {
int to, w;
tie(to, w) = p;
if (dist[v] + w > dist[to]) continue;
st.erase({dist[to], to});
dist[to] = dist[v] + w;
st.insert({dist[to], to});
}
}
}
} // namespace
void InitA(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C) {
::N = N;
dist.assign(N, inf);
adj.assign(N, vector<pi>());
arr.clear();
cnt = 0;
for (int i = 0; i < A; i++) {
adj[U[i]].push_back(make_pair(V[i], C[i]));
adj[V[i]].push_back(make_pair(U[i], C[i]));
}
}
void ReceiveA(bool x) {
cur = cur + ((1<<cnt) * x);
cnt++;
if (cnt == 12) {
arr.push_back(cur);
cnt = cur = 0;
}
}
std::vector<int> Answer() {
for (int i = 0; i < arr.size(); i += 3) {
adj[arr[i]].push_back(make_pair(arr[i+1], arr[i+2]));
adj[arr[i+1]].push_back(make_pair(arr[i], arr[i+2]));
}
dijkstra(0, adj);
return dist;
}
#include "Baijan.h"
#include <vector>
using namespace std;
#define vi vector<int>
void sendInt(int x) {
for (int i = 0; i < 12; i++) SendB(x & (1<<i));
}
void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D) {
for (int i = 0; i < B; i++) {
sendInt(S[i]);
sendInt(T[i]);
sendInt(D[i]);
}
}
void ReceiveB(bool y) {
}
