Submission #1142476

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142476		ionutza	Cheap flights (LMIO18_pigus_skrydziai)	C++20	0 / 100	130 ms	2764 KiB

pigus_skrydziai

#include <iostream>
#include <fstream>
#define ULL unsigned long long

using namespace std;

int nodes, edges;
ULL costs[300003];

int main (){
    int x, y, cost;

    cin >> nodes >> edges;
    for (int i=1; i<=edges; ++i){
        cin >> x >> y >> cost;

        costs[x] += cost;
        costs[y] += cost;
    }

    ULL ans = 0;
    for (int i=1; i<=nodes; ++i){
        ans = max(ans, costs[i]);
    }
    cout << ans;
    
    return 0;
}

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