Submission #592202

#	Time	Username	Problem	Language	Result	Execution time	Memory
592202		Kipras	Cheap flights (LMIO18_pigus_skrydziai)	C++17	100 / 100	2072 ms	97696 KiB

pigus_skrydziai

#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

const ll maxN = 5e5+10;

ll n, m;
ll v[maxN];
vector<ll> adj[maxN];
map<pair<ll, ll>, ll> a;

int main()
{

    ios_base::sync_with_stdio(0);cin.tie(nullptr);

    for(ll i = 0; i < maxN; i++)v[i]=0;

    cin>>n>>m;
    for(ll i = 0; i < m; i++){
        ll aa, bb, cc;
        cin>>aa>>bb>>cc;
        v[aa]+=cc;
        v[bb]+=cc;
        adj[aa].push_back(bb);
        adj[bb].push_back(aa);
        a[{aa, bb}]=cc;
        a[{bb, aa}]=cc;
    }

    ll res=0;

    for(ll i = 1; i <= n; i++){
        res=max(res, v[i]);
        for(ll x = 0; x < ((ll)(adj[i].size()))-1; x++){
            ll vv=adj[i][x], vvv=adj[i][x+1];
            if(a.count({vv, vvv})){
                res=max(res, a[{i, vv}]+a[{i, vvv}]+a[{vv, vvv}]);
            }
        }
    }

    cout<<res;

    return 0;
}

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