# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97190 | maruii | Snowy Roads (JOI16_snowy) | C++14 | 30 ms | 1932 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 "Anyalib.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
static vector<int> edge[500];
static int A[500], B[500], prt[500], dth[500], c[500], N, piv;
static void dfs(int x){
for(auto &i: edge[x]){
if(prt[x]==i) continue;
prt[i] = x;
dth[i] = dth[x]+1;
dfs(i);
}
}
static int dfs2(int x){
int ret = 1;
for(auto &i: edge[x]){
if(prt[x]==i) continue;
c[i] += c[x];
ret = max(ret, dfs2(i)%12+1);
}
if(!x || ret%12 == 0) for(int i=0; i<9; ++i) Save(piv++, (c[x]>>i) & 1);
return ret;
}
void InitAnya(int N_ , int AA[] , int BB[]) {
N = N_;
for(int i=0; i<N; ++i) edge[i].clear();
for(int i=0; i<N-1; ++i){
A[i] = AA[i], B[i] = BB[i];
# | 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... |