제출 #261020

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261020		Autoratch	Cities (BOI16_cities)	C++14	14 / 100	392 ms	18260 KiB

cities

#include <bits/stdc++.h>
using namespace std;
#define pii pair<long long,int> 

const int N = 1e5 + 1;
const int K = 6;

int n,m,k;
vector<pair<int,int> > adj[N];
vector<int> imp;
int idx[N];
bool visited[N];
long long dist[K][N],ans = LLONG_MAX;
priority_queue<pii,vector<pii>,greater<pii> > q;

void dijk(int x,long long (&dist)[N])
{
    for(int i = 1;i <= n;i++) visited[i] = false,dist[i] = LLONG_MAX;
    dist[x] = 0;
    q.push({0,x});
    while(!q.empty())
    {
        int u = q.top().second;
        q.pop();
        if(visited[u]) continue;
        visited[u] = true;
        for(auto [w,v] : adj[u]) if(dist[u]+w<dist[v]) dist[v] = dist[u]+w,q.push({dist[v],v});
    }
}

long long cal(int a,int b)
{
    if(idx[a]) return dist[idx[a]][b];
    else return dist[idx[b]][a];
}

void solve2(){ ans = min(ans,cal(imp[0],imp[1])); }

void solve3()
{
    for(int i = 1;i <= n;i++) 
    {
        long long each = 0;
        for(int x : imp) each+=cal(i,x);
        ans = min(ans,each);
    }
}

void solve4()
{

}

void solve5()
{

}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> k >> m;
    for(int i = 1;i <= k;i++)
    {
        int x;
        cin >> x;
        imp.push_back(x);
        idx[x] = i;
    }
    for(int i = 0;i < m;i++)
    {
        int a,b,d;
        cin >> a >> b >> d;
        adj[a].push_back({d,b});
        adj[b].push_back({d,a});
    }   
    for(int x : imp) dijk(x,dist[idx[x]]);
    sort(imp.begin(),imp.end());
    do
    {
        if(k==2) solve2();
        else if(k==3) solve3();
        else if(k==4) solve4();
        else solve5();
    }while(next_permutation(imp.begin(),imp.end()));
    cout << ans;
}

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

cities.cpp: In function 'void dijk(int, long long int (&)[100001])':
cities.cpp:27:18: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
         for(auto [w,v] : adj[u]) if(dist[u]+w<dist[v]) dist[v] = dist[u]+w,q.push({dist[v],v});
                  ^

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