Submission #1139615

#TimeUsernameProblemLanguageResultExecution timeMemory
1139615uncle_sam007Cheap flights (LMIO18_pigus_skrydziai)C++20
0 / 100
140 ms2768 KiB
#include <iostream> using namespace std; #define fin cin #define fout cout const int NMAX = 300001; long long g[NMAX]; int main() { int n, m; fin >> n >> m; for(int i = 1; i <= m; ++i){ int u, w, pr; fin >> u >> w >> pr; g[u] += pr; g[w] += pr; } long long smax = 0; for(int i = 1; i <= n; ++i){ //fout << g[i] << " "; smax = max(smax, g[i]); } fout << smax; 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...