제출 #1128717

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128717		12345678	Cheap flights (LMIO18_pigus_skrydziai)	C++17	53 / 100	212 ms	53696 KiB

pigus_skrydziai

#include <bits/stdc++.h>

using namespace std;

const int nx=3e5+5;

#define ll long long

ll n, m, u, v, w, dp[nx], mx, pw[nx], pa[nx], vs[nx], lvl[nx];
vector<pair<ll, ll>> d[nx];

void dfs(int u, int p)
{
    lvl[u]=lvl[p]+1;
    pa[u]=p;
    vs[u]=1;
    //cout<<"debug "<<u<<' '<<lvl[u]<<' '<<pa[u]<<' '<<pw[u]<<'\n';
    for (auto [v, w]:d[u])
    {
        if (vs[v]&&lvl[u]==lvl[v]+2) mx=max(mx, w+pw[u]+pw[pa[u]]);
        else if (!vs[v]) pw[v]=w, dfs(v, u);
    }
}
int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=m; i++) cin>>u>>v>>w, d[u].push_back({v, w}), d[v].push_back({u, w}), dp[u]+=w, dp[v]+=w;
    for (int i=1; i<=n; i++) mx=max(mx, dp[i]);
    for (int i=1; i<=n; i++) if (!vs[i]) dfs(i, i);
    cout<<mx;
}

• Subtask 1: 12 / 12
• Subtask 2: 25 / 25
• Subtask 3: 16 / 16
• Subtask 4: 0 / 47