oj.uz

답안 #1103170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1103170 2024-10-20T12:40:03 Z duyhoanho Cities (BOI16_cities) C++14
0 / 100
 188 ms 144048 KB 
#include<bits/stdc++.h>
#define forinc(i,a,b) for(int i=a;i<=b;i++)
#define fordec(i,a,b) for(int i=a;i>=b;i--)
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N = 1e5+10, oo = 1e17;
int n,f[N][70],k,m;
int b[N];
vector<pii> ad[N];
struct node
{
    int u,w,mask;
};
struct cmp
{
    bool operator() (node a,node bb)
    {
        a.w > bb.w;
    }
};
void dij(int mask)
{
    priority_queue<node,vector<node>,cmp> q;
    forinc(i,1,n) q.push({i,f[i][mask],mask});
    while(q.size())
    {
        auto dinh = q.top();q.pop();
        int u = dinh.u;
        int w = dinh.w;
        int mas = dinh.mask;
        if(w > f[u][mas]) continue;
        for(auto v : ad[u])
        {
            int nm = mas | b[v.fi];
            if(f[v.fi][nm] > w + v.se)
            {
                f[v.fi][nm] = w + v.se;
                q.push({v.fi , f[v.fi][nm] , nm});
            }
        }
    }
}
int32_t main()
{

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k>>m;
    int it = 0;
    forinc(i,1,k)
    {
        int x;
        cin>>x;
        b[x] = (1<<it);
        it++;
    }
    forinc(i,1,m)
    {
        int u,v,c;
        cin>>u>>v>>c;
        ad[u].pb({v,c});
        ad[v].pb({u,c});
    }
    forinc(i,0,n) forinc(j,0,66) f[i][j] = oo;
    forinc(i,1,n)
    {
        f[i][b[i]] = 0;
    }
    for(int mask = 0 ; mask < (1 << k) ; mask ++)
    {
        for(int s1 = 0 ; s1 < (1 << k) ; s1++)
        {
            int s2 = mask ^ s1;
            for(int i = 1 ; i <= n ; i++) f[i][mask] = min(f[i][mask] , f[i][s1] + f[i][s2]);
        }
        dij(mask);
    }
    int ans = oo;

    forinc(i,1,n) ans = min(ans , f[i][(1 << k) - 1]);
    cout<<ans;

}

Compilation message

cities.cpp: In member function 'bool cmp::operator()(node, node)':
cities.cpp:22:13: warning: statement has no effect [-Wunused-value]
   22 |         a.w > bb.w;
      |         ~~~~^~~~~~
cities.cpp:23:5: warning: no return statement in function returning non-void [-Wreturn-type]
   23 |     }
      |     ^

Subtask #1
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 10 ms 9296 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 157 ms 144048 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 10 ms 9564 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 165 ms 143864 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 188 ms 143800 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -