Submission #1139344

#TimeUsernameProblemLanguageResultExecution timeMemory
1139344draguta_mihaiCheap flights (LMIO18_pigus_skrydziai)C++20
0 / 100
122 ms2764 KiB
#include <iostream> using namespace std; const int NMAX = 3e5 + 1; long long v[NMAX]; long long sol = 0; int main() { int n, m; int a, b, cost; cin >> n >> m; for(int i = 1; i <= m; i++) { cin >> a >> b; cin >> cost; v[a] += cost; sol = max(sol, v[a]); v[b] += cost; sol = max(sol, v[b]); } cout << sol; 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...