oj.uz

답안 #261079

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261079 2020-08-11T11:18:28 Z Autoratch Cities (BOI16_cities) C++14
52 / 100
 2311 ms 18208 KB 
#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],dis1[N],dis2[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 dijktwo()
{
    for(int i = 1;i <= n;i++) q.push({dis1[i],i}),visited[i] = false;
    while(!q.empty())
    {
        int u = q.top().second;
        q.pop();
        if(visited[u]) continue;
        visited[u] = true;
        ans = min(ans,dis1[u]+dis2[u]);
        for(auto [w,v] : adj[u]) if(dis1[u]+w<dis1[v]) dis1[v] = dis1[u]+w,q.push({dis1[v],v});
    }
}

void solve4()
{
    long long each = 0;
    for(int i = 0;i < k-1;i++) each+=cal(imp[i],imp[i+1]);
    ans = min(ans,each);
    for(int i = 1;i <= n;i++) ans = min(ans,cal(imp[0],imp[1])+cal(imp[1],i)+cal(imp[2],i)+cal(imp[3],i));
    for(int i = 1;i <= n;i++) dis1[i] = cal(imp[0],i)+cal(imp[1],i),dis2[i] = cal(imp[2],i)+cal(imp[3],i);
    dijktwo();
}

void solve5()
{
    long long each = 0;
    for(int i = 0;i < k-1;i++) each+=cal(imp[i],imp[i+1]);
    ans = min(ans,each);
    ans = min(ans,cal(imp[0],imp[1])+cal(imp[0],imp[2])+cal(imp[0],imp[3])+cal(imp[3],imp[4]));
    for(int i = 1;i <= n;i++)
    {
        ans = min(ans,cal(imp[0],i)+cal(imp[1],i)+cal(imp[2],i)+cal(imp[3],i)+cal(imp[3],imp[4]));
        ans = min(ans,cal(imp[0],imp[1])+cal(imp[1],i)+cal(imp[2],i)+cal(imp[3],i)+cal(imp[4],imp[3]));
        ans = min(ans,cal(imp[0],imp[1])+cal(imp[1],imp[2])+cal(imp[2],i)+cal(imp[3],i)+cal(imp[4],i));
        ans = min(ans,cal(imp[0],imp[2])+cal(imp[2],imp[1])+cal(imp[2],i)+cal(i,imp[3])+cal(imp[4],imp[3]));
    }
/*    for(int i = 1;i <= n;i++) dis1[i] = cal(imp[0],i)+cal(imp[1],i)+cal(imp[4],i),dis2[i] = cal(imp[2],i)+cal(imp[3],i);
    dijktwo();
    for(int i = 1;i <= n;i++) dis1[i] = cal(imp[0],i)+cal(imp[1],i)+cal(imp[2],imp[1]),dis2[i] = cal(imp[3],i)+cal(imp[4],i);
    dijktwo();*/
}

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(),solve3();
        else solve5(),solve3();
    }while(next_permutation(imp.begin(),imp.end()));
    cout << ans;
}

Compilation message

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});
                  ^
cities.cpp: In function 'void dijktwo()':
cities.cpp:59:18: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
         for(auto [w,v] : adj[u]) if(dis1[u]+w<dis1[v]) dis1[v] = dis1[u]+w,q.push({dis1[v],v});
                  ^

Subtask #1
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Incorrect 2 ms 2688 KB Output isn't correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 355 ms 12760 KB Output is correct
2 Correct 343 ms 12668 KB Output is correct
3 Correct 151 ms 8740 KB Output is correct
4 Correct 95 ms 7672 KB Output is correct
5 Correct 279 ms 11936 KB Output is correct
6 Correct 86 ms 7544 KB Output is correct
7 Correct 4 ms 2816 KB Output is correct
8 Correct 4 ms 2816 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2944 KB Output is correct
2 Correct 10 ms 2944 KB Output is correct
3 Correct 10 ms 2816 KB Output is correct
4 Correct 8 ms 2816 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2039 ms 18208 KB Output is correct
2 Correct 2311 ms 17764 KB Output is correct
3 Correct 1696 ms 13160 KB Output is correct
4 Correct 1203 ms 13476 KB Output is correct
5 Correct 241 ms 8824 KB Output is correct
6 Correct 103 ms 9336 KB Output is correct

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 574 ms 14316 KB Output isn't correct
2 Halted 0 ms 0 KB -