# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
356813 | Mefarnis | Traffic (IOI10_traffic) | C++14 | 1346 ms | 180076 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 "traffic.h"
#define maxn 1000000
#define pb push_back
using namespace std;
typedef long long LL;
int ar[maxn];
LL sum[maxn];
LL ans[maxn];
vector<int> adj[maxn];
LL dfs(int u , int dad , int d) {
sum[u] = ar[u];
ans[0] += (LL) d * ar[u];
int deg = adj[u].size();
for( int i = 0 ; i < deg ; i++ ) {
int v = adj[u][i];
if(v == dad)
continue;
sum[u] += dfs(v,u,d+1);
}
return sum[u];
}
void solve(int u , int dad) {
int deg = adj[u].size();
for( int i = 0 ; i < deg ; i++ ) {
int v = adj[u][i];
if(v == dad)
# | 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... |