oj.uz

Submission #647589

# Submission time Handle Problem Language Result Execution time Memory
647589 2022-10-03T09:04:42 Z ToroTN Cities (BOI16_cities) C++14
74 / 100
 6000 ms 42296 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define X first
#define Y second
ll n,num,m,city[5],u_i,v_i,w_i,u,pow_2[6],val,dp[100005];
ll d[32][100005],some[32];
vector<pair<ll,ll> > g[100005];
vector<ll> bit[6];
priority_queue<pair<ll,ll> > pq;
void dij(ll arr[])
{
    for(int i=1;i<=n;i++)pq.push({-arr[i],i});
    while(!pq.empty())
    {
        u=pq.top().Y;
        pq.pop();
        for(auto [node,w]:g[u])
        {
            if(arr[u]+w<arr[node])
            {
                arr[node]=arr[u]+w;
                pq.push({-arr[node],node});
            }
        }
    }
}
int main()
{
    pow_2[0]=1;
    for(int i=1;i<=5;i++)pow_2[i]=pow_2[i-1]*2;
    scanf("%lld%lld%lld",&n,&num,&m);
    for(int i=0;i<=31;i++)
    {
        for(int j=1;j<=n;j++)
        {
            d[i][j]=1e18;
        }
    }
    for(int i=0;i<num;i++)scanf("%lld",&city[i]);
    for(int i=1;i<=m;i++)
    {
        scanf("%lld%lld%lld",&u_i,&v_i,&w_i);
        g[u_i].pb({v_i,w_i});
        g[v_i].pb({u_i,w_i});
    }
    for(int i=0;i<num;i++)
    {
        d[pow_2[i]][city[i]]=0;
        dij(d[pow_2[i]]);
    }
    for(int i=0;i<num-1;i++)
    {
        for(int j=i+1;j<num;j++)
        {
            val=(pow_2[i]|pow_2[j]);
            for(int k=1;k<=n;k++)
            {
                d[val][k]=d[pow_2[i]][k]+d[pow_2[j]][k];
            }
            dij(d[val]);
        }
    }
    for(int i=1;i<pow_2[num];i++)
    {
        ll kmp=0;
        for(int j=0;j<num;j++)
        {
            if((i|pow_2[j])==i)++kmp;
        }
        some[i]=kmp;
        bit[kmp].pb(i);
    }
    /*for(int i=1;i<=5;i++)
    {
        for(auto node:bit[i])
        {
            printf("%lld ",node);
        }
        printf("\n");
    }*/
    for(int i=3;i<=num;i++)
    {
        for(int j=1;j<=i/2;j++)
        {
            for(auto k:bit[j])
            {
                for(auto l:bit[i-j])
                {
                    val=(k|l);
                    if(some[val]==some[k]+some[l])
                    {
                        //printf("%lld %lld\n",k,l);
                        for(int c=1;c<=n;c++)
                        {
                            //d[val][c]=d[l][c]+d[k][c];
                            dp[c]=d[l][c]+d[k][c];
                        }
                        dij(dp);
                        for(int c=1;c<=n;c++)d[val][c]=min(d[val][c],dp[c]);
                    }
                }
            }
        }
    }
    ll ans=1e18;
    for(int i=1;i<=n;i++)
    {
        ans=min(ans,d[pow_2[num]-1][i]);
    }
    printf("%lld\n",ans);
}

Compilation message

cities.cpp: In function 'void dij(long long int*)':
cities.cpp:19:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   19 |         for(auto [node,w]:g[u])
      |                  ^
cities.cpp: In function 'int main()':
cities.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     scanf("%lld%lld%lld",&n,&num,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:41:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     for(int i=0;i<num;i++)scanf("%lld",&city[i]);
      |                           ~~~~~^~~~~~~~~~~~~~~~~
cities.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         scanf("%lld%lld%lld",&u_i,&v_i,&w_i);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 837 ms 42280 KB Output is correct
2 Correct 774 ms 41368 KB Output is correct
3 Correct 606 ms 35380 KB Output is correct
4 Correct 111 ms 12060 KB Output is correct
5 Correct 410 ms 42296 KB Output is correct
6 Correct 75 ms 12108 KB Output is correct
7 Correct 6 ms 3256 KB Output is correct
8 Correct 4 ms 3124 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3260 KB Output is correct
2 Correct 11 ms 3156 KB Output is correct
3 Correct 7 ms 3156 KB Output is correct
4 Correct 8 ms 3028 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2701 ms 42288 KB Output is correct
2 Correct 2682 ms 41256 KB Output is correct
3 Correct 1975 ms 35368 KB Output is correct
4 Correct 1469 ms 28048 KB Output is correct
5 Correct 299 ms 15372 KB Output is correct
6 Correct 119 ms 14332 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6084 ms 42172 KB Time limit exceeded
2 Halted 0 ms 0 KB -