| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 37580 | grumpy_gordon | 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 "grader.h"
using namespace std;
void Joi(int N, int M, int A[], int B[], long long X, int T){
for (int i = 0; i < 60; i++)
if ((1ll << i) & X)
MessageBoard(i, 1);
else
MessageBoard(i, 0);
for (int i = 60; i < N; i++)
MessageBoard(i, 0);
}#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int maxn = 1e5 + 100;
int a[maxn];
vector<int> e[maxn];
bool vis[maxn];
void dfs(int v, int val){
vis[v] = 1;
a[v] = val;
for (auto i : e[v])
if (!vis[i]){
dfs(i, Move(i));
Move(v);
}
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T){
dfs(P, V);
long long ret = 0;
for (int i = 0; i < 60; i++)
ret += (1ll << i) * a[i];
return ret;
}