#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int i_inf = 1e9;
const ll inf = 1e17;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi = 3.14159265359;
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 1e5;
#include "Joi.h"
/*int VAL[mxn];
void MessageBoard(int u, int val){
VAL[u] = val;
return;
}*/
int n, m;
int a[mxn], b[mxn];
bool vis[mxn];
vector<int> g[mxn];
int itopos[mxn];
int temp_p = 0;
void dfs(int u){
itopos[u] = temp_p++;
vis[u] = true;
for(auto e : g[u]){
if(vis[e]) continue;
dfs(e);
}
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
n = N, m = M;
fr(i, 0, m) a[i] = A[i], b[i] = B[i];
fr(i, 0, m){
g[a[i]].pb(b[i]);
g[b[i]].pb(a[i]);
}
dfs(0);
fr(i, 0, n){
if(X&(1LL<<(itopos[i]%60))) MessageBoard(i,1);
else MessageBoard(i,0);
}
}
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int i_inf = 1e9;
const ll inf = 1e17;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi = 3.14159265359;
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 1e5;
#include "Ioi.h"
/*
int mark[60] = {1,1,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int Move(int u){
cout<<u<<endl;
return mark[u];
}*/
int n, m;
int a[mxn], b[mxn];
bool vis[mxn];
vector<int> g[mxn];
int postoi[mxn];
int temp_p = 0;
vector<int> v;
int val[mxn];
int parent[mxn];
void dfs(int u, int p){
parent[u] = p;
postoi[temp_p++] = u;
vis[u] = true;
for(auto e : g[u]){
if(vis[e]) continue;
dfs(e, u);
}
}
void dfs2(int u, int p){
vis[e] = true;
for(auto e : g[u]){
if(vis[e]) continue;
val[e] = Move(e);
dfs2(e, u);
}
Move(parent[u]);
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
n = N, m = M;
fr(i, 0, m) a[i] = A[i], b[i] = B[i];
fr(i, 0, m){
g[a[i]].pb(b[i]);
g[b[i]].pb(a[i]);
}
dfs(0, 0);
while(P != 0)V = Move(parent[P]), P = parent[P];
val[0] = V;
memset(vis, false, sizeof(vis));
dfs2(0, 0);
ll X = 0;
fr(i, 0, 60){
X |= (1LL<<i)*val[postoi[i]];
}
return X;
}
Compilation message
Ioi.cpp: In function 'void dfs2(int, int)':
Ioi.cpp:59:6: error: 'e' was not declared in this scope
vis[e] = true;
^
