#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
static int N, M, *A, *B;
static vector<pii> E;
void Alice(int _N, int _M, int _A[], int _B[])
{
N=_N; M=_M; A=_A; B=_B;
for(int i=0; i<M; i++)
{
int u=A[i]+1, v=B[i]+1;
E.push_back({u, v});
}
for(int i=0; i<7; i++)
{
for(int j=1; j<=N; j++)
{
int now=j;
for(int k=0; k<i; k++) now/=3;
if(now%3==1) E.push_back({N+i+1, j});
else if(now%3==2) E.push_back({j, N+i+1});
}
}
for(int i=0; i<2; i++)
{
for(int j=1; j<=7; j++)
{
int now=j;
for(int k=0; k<i; k++) now/=3;
if(now%3==1) E.push_back({N+i+8, N+j});
else if(now%3==2) E.push_back({N+j, N+i+8});
}
}
E.push_back({N+10, N+8});
E.push_back({N+9, N+10});
for(int i=1; i<=N+9; i++)
{
E.push_back({0, i});
E.push_back({N+11, i});
}
E.push_back({0, N+11});
InitG(N+12, E.size());
for(int i=0; i<E.size(); i++) MakeG(i, E[i].first, E[i].second);
}
#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
static const int MAXN = 1500;
static int V, U, *C, *D;
static vector<int> adj[MAXN+10];
static vector<int> radj[MAXN+10];
static int N, deg[MAXN+10], A[MAXN+10], B[MAXN+10];
static vector<pii> E;
static bool vis[MAXN+10];
static const int POW[10] = {1, 3, 9, 27, 81, 243, 729};
void Bob(int _V, int _U, int _C[], int _D[])
{
V=_V; U=_U; C=_C; D=_D; N=V-12;
for(int i=0; i<U; i++)
{
int u=C[i], v=D[i];
adj[u].push_back(v);
radj[v].push_back(u);
deg[u]++; deg[v]++;
}
int P, Q, R;
for(int i=0; i<V; i++) if(deg[i]==2) { P=i; break; }
for(int i=0; i<V; i++) if(deg[i]==N+10) vis[i]=1;
Q=adj[P].front(); R=radj[P].front();
assert(adj[P].size()==1); assert(radj[P].size()==1)
vis[P]=1; vis[Q]=1; vis[R]=1;
vector<int> V;
for(auto it : adj[Q])
{
if(vis[it]) continue;
V.push_back(it);
A[it]+=1;
}
for(auto it : radj[Q])
{
if(vis[it]) continue;
V.push_back(it);
A[it]+=2;
}
for(auto it : adj[R])
{
if(vis[it]) continue;
V.push_back(it);
A[it]+=3;
}
for(auto it : radj[R])
{
if(vis[it]) continue;
V.push_back(it);
A[it]+=6;
}
sort(V.begin(), V.end());
V.erase(unique(V.begin(), V.end()), V.end());
if(V.size()!=7) while(1);
for(auto it : V)
{
vis[it]=1;
B[A[it]-1]=it;
}
V.clear();
for(int i=0; i<7; i++)
{
for(auto it : adj[B[i]])
{
if(vis[it]) continue;
V.push_back(it);
A[it]+=POW[i];
}
for(auto it : radj[B[i]])
{
if(vis[it]) continue;
V.push_back(it);
A[it]+=POW[i]*2;
}
}
sort(V.begin(), V.end());
V.erase(unique(V.begin(), V.end()), V.end());
if(V.size()!=N) while(1);
for(auto now : V)
{
for(auto nxt : adj[now])
{
if(vis[nxt]) continue;
E.push_back({A[now], A[nxt]});
}
}
InitMap(N, E.size());
for(auto it : E) MakeMap(it.first-1, it.second-1);
}
Compilation message
Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:55:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<E.size(); i++) MakeG(i, E[i].first, E[i].second);
~^~~~~~~~~
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:35:2: error: expected ';' before 'vis'
vis[P]=1; vis[Q]=1; vis[R]=1;
^~~
Bob.cpp:91:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(V.size()!=N) while(1);
~~~~~~~~^~~
