oj.uz

Submission #917416

# Submission time Handle Problem Language Result Execution time Memory
917416 2024-01-28T06:44:47 Z arashMLG Cities (BOI16_cities) C++17
100 / 100
 2275 ms 48584 KB 
#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;


typedef long long     ll;
typedef pair<int,int> pii;
typedef pair<ll,ll>   pll;

const int N = 1e5 + 23;
const int LOG = 5;
const ll inf = 1e18;

#define F           first
#define S           second
#define pb          push_back
#define kill(x)     cout<<x<<endl, exit(0);
#define all(x)      x.begin(),x.end()
#define sz(x)       (int)x.size()
#define lc          (v << 1)
#define rc          ((v<<1) |1)
#define int         ll

int n,m,k;
vector<pll> G[N];
int dist[1<<LOG][N];
priority_queue<pll,vector<pll> , greater<pll> > pq;
bool mark[N];

void dijk(int mask) {
	for(int i =  1;  i <= n ; i++) pq.push({dist[mask][i],i});
	fill(mark,mark+N,0);
	while(sz(pq)) {
		int v = pq.top().S; pq.pop();
		if(mark[v]) continue;
		mark[v] = true;
		for(auto [u,w] : G[v]) if(!mark[u]) {
			dist[mask][u] = min(dist[mask][u],dist[mask][v] + w);
			pq.push({dist[mask][u],u});
		}
	}
}

void setdist(int mask) {
	for(int sub = 1; sub < mask; sub ++) if((sub&mask) == sub) {
		int sub2 = mask^sub;
		for(int i = 1; i <= n; i ++) {
			dist[mask][i] = min(dist[mask][i],dist[sub][i] + dist[sub2][i]);
		}
	}
}

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
	for(int i = 0 ; i < (1<<LOG); i ++) for(int j = 0; j <  N ; j ++) dist[i][j] = inf;
	cin>>n>>k>>m;
	for(int i = 0 ;i < k; i ++) {
		int x; cin>>x;
		dist[1<<i][x] = 0;
	}
	for(int i = 0 ; i < m ; i++) {
		int v,u,w; cin>>v>>u>>w;
		G[v].pb({u,w});
		G[u].pb({v,w});
	}
	for(int mask = 1 ; mask < (1 << k) ; mask ++) {
		setdist(mask);
		dijk(mask);
	}
	cout<< *min_element(dist[(1<<k)-1],dist[(1<<k)-1] + N);
	return 0;
}

// Jumpsuit, Jumpsuit cover me!
// Jumpsuit, Jumpsuit cover me!

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 27740 KB Output is correct
2 Correct 7 ms 27840 KB Output is correct
3 Correct 6 ms 27740 KB Output is correct
4 Correct 6 ms 27740 KB Output is correct
5 Correct 6 ms 27740 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 516 ms 48584 KB Output is correct
2 Correct 474 ms 46148 KB Output is correct
3 Correct 259 ms 37324 KB Output is correct
4 Correct 252 ms 45000 KB Output is correct
5 Correct 290 ms 48332 KB Output is correct
6 Correct 136 ms 46276 KB Output is correct
7 Correct 9 ms 27996 KB Output is correct
8 Correct 8 ms 27996 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27992 KB Output is correct
2 Correct 11 ms 27996 KB Output is correct
3 Correct 11 ms 27996 KB Output is correct
4 Correct 11 ms 28252 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1031 ms 47988 KB Output is correct
2 Correct 963 ms 46832 KB Output is correct
3 Correct 486 ms 37320 KB Output is correct
4 Correct 721 ms 48324 KB Output is correct
5 Correct 535 ms 46440 KB Output is correct
6 Correct 481 ms 44520 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2096 ms 47560 KB Output is correct
2 Correct 2154 ms 48100 KB Output is correct
3 Correct 2275 ms 46792 KB Output is correct
4 Correct 1075 ms 37320 KB Output is correct
5 Correct 1442 ms 48064 KB Output is correct
6 Correct 1022 ms 45740 KB Output is correct
7 Correct 942 ms 47588 KB Output is correct