oj.uz

Submission #592199

# Submission time Handle Problem Language Result Execution time Memory
592199 2022-07-08T18:21:47 Z Kipras Cheap flights (LMIO18_pigus_skrydziai) C++17
0 / 100
 587 ms 62816 KB 
#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(int i = 0; i < maxN; i++)v[i]=0;

    cin>>n>>m;
    for(int 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(int 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({i, x})){
                res=max(res, a[{i, vv}]+a[{i, vvv}]+a[{vv, vvv}]);
            }
        }
    }

    cout<<res;

    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 9 ms 15956 KB Output is correct
3 Correct 11 ms 15956 KB Output is correct
4 Correct 8 ms 15924 KB Output is correct
5 Correct 8 ms 15872 KB Output is correct
6 Correct 33 ms 18888 KB Output is correct
7 Correct 9 ms 15956 KB Output is correct
8 Incorrect 8 ms 15956 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15956 KB Output is correct
2 Correct 9 ms 15956 KB Output is correct
3 Correct 11 ms 15956 KB Output is correct
4 Correct 8 ms 15924 KB Output is correct
5 Correct 8 ms 15872 KB Output is correct
6 Correct 33 ms 18888 KB Output is correct
7 Correct 9 ms 15956 KB Output is correct
8 Incorrect 8 ms 15956 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 44144 KB Output is correct
2 Correct 587 ms 62816 KB Output is correct
3 Incorrect 192 ms 31516 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 44144 KB Output is correct
2 Correct 587 ms 62816 KB Output is correct
3 Incorrect 192 ms 31516 KB Output isn't correct
4 Halted 0 ms 0 KB -