# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978875 | badont | Dreaming (IOI13_dreaming) | C++17 | 64 ms | 16144 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 "dreaming.h"
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
ll n = N, m = M, l = L;
vector e(n, vector<pii>());
vector<int> par(n, -1);
vector<bool> v(n, false);
vector<ll> dist(n, 0);
for (int i = 0; i < m; i++) {
e[A[i]].push_back({B[i], T[i]});
e[B[i]].push_back({A[i], T[i]});
}
ll ans = 0;
vector<ll> a;
for (int c = 0; c < n; c++) {
if (v[c])
continue;
vector<ll> comp;
bool push_comp = true;
auto dfs_1 = [&](auto &dfs, int g, int p, ll d) -> void {
Compilation message (stderr)
# | 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... |