#include "Joi.h"
#include <bits/stdc++.h>
#pragma optimize("Ofast")
#pragma target("avx2")
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
// #define int ll
const int MAX=1e4+15;
const int B=500;
const int maxB=1000;
const int N=104;
const int block=450;
const ll inf=1e9;
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;
int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
int binpow(int a,int n){
if(!n)return 1;
if(n%2==1)return a*binpow(a,n-1)%mod;
int k=binpow(a,n/2);
return k*k%mod;
}
struct JOIKUN{
vector<int> g[MAX];
vector<int> g1[MAX];
int use[MAX];
int d[MAX],root=0;
int cnt=0;
void dfs(int v){
use[v]=1;
for(auto to:g[v]){
if(!use[to]){
cnt++;
d[to]=d[v]+1;
g1[v].pb(to);
g1[to].pb(v);
dfs(to);
}
}
}
int mxD=0;
int D[MAX];
void dfs1(int v,int p=-1){
mxD=max(mxD,d[v]+1);
for(auto to:g1[v]){
if(to==p)continue;
d[to]=d[v]+1;
dfs1(to,v);
}
}
void calc(int v,int p=-1){
D[v]=v;
for(auto to:g1[v]){
if(to==p)continue;
calc(to,v);
if(d[D[v]]<d[D[to]])D[v]=D[to];
}
}
int bit(ll i,int j){
return (i>>j)&1;
}
vector<int> top;
void topsort(int v,int p=-1){
top.pb(v);
for(auto to:g[v]){
if(to==p)continue;
topsort(to,v);
}
}
void solve(int N,int M,int A[],int B[],ll X,int T){
for(int i=0;i<M;i++){
g[A[i]].pb(B[i]);
g[B[i]].pb(A[i]);
}
dfs(0);
assert(cnt==n-1);
for(int i=0;i<N;i++){
use[i]=0;
if(d[i]>d[root])root=i;
}
d[root]=0;
dfs1(root);
calc(root);
if(mxD>=60){
for(int i=0;i<N;i++){
MessageBoard(i,bit(X,d[i]%60));
}
return;
}
topsort(root);
for(int i=0;i<N;i++){
MessageBoard(top[i],bit(X,i%60));
}
}
}t;
void Joi(int N, int M, int A[], int B[], long long X, int T) {
t.solve(N,M,A,B,X,T);
}
#include "Ioi.h"
#include <bits/stdc++.h>
#pragma optimize("Ofast")
#pragma target("avx2")
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
// #define int ll
const int MAX=1e4+15;
const int B=500;
const int maxB=1000;
const int N=104;
const int block=450;
const ll inf=1e9;
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;
struct IOICHAN{
ll ans=0;
set<pii> st;
vector<int> g[MAX];
vector<int> g1[MAX];
int use[MAX];
int d[MAX],root;
int pr[MAX];
int cnt=0;
void dfs(int v){
use[v]=1;
for(auto to:g[v]){
if(!use[to]){
d[to]=d[v]+1;
cnt++;
g1[v].pb(to);
g1[to].pb(v);
st.in({to,v});
st.in({v,to});
dfs(to);
}
}
}
int mxD=0;
int D[MAX];
int big[MAX];
void dfs1(int v,int p=-1){
pr[v]=p;
mxD=max(mxD,d[v]+1);
for(auto to:g1[v]){
if(to==p)continue;
d[to]=d[v]+1;
dfs1(to,v);
}
}
void calc(int v,int p=-1){
D[v]=v;
big[v]=-1;
for(auto to:g1[v]){
if(to==p)continue;
calc(to,v);
if(d[D[v]]<d[D[to]]){
D[v]=D[to];
big[v]=to;
}
}
}
int bit(ll i,int j){
return (i>>j)&1;
}
vector<int> top;
void topsort(int v,int p=-1){
top.pb(v);
for(auto to:g[v]){
if(to==p)continue;
topsort(to,v);
}
}
ll solve(int N,int M,int A[],int B[],int P,int V,int T){
for(int i=0;i<M;i++){
g[A[i]].pb(B[i]);
g[B[i]].pb(A[i]);
}
dfs(0);
assert(cnt==n-1);
for(int i=0;i<N;i++){
use[i]=0;
if(d[i]>d[root])root=i;
}
d[root]=0;
dfs1(root);
calc(root);
// cout<<mxD<<"\n";
if(mxD+1>=60){
while(d[P]%60!=0||d[D[P]]-d[P]<59){
V=Move(pr[P]);
P=pr[P];
}
ans+=V*(1ll<<0);
for(int i=1;i<60;i++){
V=Move(big[P]);
P=big[P];
ans+=V*(1ll<<i);
}
return ans;
}
topsort(root);
while(P!=root){
V=Move(pr[P]);
P=pr[P];
}
ans+=V*(1ll<<0);
for(int i=1;i<60;i++){
int L=top[i];
int cnt=0;
while(P!=L){
cnt++;
if(cnt>60){
return -1;
}
if(st.count({P,L})){
V=Move(L);
P=L;
}
else{
V=Move(pr[P]);
P=pr[P];
}
}
ans+=V*(1ll<<i);
}
return ans;
}
}g;
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
return g.solve(N,M,A,B,P,V,T);
}
Compilation message
Joi.cpp:5: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
5 | #pragma optimize("Ofast")
|
Joi.cpp:6: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
6 | #pragma target("avx2")
|
In file included from /usr/include/c++/10/cassert:44,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
from Joi.cpp:3:
Joi.cpp: In member function 'void JOIKUN::solve(int, int, int*, int*, long long int, int)':
Joi.cpp:109:17: error: 'n' was not declared in this scope
109 | assert(cnt==n-1);
| ^
Ioi.cpp:5: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
5 | #pragma optimize("Ofast")
|
Ioi.cpp:6: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
6 | #pragma target("avx2")
|
In file included from /usr/include/c++/10/cassert:44,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
from Ioi.cpp:3:
Ioi.cpp: In member function 'long long int IOICHAN::solve(int, int, int*, int*, int, int, int)':
Ioi.cpp:113:17: error: 'n' was not declared in this scope
113 | assert(cnt==n-1);
| ^
