# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798464 | HunterXD | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 1083 ms | 6468 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 unsigned short us;
typedef vector<int> vl;
typedef vector<vl> vvl;
#define all(x) x.begin(), x.end()
#define pb push_back
const char nd = '\n';
struct edge {
us v;
int w;
};
vector<vector<edge>> graph;
bitset<50001> visto, visitado;
int res = 0;
us dfs(us u, us p) {
us cdown = 0, temp = 0;
for (auto v : graph[u]) {
if (v.v == p) continue;
temp = dfs(v.v, u);
if (temp && temp != 5) res += v.w;
cdown += temp;
}
if (visto[u]) cdown++;
# | 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... |