# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288027 | Alexa2001 | Snowy Roads (JOI16_snowy) | C++17 | 25 ms | 2120 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;
static int getL;
namespace
{
const int Nmax = 1005;
vector<int> v[Nmax];
int n, w[Nmax], t[Nmax];
bool special[Nmax];
pair<int,int> edge[Nmax];
void dfs0(int node, int dad = -1)
{
w[node] = 0;
t[node] = dad;
for(auto it : v[node])
if(it != dad)
{
dfs0(it, node);
w[node] = max(w[it], w[node]);
}
if(w[node] == 9)
Compilation message (stderr)
# | 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... |