oj.uz

답안 #492870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492870 2021-12-09T12:06:11 Z LastRonin Cities (BOI16_cities) C++14
51 / 100
 6000 ms 262148 KB 
#pragma GCC optimize("O3")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define si short int
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pill pair<ll,ll>
#define f first
#define s second
#define pilc pair<ll,char>
#define all(a) (a).begin(),(a).end()
#define rep(s,e,step) for(int i = (s); i < (e) ; i += step)
#define vrep(s,e,step) for(int j = (s); j < (e) ; j += step)
#define ex exit(0) 
#define triple pair<pill, ll>
#define pinode pair<node*, node*>
#define quadra pair<pill, pill>
#define ld double
#define pild pair<double,double>
using namespace std;
    
const ll N = 1e5 + 11;
const ll M = 32;
const ll mod = 998244353;
   
mt19937_64 bruh(chrono::steady_clock::now().time_since_epoch().count());
 
ll n, m, k;
ll dp[N][M];
bool was[N][M];
set<pair<ll, pill>> pd; 
vector<pill> g[N];  
vector<int> prec[M];
ll x[N];
 
int main() {                                                       
	speed;
	cin >> n >> k >> m;
	for(int i = 0; i < k; i++)	
		cin >> x[i];
	for(int i = 0; i < (1<<k); i++) {
		for(int j = 0; j < (1<<k); j++)
			if(!(i&j))
				prec[i].pb(j), prec[j].pb(i);
	}
	for(int i = 1; i <= m; i++) {
		ll a, b, c;
		cin >> a >> b >> c;
		g[a].pb(mp(b, c));
		g[b].pb(mp(a, c));
	}
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j < (1<<k); j++)
			dp[i][j] = 1e17; 
		pd.insert(mp(0, mp(i, 0)));
	}
	for(int i = 0; i < k; i++) {         
		dp[x[i]][1<<i] = 0;
		pd.insert(mp(0, mp(x[i], 1<<i)));			
	}
	while(pd.size()) {
		pill v = (*pd.begin()).s;
		pd.erase(pd.begin());		
		if(was[v.f][v.s]) continue;
		was[v.f][v.s] = 1;
		for(auto u : g[v.f]) {
			for(auto msk : prec[v.s]) {
				if(dp[u.f][msk|v.s] > dp[u.f][msk] + u.s + dp[v.f][v.s]) {	
					dp[u.f][msk|v.s] = dp[u.f][msk] + u.s + dp[v.f][v.s];
					pd.insert(mp(dp[u.f][msk|v.s], mp(u.f, msk | v.s)));
				}						
			}
		}
	}
	ll ans = 1e17;
	for(int i = 1; i <= n; i++)
		ans = min(ans, dp[i][(1<<k) - 1]);
	cout << ans;
}   
  
/*
5 3 1
1 2 4 7 11
5 7 10
1 3 2
 
*/

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2589 ms 92376 KB Output is correct
2 Correct 2057 ms 81536 KB Output is correct
3 Correct 642 ms 51028 KB Output is correct
4 Correct 127 ms 14464 KB Output is correct
5 Correct 710 ms 53216 KB Output is correct
6 Correct 77 ms 12128 KB Output is correct
7 Correct 7 ms 3404 KB Output is correct
8 Correct 4 ms 3148 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 4812 KB Output is correct
2 Correct 16 ms 4300 KB Output is correct
3 Correct 9 ms 3532 KB Output is correct
4 Correct 12 ms 3992 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6076 ms 214100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

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