제출 #1059440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059440		vjudge1	Cities (BOI16_cities)	C++17	74 / 100	6065 ms	194704 KiB

cities

#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define ii pair<int,long long >
#define fi first
#define se second
#define pb push_back
using namespace std;
const int M=1e5+10;
int n,m,k;
long long  f[M][1<<6];
vector<ii> ke[M];
#define node tuple<long long ,int ,int >
priority_queue<node,vector<node> ,greater<node> > h;
long long  tmp[1<<6];
void dij()
{
  while(!h.empty())
  {
    auto [val,mask,u]=h.top();h.pop();
    if(f[u][mask]<val) continue;
    for(ii v:ke[u])
    {
      fori(i,0,(1<<k)-1) tmp[i|mask]=min(tmp[i|mask],val+f[v.fi][i]+v.se);
      fori(i,0,(1<<k)-1)
      {
        if(tmp[i]<f[v.fi][i])
        {
          f[v.fi][i]=tmp[i];
          h.push({f[v.fi][i],i,v.fi});
        }
        tmp[i]=1e18;
      }
    }
  }
}
int32_t main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  #define task "1"
  if(fopen(task".inp","r"))
  {
    freopen(task".inp","r",stdin);
    freopen(task".out","w",stdout);
  }
  cin >> n >> k >> m;
  fori(i,1,n)
  {
    fori(j,1,(1<<k)-1) f[i][j]=1e18;
  }
  fori(i,1,(1<<k)-1) tmp[i]=1e18;
  fori(i,0,k-1)
  {
    int x;
    cin >> x;
    h.push({0,1<<i,x});
    f[x][1<<i]=0;
  }
  fori(i,1,m)
  {
    long long  u,v,w;
    cin >> u >> v >> w;
    ke[u].pb({v,w});
    ke[v].pb({u,w});
  }
  dij();
  long long  kq=1e18;
  fori(i,1,n) kq=min(kq,f[i][(1<<k)-1]);
  cout << kq;
}

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

cities.cpp: In function 'int32_t main()':
cities.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen(task".inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
cities.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen(task".out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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