# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410767 | LouayFarah | Race (IOI11_race) | C++14 | 3095 ms | 202292 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"
using namespace std;
void depth(vector<pair<int, int>> adj[], int u, int e, vector<int> &cnt)
{
for(auto v: adj[u])
{
if(v.first!=e)
{
cnt[v.first] = cnt[u]+v.second;
depth(adj, v.first, u, cnt);
}
}
}
void all_pairs_distance(vector<pair<int, int>> adj[], int N, vector<vector<int>> &cnt)
{
for(int i = 0; i<N; i++)
{
vector<int> temp(N);
depth(adj, i, -1, temp);
cnt.push_back(temp);
}
}
void depth2(vector<pair<int, int>> adj[], int u, int e, vector<int> &cnt)
{
for(auto v: 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... |