# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
489776 | dung11112003 | Road Closures (APIO21_roads) | C++11 | 230 ms | 46492 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 "roads.h"
#include <bits/stdc++.h>
using namespace std;
vector <long long> minimum_closure_costs(int N, vector <int> U, vector <int> V, vector <int> W)
{
int n = N;
vector <vector <array <int, 3>>> adj(n);
for (int i = 0; i < n - 1; i++)
{
int u = U[i], v = V[i], w = W[i];
adj[u].push_back({v, w, 0});
adj[v].push_back({u, w, 0});
}
struct FenwickTree
{
//1 - indexed
int n;
vector <int> f;
vector <long long> g;
FenwickTree () : n(0), f(), g() {};
FenwickTree (int n) : n(n), f(n + 1), g(n + 1) {};
void insert(int x, long long d)
{
for (; x <= n; x += x & -x)
{
f[x]++;
g[x] += d;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |