This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=10005;
vector<int> adj[MX];
int timer=-1;
vector<int> euler;
int sz[MX], par[MX], tin[MX], tout[MX];
struct DSU {
int par[MX];
int find(int v) {
return par[v]==v?v:par[v]=find(par[v]);
}
bool merge(int u, int v) {
u=find(u),v=find(v);
if(u==v) return false;
par[u]=v;
return true;
}
void prep(int N) {
for(int i=0;i<N;i++) par[i]=i;
}
} DS;
void dfs(int v, int p) {
tin[v]=++timer;
euler.push_back(v);
sz[v]=1;
par[v]=p;
for(auto u:adj[v]) {
if(u==p) continue;
dfs(u,v);
sz[v]+=sz[u];
}
tout[v]=timer;
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
DS.prep(N);
for(int i=0;i<M;i++) {
int x=A[i],y=B[i];
if(DS.merge(x,y)) {
adj[x].push_back(y);
adj[y].push_back(x);
}
}
dfs(0,-1);
for(int i=0;i<N;i++) {
sort(adj[i].begin(),adj[i].end(),[&](int i, int j) {
return sz[i]<sz[j];
});
}
euler.clear();
timer=-1;
dfs(0,-1);
for(int i=0;i<N;i++) {
int k=i%60;
MessageBoard(euler[i],X>>k&1);
}
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=10005;
vector<int> adj[MX];
int timer=-1;
vector<int> euler;
int sz[MX], par[MX], tin[MX], tout[MX];
void dfs(int v, int p) {
tin[v]=++timer;
euler.push_back(v);
sz[v]=1;
par[v]=p;
for(auto u:adj[v]) {
if(u==p) continue;
dfs(u,v);
sz[v]+=sz[u];
}
tout[v]=timer;
}
ll get(int x, int y) {
return y*(1LL<<(tin[x]%60));
}
ll res=0, cnt=0;
bool vis[60];
void dfs0(int v, int p) {
if(cnt==60) return;
for(auto u:adj[v]) {
if(u==p) continue;
if(!vis[tin[u]%60]) cnt++;
vis[tin[u]%60]=1;
res|=get(u,Move(u));
dfs0(u,v);
if(cnt==60) return;
Move(v);
}
}
struct DSU {
int par[MX];
int find(int v) {
return par[v]==v?v:par[v]=find(par[v]);
}
bool merge(int u, int v) {
u=find(u),v=find(v);
if(u==v) return false;
par[u]=v;
return true;
}
void prep(int N) {
for(int i=0;i<N;i++) par[i]=i;
}
} ds;
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
ds.prep(N);
for(int i=0;i<M;i++) {
int x=A[i],y=B[i];
if(ds.merge(x,y)) {
adj[x].push_back(y);
adj[y].push_back(x);
}
}
dfs(0,-1);
for(int i=0;i<N;i++) {
sort(adj[i].begin(),adj[i].end(),[&](int i, int j) {
return sz[i]<sz[j];
});
}
euler.clear();
timer=-1;
dfs(0,-1);
int k=V;
while(sz[P]<60) {
P=par[P];
k=Move(P);
}
res|=get(P,k);
cnt++;
vis[tin[P]%60]=1;
dfs0(P,par[P]);
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |