# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
298175 | pit4h | Amusement Park (JOI17_amusement_park) | C++14 | 43 ms | 7292 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>
using namespace std;
using ll = long long;
const int _N = 1e4+1, _B = 60;
vector<int> g[_N];
bool vis[_N];
int dep[_N], par[_N], subt[_N];
vector<int> roots;
ll X;
void dfs(int x) {
vis[x] = 1;
subt[x] = 1;
for(int i: g[x]) {
if(!vis[i]) {
par[i] = x;
dep[i] = dep[x]+1;
dfs(i);
subt[x] += subt[i];
}
}
if(dep[x]%_B==0 && subt[x] >= _B) {
roots.push_back(x);
}
}
void set_board(int x, int &bit) {
vis[x] = 1;
if((X&(1LL<<bit))>0) {
MessageBoard(x, 1);
}
# | 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... |