| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 942150 | Mathias | Cheap flights (LMIO18_pigus_skrydziai) | C++14 | 3046 ms | 93628 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5+7;
long long t[MAXN];
vector<pair<int,int> > v;
vector<int>g[MAXN];
map<pair<int,int>,long long>w;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,m,a,b,c,s;
long long res=0;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>a>>b>>c;
t[a]+=c; t[b]+=c;
g[a].push_back(b); g[b].push_back(a);
v.push_back({a,b});
w[{a,b}]=w[{b,a}]=c;
}
for(int i=1;i<=n;i++){
res=max(res,t[i]);
}
for(auto k:v){
a=k.first; b=k.second;
for(int i=0;i<g[a].size();i++){
s=g[a][i];
if(w.count({b,s})) res=max(res,w[{a,b}]+w[{a,s}]+w[{b,s}]);
}
}
cout<<res<<'\n';
return 0;
}Compilation message (stderr)
| # | 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... | ||||
