# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174409 | nrg_studio | Race (IOI11_race) | C++20 | 329 ms | 101360 KiB |
#include <bits/stdc++.h>
#include "race.h"
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define f first
#define s second
#define chmin(a, b) a = min(a,b)
#define chmax(a, b) a = max(a,b)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define all(x) x.begin(),x.end()
#define vec vector
const int MAX_N = 2e5;
vec<pii> adj[MAX_N];
map<ll,ll> dist[MAX_N];
ll weight[MAX_N] = {0}, unweight[MAX_N] = {0};
ll ans = INT_MAX;
int k2;
void dfs(int cur, int par) {
dist[cur][0] = 0;
for (auto[x,w] : adj[cur]) {
if (x!=par) {
dfs(x,cur);
weight[x] += w;
# | 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... |