제출 #1335459

#제출 시각아이디문제언어결과실행 시간메모리
1335459FIFI_cppCheap flights (LMIO18_pigus_skrydziai)C++20
0 / 100
292 ms23008 KiB
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <iterator>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cctype>
#include <string>
#include <cassert>
#include <set>
#include <bitset>
#include <unordered_set>
#include <numeric>

#define all(a) a.begin(), a.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ppi pair<int,pair<int,int>>
#define int int64_t

using namespace std;
//    /\_/\
//   (= ._.)
//   / >  \>
// encouraging cat
const int INF = 10000000000000000;
//const int mod = 1000000007;
const int mod = 998244353;
const int MAXN = 200005;
//ifstream fin('xor.in');
//ofstream fout('xor.out');
signed main()
{
    int n,m;
    cin >> n >> m;
    vector<vector<pair<int,int>>> adj(n);
    for (int i = 0;i < m;i++)
    {
        int u,v, w;
        cin >> u >> v >> w;
        u--,v--;
        adj[u].pb({v,w});
        adj[v].pb({u, w});
    }
    int res = 0;
    for (int i = 0;i < n;i++)
    {
        int c = 0;
        for (auto edge: adj[i])
        {
            c += edge.second;
        } 
        res = max(res, c);
    }
    cout << res << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...