# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373815 | gustason | Cheap flights (LMIO18_pigus_skrydziai) | C++11 | 331 ms | 41756 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>
using namespace std;
using ll = long long;
const int maxN = 3e5 + 5;
struct Pii {
int a, w;
};
vector<Pii> adj[maxN];
vector<char> col(maxN);
vector<Pii> par(maxN);
ll sum[maxN], mx = 0;
void dfs(int v, int p) {
col[v] = 1;
for(auto u : adj[v]) {
if (p == u.a) continue;
if (col[u.a] == 0) {
dfs(u.a, v);
} else if (col[u.a] == 1) {
if (par[par[u.a].a].a == v) {
ll w = par[par[u.a].a].w + par[u.a].w + u.w;
mx = max(mx, w);
}
}
par[u.a] = {v, u.w};
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
# | 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... |