제출 #550166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
550166		fadi57	Cheap flights (LMIO18_pigus_skrydziai)	C++14	0 / 100	149 ms	262144 KiB

pigus_skrydziai

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

const int mx=5009;
typedef long long ll;
map<pair<int,int>,int>mp;
vector<pair<int,int>>adj[mx];
int n,m;ll ans;
int vis[mx];
void dfs(int node,int par){
 vis[node]=2;
   for(auto it:adj[node]){
        if(it.first==par){continue;}
       if(vis[it.first]==2&&mp.find({par,it.first})!=mp.end()){
          ans=max(ans,1LL*(it.second+mp[{it.first,par}]+mp[{node,par}]));
       }else if(vis[it.first]==1){
         continue;
       }else{
         dfs(it.first,node);

       }


    }

  vis[node]=1;


}
int main()
{
     ios_base::sync_with_stdio(0);
     cin.tie();
    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});
       mp[{x,y}]=w;
       mp[{y,x}]=w;
    }

    for(int i=1;i<=n;i++){
          if(!vis[i]){
            dfs(i,0);
          }
          ll tmp=0;
          for(auto it:adj[i]){
            tmp+=it.second;
          }
          ans=max(ans,tmp);
    }
    cout<<ans;

}

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