oj.uz

Submission #967514

# Submission time Handle Problem Language Result Execution time Memory
967514 2024-04-22T09:50:27 Z thunopro Cities (BOI16_cities) C++14
100 / 100
 1651 ms 72392 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 
#define TIME (1.0*clock()/TIME_PERS_SEC) 
#define re exit(0); 

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ;} 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ;} 

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
}

mt19937 rng (time(0)) ; 

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}
int n , k , m ; 
int imp [maxn] ; 
vii adjList [maxn] ; 

ll dp [34][maxn] ; 

struct shape {
	int u ; 
	ll d ; 
	bool operator < ( const shape &o ) const 
	{
		return d > o.d ; 
	}
};
void dijkstra ( ll dp [] ) 
{
	priority_queue<shape> S ; 
	for ( int i = 1 ; i <= n ; i ++ ) S . push ({i,dp[i]}) ; 
	while ( !S.empty() ) 
	{
		shape t = S.top() ; S.pop() ; 
		int u = t.u ; 
		for ( auto x : adjList [u] ) 
		{
			int v = x.fi , w = x.se ; 
			if ( dp [v] > dp [u] + w ) S . push ({v,dp[v]=dp[u]+w}) ; 
		}
	}
}
int main ()
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 
	cin >> n >> k >> m ; 
	for ( int i = 0 ; i < k ; i ++ ) cin >> imp [i] ; 
	for ( int i = 1 ; i <= m ; i ++ ) 
	{
		int u , v , w ; cin >> u >> v >> w ; 
		adjList [u] . pb ({v,w}) ; 
		adjList [v] . pb ({u,w}) ;
	}
		
	memset ( dp , 0x3f , sizeof dp ) ; 
	for ( int i = 0 ; i < k ; i ++ ) dp [1<<i][imp[i]] = 0 ; 

	for ( int mask = 1 ; mask < (1<<k) ; mask ++ ) 
	{
		for ( int i = 1 ; i <= n ; i ++ ) for ( int sub_mask = mask ; sub_mask ; sub_mask = (sub_mask-1)&mask ) 
		{
			chkmin (dp[mask][i],dp[sub_mask][i]+dp[mask^sub_mask][i]) ; 
		}
		dijkstra (dp[mask]) ; 
	}
	
	cout << *min_element(dp[(1<<k)-1] + 1 , dp[(1<<k)-1] + n) ; 
}

Compilation message

cities.cpp: In function 'void rf()':
cities.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 58200 KB Output is correct
2 Correct 8 ms 58204 KB Output is correct
3 Correct 8 ms 58200 KB Output is correct
4 Correct 9 ms 58204 KB Output is correct
5 Correct 8 ms 58204 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 71780 KB Output is correct
2 Correct 373 ms 71492 KB Output is correct
3 Correct 231 ms 65320 KB Output is correct
4 Correct 58 ms 63000 KB Output is correct
5 Correct 187 ms 71500 KB Output is correct
6 Correct 54 ms 62916 KB Output is correct
7 Correct 10 ms 58460 KB Output is correct
8 Correct 9 ms 58460 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 58460 KB Output is correct
2 Correct 12 ms 58460 KB Output is correct
3 Correct 10 ms 58456 KB Output is correct
4 Correct 10 ms 58380 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 781 ms 71884 KB Output is correct
2 Correct 719 ms 71136 KB Output is correct
3 Correct 441 ms 65120 KB Output is correct
4 Correct 439 ms 67976 KB Output is correct
5 Correct 127 ms 64736 KB Output is correct
6 Correct 87 ms 64780 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1594 ms 72392 KB Output is correct
2 Correct 1651 ms 71984 KB Output is correct
3 Correct 1513 ms 71184 KB Output is correct
4 Correct 970 ms 65416 KB Output is correct
5 Correct 769 ms 67736 KB Output is correct
6 Correct 197 ms 64660 KB Output is correct
7 Correct 84 ms 64776 KB Output is correct