# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763298 | jmyszka2007 | Amusement Park (JOI17_amusement_park) | C++17 | 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 vi static vector<int>
#define pb push_back
typedef long long ll;
constexpr int LIM = 1e4;
int bit[60];
vi g[LIM + 10];
bool vis[LIM + 10];
static void dfs(int v, int kol) {
vis[v] = 1;
MessageBoard(v, bit[kol % 60]);
for(auto x : g[v]) {
if(!vis[x]) {
dfs(x, kol + 1);
}
}
}
void Joi(int N, int M, int A[], int B[], ll x, int t) {
for(int i = 0; i < 60; i++) {
if(x & (1ll << i)) {
bit[i] = 1;
}
}
for(int i = 0; i < M; i++) {
g[A[i]].pb(B[i]);
g[B[i]].pb(A[i]);
}
dfs(0, 0);
}
#include "Ioi.h"
#include <bits/stdc++.h>
#define vi static vector<int>
typedef long long ll;
constexpr int LIM = 1e4;
vi g2[LIM + 10];
bool vis2[LIM + 10];
int kol2[LIM + 10];
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
return 0;
}