| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1139344 | draguta_mihai | Cheap flights (LMIO18_pigus_skrydziai) | C++20 | 122 ms | 2764 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
