제출 #258830

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
258830		uacoder123	Cheap flights (LMIO18_pigus_skrydziai)	C++14	100 / 100	2009 ms	99192 KiB

pigus_skrydziai

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <ii,lli> iii;
typedef vector <lli> vi;
map<ii,lli> ma;
vector<ii> al[300001];
int main()
{
    lli n,m;
    cin>>n>>m;
    for(lli i=0;i<m;++i)
    {
        lli f,s,w;
        cin>>f>>s>>w;
        al[f].pb(mp(w,s));
        al[s].pb(mp(w,f));
        ma[mp(f,s)]=w;
        ma[mp(s,f)]=w;
    }
    lli ans=0;
    for(lli i=1;i<=n;++i)
    {
        sort(all(al[i]),greater<ii>());
        lli s=0;
        for(lli j=0;j<al[i].size();++j)
            s+=al[i][j].F;
        if(al[i].size()>1&&ma.find(mp(al[i][0].S,al[i][1].S))!=ma.end())
            s=max(s,al[i][0].F+al[i][1].F+ma[mp(al[i][0].S,al[i][1].S)]);
        ans=max(ans,s);
    }
    cout<<ans<<endl;
    return(0);
}

컴파일 시 표준 에러 (stderr) 메시지

pigus_skrydziai.cpp: In function 'int main()':
pigus_skrydziai.cpp:37:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(lli j=0;j<al[i].size();++j)
                     ~^~~~~~~~~~~~~

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