#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
#endif
#include "Azer.h"
namespace X {
int n,m,i,j,k,t,t1,u,v,a,b;
int phase,action,cnt,buf;
vector<pii(int)> gt[2001];
int dis[2001];
int locked[2001];
int latest;
int sending;
} // namespace
using namespace X;
void initPhaseA() {
phase++;
// cout<<"initA "<<phase<<' '<<n<<endl;
if (phase>n) return;
u=-1;
for (i=0;i<n;i++) if (!locked[i]) {
if (u==-1) u=i;
else if (dis[u]>dis[i]) u=i;
}
sending=min(511,dis[u]-latest);
// cout<<"claimA: "<<u<<' '<<dis[u]<<' '<<latest<<endl;
for (j=8;j>=0;j--) SendA(((sending&(1<<j))>>j));
action=0;
cnt=1;
buf=0;
}
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
std::vector<int> C) {
n=N;
m=A;
for (i=0;i<m;i++) {
gt[U[i]].push_back({V[i],C[i]});
gt[V[i]].push_back({U[i],C[i]});
}
for (i=0;i<n;i++) {
locked[i]=0;
dis[i]=1e6+1;
}
dis[0]=0;
initPhaseA();
}
void updateA(int i) {
// cout<<"updateA "<<i<<' '<<dis[i]<<endl;
for (auto g : gt[i]) {
dis[g.fi]=min(dis[g.fi],dis[i]+g.se);
}
locked[i]=1;
latest=dis[i];
}
void check_B_res() {
// cout<<"check_B_res "<<phase<<endl;
if (buf==1) {
// cout<<u<<endl;
for (j=10;j>=0;j--) SendA(((u&(1<<j))>>j));
updateA(u);
initPhaseA();
} else {
action=1;
buf=0;
cnt=20;
}
}
void get_B_res() {
// cout<<"get_B_res "<<phase<<endl;
u=buf&((1<<11)-1);
v=(buf>>11)+latest;
dis[u]=v;
updateA(u);
initPhaseA();
}
void ReceiveA(bool x) {
buf<<=1;
buf^=x;
cnt--;
if (cnt==0) {
if (action==0) {
check_B_res();
} else {
get_B_res();
}
}
}
std::vector<int> Answer() {
vector<int> res;
for (i=0;i<n;i++) res.push_back(dis[i]);
return res;
}
// nN;asdfasdasd;
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
#endif
#include "Baijan.h"
namespace Y {
int n,m,i,j,k,t,t1,u,v,a,b;
int phase,action,cnt,buf;
vector<pii(int)> gt[2001];
int dis[2001],locked[2001];
int latest;
int sending;
} // namespace
using namespace Y;
void initPhaseB() {
phase++;
// cout<<"initB "<<phase<<' '<<n<<endl;
if (phase>n) return;
action=0;
buf=0;
cnt=9;
}
void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
std::vector<int> D) {
n=N;
m=B;
for (i=0;i<m;i++) {
gt[S[i]].push_back({T[i],D[i]});
gt[T[i]].push_back({S[i],D[i]});
}
for (i=0;i<n;i++) {
locked[i]=0;
dis[i]=1e6+1;
}
dis[0]=0;
initPhaseB();
}
void updateB(int i) {
// cout<<"updateB "<<i<<' '<<dis[i]<<endl;
for (auto g : gt[i]) {
dis[g.fi]=min(dis[g.fi],dis[i]+g.se);
}
locked[i]=1;
latest=dis[i];
}
void check_A_res() {
// cout<<"check_A_res "<<phase<<endl;
u=-1;
for (i=0;i<n;i++) if (!locked[i]) {
if (u==-1) u=i;
else if (dis[u]>dis[i]) u=i;
}
sending=min(511,dis[u]-latest);
// cout<<"claimB: "<<u<<' '<<dis[u]<<' '<<latest<<endl;
// cout<<"received: "<<buf<<endl;
if (sending>=buf) {
v=latest+buf;
SendB(1);
action = 1;
buf=0;
cnt=11;
} else {
SendB(0);
for (j=8;j>=0;j--) SendB(((sending&(1<<j))>>j));
for (j=10;j>=0;j--) SendB(((u&(1<<j))>>j));
updateB(u);
initPhaseB();
}
}
void get_A_res() {
// cout<<"get_A_res "<<phase<<endl;
u=buf;
dis[u]=v;
updateB(u);
initPhaseB();
}
void ReceiveB(bool y) {
buf<<=1;
buf^=y;
cnt--;
// cout<<buf<<endl;
if (cnt==0) {
if (action==0) {
check_A_res();
} else {
get_A_res();
}
}
}
// N;
