# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784685 | bane | Race (IOI11_race) | C++17 | 300 ms | 31764 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>
#include "race.h"
#define ll long long
using namespace std;
const int maxK = (int)1e6 + 5;
struct Undirected_Graph{
int N, K, ans = (int)1e9;
vector<vector<pair<int,int>>>adj;
vector<int>Used;
vector<int>Sz;
ll dp[maxK];
vector<int>vec;
Undirected_Graph(int _N, int _K, int H[0][2], int L[]):N(_N),K(_K){
adj.resize(N);
Used.resize(N);
for (int i = 0; i <= K; i++){
dp[i] = (int)1e9;
}
Sz.resize(N);
for (int i = 0; i < N - 1; i++){
adj[H[i][1]].push_back({H[i][0], L[i]});
adj[H[i][0]].push_back({H[i][1], L[i]});
}
}
int Make(int U, int P){
Sz[U] = 1;
for (auto [f,w] : adj[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... |