#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
#include "Joi.h"
static int parent[10000];
int find(int n) {
if (parent[n] != n) parent[n] = find(parent[n]);
return parent[n];
}
static vi adjList[10000];
static int key[10000],nxt[10000];
static int message[10000];
static int doDFS(int u,int p) {
int i;
int m = 1,mv = -1;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i];
if (v != p) {
int r = doDFS(v,u);
if (r+1 > m) m = r+1,mv = v;
}
}
nxt[u] = mv;
if (m == 60) {
key[u] = 1;
return 0;
}
else return m;
}
static int num = 0;
static int doDFS2(int u,int p,LLI X) {
int i;
if (num < 60) {
MessageBoard(u,((X & (1LL << num)) > 0));
message[u] = 1;
}
num++;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i];
if (v != p) doDFS2(v,u,X);
}
return 0;
}
void Joi(int N,int M,int A[],int B[],long long int X,int T) {
int i;
for (i = 0; i < N; i++) parent[i] = i;
for (i = 0; i < M; i++) {
int pa = find(A[i]),pb = find(B[i]);
if (pa != pb) {
parent[pa] = pb;
adjList[A[i]].pb(B[i]);
adjList[B[i]].pb(A[i]);
}
}
int j,f = 0;
doDFS(0,-1);
for (i = 0; i < N; i++) {
if (key[i]) {
int u = i;
for (j = 0; j < 60; j++) {
MessageBoard(u,((X & (1LL << j)) > 0));
message[u] = 1;
u = nxt[u];
}
f = 1;
}
}
if (!f) doDFS2(0,-1,X);
for (i = 0; i < N; i++) {
if (!message[i]) MessageBoard(i,0);
}
}
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
#include "Ioi.h"
static int parent[10000];
static int find(int n) {
if (parent[n] != n) parent[n] = find(parent[n]);
return parent[n];
}
static vi adjList[10000];
static int key[10000],nxt[10000];
static int doDFS(int u,int p) {
int i;
int m = 1,mv = -1;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i];
if (v != p) {
int r = doDFS(v,u);
if (r+1 > m) m = r+1,mv = v;
}
}
nxt[u] = mv;
if (m == 60) {
key[u] = 1;
return 0;
}
else return m;
}
static int message[10000];
static queue<int> Q;
static int moveto(int s,int N) {
int i,u;
fill(parent,parent+N,-1);
Q.push(s);
while (!Q.empty()) {
u = Q.front();
Q.pop();
if (key[u]) break;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i];
if ((v != s) && (parent[v] == -1)) {
parent[v] = u;
Q.push(v);
}
}
}
while (!Q.empty()) Q.pop();
vi path;
if (!key[u]) u = 0;
while (u != -1) path.pb(u),u = parent[u];
for(i=0;i<path.size();i++)cout<<path[i]<<endl;
for (i = (int) path.size()-2; i >= 0; i--) message[path[i]] = Move(path[i]);
return path[0];
}
static int num = 0;
static LLI ans = 0;
static int doDFS2(int u,int p) {
int i;
if (num < 60) {
if (message[u]) ans |= (1LL << num);
}
num++;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i];
if (v != p) {
if (num < 60) message[v] = Move(v);
doDFS2(v,u);
if (num < 60) Move(u);
}
}
return 0;
}
long long int Ioi(int N,int M,int A[],int B[],int P,int V,int T) {
int i;
for (i = 0; i < N; i++) parent[i] = i;
for (i = 0; i < M; i++) {
int pa = find(A[i]),pb = find(B[i]);
if (pa != pb) {
parent[pa] = pb;
adjList[A[i]].pb(B[i]);
adjList[B[i]].pb(A[i]);
}
}
doDFS(0,-1);
fill(message,message+N,-1);
message[P] = V;
int d = moveto(P,N);
if (key[d]) {
LLI X = 0;
int u = d;
for (i = 0; i < 60; i++) {
if (message[u]) X |= (1LL << i);
u = nxt[u];
if (i < 59) message[u] = Move(u);
}
return X;
}
else {
doDFS2(0,-1);
return ans;
}
}
Compilation message
Joi.cpp: In function 'int doDFS(int, int)':
Joi.cpp:22:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < adjList[u].size(); i++) {
~~^~~~~~~~~~~~~~~~~~~
Joi.cpp: In function 'int doDFS2(int, int, LLI)':
Joi.cpp:44:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < adjList[u].size(); i++) {
~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp: In function 'int doDFS(int, int)':
Ioi.cpp:21:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < adjList[u].size(); i++) {
~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp: In function 'int moveto(int, int)':
Ioi.cpp:46:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < adjList[u].size(); i++) {
~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp:58:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<path.size();i++)cout<<path[i]<<endl;
~^~~~~~~~~~~~
Ioi.cpp: In function 'int doDFS2(int, int)':
Ioi.cpp:70:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < adjList[u].size(); i++) {
~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
1248 KB |
Do not print anything on standard output. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
31 ms |
3832 KB |
Do not print anything on standard output. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
3864 KB |
Do not print anything on standard output. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
37 ms |
3948 KB |
Do not print anything on standard output. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
41 ms |
4080 KB |
Do not print anything on standard output. |
| 2 |
Halted |
0 ms |
0 KB |
- |
