| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 139538 | Mahmoud_Adel | Amusement Park (JOI17_amusement_park) | C++14 | 0 ms | 0 KiB |
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 <bits/stdc++.h>
#include "Joi.h"
#define f first
#define s second
using namespace std;
typedef long long ll;
const int jZ = 1e4+5;
vector<ll> jadj[jZ], jG[jZ];
ll jdisc[jZ], jt[jZ], jcn, n, jrqm, jC = 60;
void jDFS(ll u, ll p)
{
jdisc[u] = jcn;
jt[jcn] = u;
MessageBoard(u, (jrqm>>(jcn%jC))&1);
//cout << u << " " << jadj[u].size() << endl;
jcn++;
for(int v : jadj[u])
{
//cout << v << " " << jdisc[v] << endl;
if(v == p || jdisc[v] != -1) continue;
jDFS(v, u);
}
if(p != -1) jG[u].push_back(p), jG[p].push_back(u);
}
void Joi(int N, int M, int A[], int B[], long long X, int T)
{
memset(jdisc, -1, sizeof jdisc);
n = N, jrqm = X;
for(int i=0; i<M; i++)
{
jadj[A[i]].push_back(B[i]), jadj[B[i]].push_back(A[i]);
}
jDFS(0, -1);
}
#include <bits/stdc++.h>
#include "Ioi.h"
using namespace std;
const int Z = 1e4+5;
vector<ll> adj[Z], G[Z];
ll disc[Z], t[Z], cn, n, f, cur, C = 60, l, r, rqm, msg[Z], sub[Z], par[Z];
void DFS(ll u, ll p)
{
disc[u] = cn;
t[cn] = u;
cn++;
sub[u] = 1;
par[u] = p;
for(int v : adj[u])
{
if(v == p || disc[v] != -1) continue;
DFS(v, u), sub[u] += sub[v];
}
if(p != -1) G[u].push_back(p), G[p].push_back(u);
}
void dfs(int u, int p)
{
if(!C) return ;
C--;
for(int v : G[u])
{
if(v == p || v == par[u]) continue;
msg[v] = Move(v);
dfs(v, u);
Move(u);
}
}
void operate()
{
dfs(cur, par[cur]);
while(C)
{
msg[par[cur]] = Move(par[cur]), C--;
dfs(par[cur], cur);
cur = par[cur];
}
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T)
{
memset(disc, -1, sizeof disc);
memset(msg, -1, sizeof msg);
n = N, cur = P, msg[cur] = V;
for(int i=0; i<M; i++)
adj[A[i]].push_back(B[i]), adj[B[i]].push_back(A[i]);
DFS(0, -1);
// for(int i=0; i<n; i++)
// {
// cout << i << " : ";
// for(int v : G[i]) cout << v << " ";
// cout << endl;
// }
operate();
ll ret = 0;
C = 60;
for(int i=0; i<n; i++)
{
if(msg[i] == -1) continue;
int bit = i%C;
ret |= ((1<<bit)*msg[i]);
//cout << msg[i] << " " << ret << " " << bit << endl;
}
return ret;
}