Submission #961932

#TimeUsernameProblemLanguageResultExecution timeMemory
961932IrateCheap flights (LMIO18_pigus_skrydziai)C++17
12 / 100
12 ms972 KiB
#include <bits/stdc++.h>
using namespace std;
const int mxN = 305;
long long G[mxN][mxN];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for(int i = 0;i < m;++i){
        int u, v, w;
        cin >> u >> v >> w;
        G[u][v] = G[v][u] = w;
    }
    long long mx = 0;
    for(int i = 1;i <= n;++i){
        long long temp = 0;
        for(int j = 1;j <= n;++j){
            temp += G[i][j];
        }
        mx = max(mx, temp);
    }
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= n;++j){
            for(int k = 1;k <= n;++k){
                if(G[i][j] && G[j][k] && G[i][k]){
                    mx = max(mx, G[i][j] + G[j][k] + G[i][k]);
                }
            }
        }
    }
    cout << mx << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...