Submission #550159

#	Time	Username	Problem	Language	Result	Execution time	Memory
550159		fadi57	Cheap flights (LMIO18_pigus_skrydziai)	C++14	12 / 100	3086 ms	113804 KiB

pigus_skrydziai

#include<bits/stdc++.h>
using namespace std;

const int mx=5009;
typedef long long ll;
map<pair<int,int>,ll>ok;
vector<pair<int,ll>>adj[mx];
int n,m;
int main()
{
    cin>>n>>m;
    for(int i=0; i<m; i++)
    {
        int x,y,w;
        cin>>x>>y>>w;
     adj[x].push_back({y,w});
       adj[y].push_back({x,w});
       ok[{x,y}]=w;
       ok[{y,x}]=w;
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
            ll tmp=0;
         for(auto it:adj[i]){
            tmp+=it.second;
            for(auto itt:adj[it.first]){
                     if(itt.first==i){continue;}
                if(ok[{itt.first,i}]){
                   ans=max(ans,it.second+itt.second+ok[{itt.first,i}]);
                }
            }
         }
    if(tmp>=ans){ans=tmp;}
    }
    cout<<ans;

}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 25
• Subtask 3: 0 / 16
• Subtask 4: 0 / 47