# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1059438 |
2024-08-15T00:45:32 Z |
vjudge1 |
Cities (BOI16_cities) |
C++17 |
|
6000 ms |
196952 KB |
#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];
struct node
{
int u,mask;
long long val;
};
struct cmp
{
bool operator() (node a,node b) {
return a.val>b.val;
}
};
priority_queue<node,vector<node> ,cmp> h;
long long tmp[1<<6];
void dij()
{
while(!h.empty())
{
node u=h.top();h.pop();
if(f[u.u][u.mask]<u.val) continue;
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)
{
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;
}
Compilation message
cities.cpp: In function 'int32_t main()':
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".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
cities.cpp:55:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
55 | freopen(task".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4696 KB |
Output is correct |
2 |
Correct |
1 ms |
4696 KB |
Output is correct |
3 |
Correct |
1 ms |
4708 KB |
Output is correct |
4 |
Correct |
1 ms |
4712 KB |
Output is correct |
5 |
Correct |
1 ms |
4700 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
699 ms |
79788 KB |
Output is correct |
2 |
Correct |
552 ms |
78800 KB |
Output is correct |
3 |
Correct |
227 ms |
62360 KB |
Output is correct |
4 |
Correct |
73 ms |
14548 KB |
Output is correct |
5 |
Correct |
200 ms |
67284 KB |
Output is correct |
6 |
Correct |
45 ms |
14056 KB |
Output is correct |
7 |
Correct |
3 ms |
4968 KB |
Output is correct |
8 |
Correct |
1 ms |
4968 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
5352 KB |
Output is correct |
2 |
Correct |
6 ms |
5352 KB |
Output is correct |
3 |
Correct |
3 ms |
4968 KB |
Output is correct |
4 |
Correct |
5 ms |
5356 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2722 ms |
128928 KB |
Output is correct |
2 |
Correct |
2448 ms |
128076 KB |
Output is correct |
3 |
Correct |
943 ms |
74668 KB |
Output is correct |
4 |
Correct |
1631 ms |
71316 KB |
Output is correct |
5 |
Correct |
369 ms |
34176 KB |
Output is correct |
6 |
Correct |
204 ms |
18124 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
6033 ms |
196952 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |