# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999134 | mdn2002 | Closing Time (IOI23_closing) | C++17 | 1166 ms | 1676236 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.
/*
Mayoeba Yabureru
*/
//#include "closing.h"
#include<bits/stdc++.h>
using namespace std;
int max_score(int n, int x, int y, long long k, vector<int> U, vector<int> V, vector<int> W) {
x ++, y ++;
vector dis(n + 1, vector<long long>(2));
vector<vector<pair<int, long long>>> gr(n + 1);
for (int i = 0; i < n - 1; i ++) {
int u = U[i] + 1, v = V[i] + 1, w = W[i];
gr[u].push_back({v, w});
gr[v].push_back({u, w});
}
function<void(int, int, int)> dfs = [&] (int v, int p, int wt) {
for (auto [u, w] : gr[v]) {
if (u == p) continue;
dis[u][wt] = dis[v][wt] + w;
dfs(u, v, wt);
}
};
dfs(x, 0, 0), dfs(y, 0, 1);
vector<int> vc, path, onpath(n + 1);
function<void(int, int)> go = [&] (int v, int p) {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |