# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97189 | maruii | Snowy Roads (JOI16_snowy) | 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 "Borislib.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], piv, pivs[500], chk[500];
static int dfs(int x){
int ret = 1;
for(auto &i: edge[x]){
if(prt[x]==i) continue;
prt[i] = x;
dth[i] = dth[x]+1;
ret = max(ret, dfs(i)%12+1);
}
if(!x || ret%12 == 0) chk[x] = 1, pivs[x] = piv, piv += 9;
return ret;
}
void InitBoris(int N, int AA[], int BB[]) {
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];
edge[A[i]].push_back(B[i]);
edge[B[i]].push_back(A[i]);
}
for(int i=0; i<N; ++i) sort(edge[i].begin(), edge[i].end());
piv = N;
dfs(0);
}
int Boris(int city) {
int ret = 0;
while(!chk[city]) ret += Ask(city), city = prt[city];
for(int i=0; i<9; ++i) ret += Ask(pivs[city]+i)<<i;
return ret;
}
#include "Borislib.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], piv, pivs[500], chk[500];
static int dfs(int x){
int ret = 0;
for(auto &i: edge[x]){
if(prt[x]==i) continue;
prt[i] = x;
dth[i] = dth[x]+1;
ret = max(ret, dfs(i)%12+1);
}
if(!x || ret%12 == 0) chk[x] = 1, pivs[x] = piv, piv += 9;
return ret;
}
void InitBoris(int N, int AA[], int BB[]) {
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];
edge[A[i]].push_back(B[i]);
edge[B[i]].push_back(A[i]);
}
for(int i=0; i<N; ++i) sort(edge[i].begin(), edge[i].end());
piv = N;
dfs(0);
}
int Boris(int city) {
int ret = 0;
while(!chk[city]) ret += Ask(city), city = prt[city];
for(int i=0; i<9; ++i) ret += Ask(pivs[city]+i)<<i;
return ret;
}