# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798432 | HunterXD | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 80 ms | 20404 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>
using namespace std;
typedef int ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define all(x) x.begin(), x.end()
#define pb push_back
const char nd = '\n';
struct edge {
ll v, w;
};
vector<vector<edge>> graph;
vl level;
vvl sparse, dist;
void dfs(ll u, ll p) {
sparse[u][0] = p;
for (auto v : graph[u]) {
if (v.v == p) continue;
dist[v.v][0] = v.w;
level[v.v] = level[u] + 1;
dfs(v.v, u);
}
}
# | 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... |