# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
942156 | Mathias | Cheap flights (LMIO18_pigus_skrydziai) | C++14 | 834 ms | 89984 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<pair<long long,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({c,b}); g[b].push_back({c,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(int i=1;i<=n;i++){
sort(g[i].begin(),g[i].end());
if (g[i].size()>1) {
res=max(res,g[i][0].first + g[i][1].first + w[{g[i][0].second,g[i][1].second}]);
}
}
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... |