# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296153 | Alexa2001 | Fun Tour (APIO20_fun) | C++17 | 1 ms | 384 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 "fun.h"
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5;
int n;
vector<int> ans;
bool used[Nmax];
int dist[Nmax];
void add(int node)
{
ans.push_back(node);
used[node] = 1;
}
void solve(int node)
{
int i, j;
for(i=1; i<n; ++i) dist[i] = hoursRequired(0, i);
int root = 0;
while(1)
{
vector<int> sons;
vector<vector<int>> d;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |