oj.uz

Submission #1059435

# Submission time Handle Problem Language Result Execution time Memory
1059435 2024-08-15T00:33:21 Z vjudge1 Cities (BOI16_cities) C++17
74 / 100
 6000 ms 262144 KB 
#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define int long long
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int mod=1e9+7;
const int M=1e5+10;
int n,m,k,f[M][1<<6];
vector<ii> ke[M];
struct node
{
  int u,mask,val;
};
struct cmp
{
  bool operator() (node a,node b) {
    return a.val>b.val;
  }
};
priority_queue<node,vector<node> ,cmp> h;
int tmp[1<<6];
void dij()
{
  while(!h.empty())
  {
    node u=h.top();h.pop();
    for(ii v:ke[u.u])
    {
      fori(i,0,(1<<k)-1) tmp[i|u.mask]=min(tmp[i|u.mask],u.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({v.fi,i,f[v.fi][i]});
        }
        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({x,1<<i,0});
    f[x][1<<i]=0;
  }
  fori(i,1,m)
  {
    int u,v,w;
    cin >> u >> v >> w;
    ke[u].pb({v,w});
    ke[v].pb({u,w});
  }
  dij();
  int kq=1e18;
  fori(i,1,n) kq=min(kq,f[i][(1<<k)-1]);
  cout << kq;
}

Compilation message

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

Subtask #1
22.0 / 22.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1063 ms 87936 KB Output is correct
2 Correct 992 ms 87344 KB Output is correct
3 Correct 287 ms 64452 KB Output is correct
4 Correct 440 ms 15096 KB Output is correct
5 Correct 289 ms 69664 KB Output is correct
6 Correct 99 ms 14428 KB Output is correct
7 Correct 4 ms 5152 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 5720 KB Output is correct
2 Correct 10 ms 5724 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 10 ms 5720 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5261 ms 161836 KB Output is correct
2 Correct 4857 ms 160984 KB Output is correct
3 Correct 1519 ms 82840 KB Output is correct
4 Correct 3785 ms 87684 KB Output is correct
5 Correct 1677 ms 42388 KB Output is correct
6 Correct 1882 ms 19612 KB Output is correct

Subtask #5
0 / 26.0

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