제출 #485513

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
485513		NhatMinh0208	Cities (BOI16_cities)	C++14	100 / 100	836 ms	31956 KiB

cities

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
 
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}
 
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
 
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<pii(ll)> gt[200021];
ll n,m,i,j,k,t,t1,u,v,a,b;
int tar[5];
int eu[200001];
int ev[200001];
int ec[200001];
ll dis[5][100001];
ll dis2[200012];
ll dis3[5][5][100001];
priority_queue<pii(ll),vector<pii(ll)>,greater<pii(ll)>> pq;
int main()
{
	fio;
    cin>>n>>k>>m;
    for (i=0;i<k;i++) {
        cin>>tar[i];
        tar[i]--;
    }
    for (i=0;i<m;i++) {
        cin>>eu[i]>>ev[i]>>ec[i];
        eu[i]--;
        ev[i]--;
        gt[eu[i]].push_back({ec[i],ev[i]});
        gt[ev[i]].push_back({ec[i],eu[i]});
    }
    for (t=0;t<k;t++) {
        for (i=0;i<n;i++) dis[t][i]=1e18;
        dis[t][tar[t]]=0;
        pq.push({0,tar[t]});
        while(pq.size()) {
            auto pp = pq.top();
            // assert(pp.fi >= 0);
            // cout<<t<<' '<<pp.fi<<' '<<pp.se<<endl;
            pq.pop();
            if (pp.fi-dis[t][pp.se]) continue;
            for (auto g : gt[pp.se]) 
            if (dis[t][g.se]>pp.fi+g.fi) {
                dis[t][g.se]=pp.fi+g.fi;
                b++;
                // cout<<b<<endl;
                pq.push({dis[t][g.se],g.se});
            }
        }
        for (i=0;i<n;i++) {
            // assert(dis[t][i]>=0);
        }
    }
    
    if (k==2) {
        cout<<dis[0][tar[1]];
    }
    else if (k==3) {
        u=1e18;
        for (i=0;i<n;i++) u=min(u,dis[0][i]+dis[1][i]+dis[2][i]);
        cout<<u;
    }
    else if (k==4) {
        u=1e18;
 
        for (i=0;i<n;i++) {
            dis2[i]=dis[0][i]+dis[1][i];
            pq.push({dis[0][i]+dis[1][i],i});
        }
        while(pq.size()) {
            auto pp = pq.top();
            // assert(pp.fi >= 0);
            // cout<<t<<' '<<pp.fi<<' '<<pp.se<<endl;
            pq.pop();
            if (pp.fi-dis2[pp.se]) continue;
            for (auto g : gt[pp.se]) 
            if (dis2[g.se]>pp.fi+g.fi) {
                dis2[g.se]=pp.fi+g.fi;
                b++;
                // cout<<b<<endl;
                pq.push({dis2[g.se],g.se});
            }
        }
        for (i=0;i<n;i++) {
            u=min(u,dis2[i]+dis[2][i]+dis[3][i]);
        }
 
 
        for (i=0;i<n;i++) {
            dis2[i]=dis[0][i]+dis[2][i];
            pq.push({dis[0][i]+dis[2][i],i});
        }
        while(pq.size()) {
            auto pp = pq.top();
            // assert(pp.fi >= 0);
            // cout<<t<<' '<<pp.fi<<' '<<pp.se<<endl;
            pq.pop();
            if (pp.fi-dis2[pp.se]) continue;
            for (auto g : gt[pp.se]) 
            if (dis2[g.se]>pp.fi+g.fi) {
                dis2[g.se]=pp.fi+g.fi;
                b++;
                // cout<<b<<endl;
                pq.push({dis2[g.se],g.se});
            }
        }
        for (i=0;i<n;i++) {
            u=min(u,dis2[i]+dis[1][i]+dis[3][i]);
        }
 
        for (i=0;i<n;i++) {
            dis2[i]=dis[0][i]+dis[3][i];
            pq.push({dis[0][i]+dis[3][i],i});
        }
        while(pq.size()) {
            auto pp = pq.top();
            // assert(pp.fi >= 0);
            // cout<<t<<' '<<pp.fi<<' '<<pp.se<<endl;
            pq.pop();
            if (pp.fi-dis2[pp.se]) continue;
            for (auto g : gt[pp.se]) 
            if (dis2[g.se]>pp.fi+g.fi) {
                dis2[g.se]=pp.fi+g.fi;
                b++;
                // cout<<b<<endl;
                pq.push({dis2[g.se],g.se});
            }
        }
        for (i=0;i<n;i++) {
            u=min(u,dis2[i]+dis[2][i]+dis[1][i]);
        }
 
 
        cout<<u;
    }
    else {
        // cout<<5<<endl;
        u=1e18;
        for (i=0;i<5;i++) for (j=i+1;j<5;j++) { 
            for (k=0;k<n;k++) {dis3[i][j][k]=dis[i][k]+dis[j][k];
            pq.push({dis3[i][j][k],k});}
        while(pq.size()) {
            auto pp = pq.top();
            // assert(pp.fi >= 0);
            // cout<<t<<' '<<pp.fi<<' '<<pp.se<<endl;
            pq.pop();
            if (pp.fi-dis3[i][j][pp.se]) continue;
            for (auto g : gt[pp.se]) 
            if (dis3[i][j][g.se]>pp.fi+g.fi) {
                dis3[i][j][g.se]=pp.fi+g.fi;
                b++;
                // cout<<b<<endl;
                pq.push({dis3[i][j][g.se],g.se});
            }
        }
        }
        for (i=0;i<n;i++) { 
            u=min(u,dis[0][i]+dis3[1][2][i]+dis3[3][4][i]);
            u=min(u,dis[0][i]+dis3[1][3][i]+dis3[2][4][i]);
            u=min(u,dis[0][i]+dis3[1][4][i]+dis3[2][3][i]);
 
            u=min(u,dis[1][i]+dis3[0][2][i]+dis3[3][4][i]);
            u=min(u,dis[1][i]+dis3[0][3][i]+dis3[2][4][i]);
            u=min(u,dis[1][i]+dis3[0][4][i]+dis3[2][3][i]);
 
            u=min(u,dis[2][i]+dis3[0][1][i]+dis3[3][4][i]);
            u=min(u,dis[2][i]+dis3[1][3][i]+dis3[0][4][i]);
            u=min(u,dis[2][i]+dis3[1][4][i]+dis3[0][3][i]);
 
            u=min(u,dis[3][i]+dis3[1][2][i]+dis3[0][4][i]);
            u=min(u,dis[3][i]+dis3[0][1][i]+dis3[2][4][i]);
            u=min(u,dis[3][i]+dis3[1][4][i]+dis3[0][2][i]);
 
            u=min(u,dis[4][i]+dis3[1][2][i]+dis3[0][3][i]);
            u=min(u,dis[4][i]+dis3[1][3][i]+dis3[0][2][i]);
            u=min(u,dis[4][i]+dis3[0][1][i]+dis3[2][3][i]);
        }
        cout<<u;
    }
    // cout<<endl<<b;
}
// Normie28;

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

cities.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

• Subtask 1: 22 / 22
• Subtask 2: 14 / 14
• Subtask 3: 15 / 15
• Subtask 4: 23 / 23
• Subtask 5: 26 / 26