| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 100970 | autumn_eel | Snowy Roads (JOI16_snowy) | C++14 | 66 ms | 2032 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>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int,int>P;
#include "Anyalib.h"
static vector<int>E[600];
static int dep[600];
static int a[600],b[600];
static map<int,int>mp,edge;
int n;
static void dfs(int v,int p,int d){
dep[v]=d;
for(int u:E[v]){
if(u==p)continue;
dfs(u,v,d+1);
}
}
static int mod;
void InitAnya(int N , int A[] , int B[]) {
n=N;
rep(i,n-1){
a[i]=A[i];b[i]=B[i];
E[a[i]].push_back(b[i]);
E[b[i]].push_back(a[i]);
}
dfs(0,-1,0);
| # | 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... | ||||