제출 #113710

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113710		thebes	Cities (BOI16_cities)	C++14	74 / 100	6033 ms	84804 KiB

cities

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

const int MN = 1e5+5;
typedef long long ll;
typedef pair<ll,ll> pii;
struct reeee{int n, m;};

bool ww[MN][1<<6];
ll n, m, k, i, x, y, w, vs[MN][1<<6], ans = 1LL<<60;
vector<pii> adj[MN]; vector<ll> heh;
queue<reeee> idk;

int main(){
    for(scanf("%lld%lld%lld",&n,&k,&m),i=1;i<=k;i++){
        scanf("%lld",&x);
        heh.push_back(x);
    }
    for(i=1;i<=m;i++){
        scanf("%lld%lld%lld",&x,&y,&w);
        adj[x].push_back({y,w});
        adj[y].push_back({x,w});
    }
    memset(vs,0x3f,sizeof(vs));
    for(i=0;i<heh.size();i++)
        idk.push({heh[i], 1<<i}), ww[heh[i]][1<<i]=1, vs[heh[i]][1<<i]=0;
    while(idk.size()){
        reeee v = idk.front(); idk.pop();
        if(v.m==(1<<k)-1) ans = min(ans, vs[v.n][v.m]);
        if(!ww[v.n][v.m]) continue;
        ww[v.n][v.m] = 0;
        for(int mm=0;mm<(1<<k);mm++){
            if(vs[v.n][v.m]+vs[v.n][mm]<vs[v.n][v.m|mm]){
                vs[v.n][v.m|mm] = vs[v.n][v.m]+vs[v.n][mm];
                if(!ww[v.n][v.m|mm]) idk.push({v.n, v.m|mm});
                ww[v.n][v.m|mm] = 1;
            }
        }
        for(auto w : adj[v.n]){
            if(vs[v.n][v.m]+w.second<vs[w.first][v.m]){
                vs[w.first][v.m] = vs[v.n][v.m]+w.second;
                if(!ww[w.first][v.m]) idk.push({w.first, v.m});
                ww[w.first][v.m] = 1;
            }
        }
    }
    printf("%lld\n",ans);
    return 0;
}

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

cities.cpp: In function 'int main()':
cities.cpp:25:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<heh.size();i++)
             ~^~~~~~~~~~~
cities.cpp:26:32: warning: narrowing conversion of 'heh.std::vector<long long int>::operator[](((std::vector<long long int>::size_type)i))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int> >::value_type {aka long long int}' to 'int' inside { } [-Wnarrowing]
         idk.push({heh[i], 1<<i}), ww[heh[i]][1<<i]=1, vs[heh[i]][1<<i]=0;
                                ^
cities.cpp:42:51: warning: narrowing conversion of 'w.std::pair<long long int, long long int>::first' from 'long long int' to 'int' inside { } [-Wnarrowing]
                 if(!ww[w.first][v.m]) idk.push({w.first, v.m});
                                                 ~~^~~~~
cities.cpp:15:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%lld%lld%lld",&n,&k,&m),i=1;i<=k;i++){
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
cities.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&x);
         ~~~~~^~~~~~~~~~~
cities.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld",&x,&y,&w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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