# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44431 | xenoframium | Amusement Park (JOI17_amusement_park) | C++14 | 46 ms | 4336 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 "Joi.h"
#include <bits/stdc++.h>
#define F(i,s,n) for(int i=s;i<n;i++)
#define EB emplace_back
#define G(i,x) get<i>(x)
using namespace std;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long long ll;
typedef vector<ii> vii;
static ll x;
static int vis[10005],cnt;
static vi adj[10005];
static void dfs(int v){
if((1LL<<cnt++%60)&x){
MessageBoard(v,1);
}
else MessageBoard(v,0);
for(int u:adj[v]){
if(!vis[u]){
vis[u]=1;
dfs(u);
}
}
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
x=X;
# | 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... |