oj.uz

Submission #487391

# Submission time Handle Problem Language Result Execution time Memory
487391 2021-11-15T11:12:47 Z Koosha_mv Cities (BOI16_cities) C++14
74 / 100
 6000 ms 43200 KB 
#include <bits/stdc++.h>
using namespace std;
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define print(v,r) f(i,0,r) cout<<v[i]<<" "; cout<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define Add(x,y) x=(x+y)%mod
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=2e5+99,K=5;
const ll inf=1e15;
 
int n,k,m,a[N],imp[N],col[N];
ll ans=inf,dp[N][(1<<K)];
vector<int> v[(1<<K)];
vector<pair<int,int> > g[N];
set<pair<ll,int> > s;
 
void build(){
	f(mask1,0,(1<<k)){
		f(mask2,0,(1<<k)){
			if(((mask1&mask2)==0)){
				v[mask1].pb(mask2);
			}
		}
	}
}
void upd(int u,int mask,ll x,int mk){
	if(dp[u][mask]<=x) return ;
	if(mask==mk) s.erase(mp(dp[u][mask],u));
	dp[u][mask]=x;
	if(mask==mk) s.insert(mp(dp[u][mask],u));	
}
void solve(int mk){
	s.clear();
	f(i,1,n+1){
		s.insert(mp(dp[i][mk],i));
	}
	while(s.size()){
		pair<ll,int> p=*s.begin();
		int u=p.S,mask=mk;
		s.erase(p);
		f(i,0,g[u].size()){
			f(j,0,1){
				int nmask=v[mask][j];
				//upd(u,mask|nmask,dp[u][mask]+dp[g[u][i].F][nmask]+g[u][i].S,mk);
				upd(g[u][i].F,mask|nmask,dp[u][mask]+dp[g[u][i].F][nmask]+g[u][i].S,mk);
			}
		}
	}
	f(i,1,n+1){
		int u=i,mask=mk;
		f(i,0,g[u].size()){
			f(j,1,v[mask].size()){
				int nmask=v[mask][j];
				upd(u,mask|nmask,dp[u][mask]+dp[g[u][i].F][nmask]+g[u][i].S,mk);
				upd(g[u][i].F,mask|nmask,dp[u][mask]+dp[g[u][i].F][nmask]+g[u][i].S,mk);
			}
		}
	}
}

main(){
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);	
	fill(col,col+N,-1);
	cin>>n>>k>>m;
	build();
	f(i,0,k){
		cin>>imp[i];
		col[imp[i]]=i;
	}
	f(i,0,m){
		int u,v,c;
		cin>>u>>v>>c;
		g[u].pb(mp(v,c));
		g[v].pb(mp(u,c));
	}
	f(i,1,n+1){
		f(mask,0,(1<<k)){
			dp[i][mask]=inf;
		}
	}
	f(i,1,n+1){
		if(col[i]==-1){
			dp[i][0]=0;
		}
		else{
			dp[i][(1<<col[i])]=0;
		}
	}
	f(mask,0,(1<<k)){
		solve(mask);
	}
	f(i,1,n+1){
		minm(ans,dp[i][(1<<k)-1]);
	}
	cout<<ans;
}

Compilation message

cities.cpp: In function 'void solve(int)':
cities.cpp:7:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   53 |   f(i,0,g[u].size()){
      |     ~~~~~~~~~~~~~~~            
cities.cpp:53:3: note: in expansion of macro 'f'
   53 |   f(i,0,g[u].size()){
      |   ^
cities.cpp:7:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   63 |   f(i,0,g[u].size()){
      |     ~~~~~~~~~~~~~~~            
cities.cpp:63:3: note: in expansion of macro 'f'
   63 |   f(i,0,g[u].size()){
      |   ^
cities.cpp:7:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   64 |    f(j,1,v[mask].size()){
      |      ~~~~~~~~~~~~~~~~~~        
cities.cpp:64:4: note: in expansion of macro 'f'
   64 |    f(j,1,v[mask].size()){
      |    ^
cities.cpp: At global scope:
cities.cpp:73:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   73 | main(){
      | ^~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Correct 3 ms 5708 KB Output is correct
3 Correct 3 ms 5708 KB Output is correct
4 Correct 4 ms 5836 KB Output is correct
5 Correct 3 ms 5812 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1847 ms 43124 KB Output is correct
2 Correct 1760 ms 42936 KB Output is correct
3 Correct 972 ms 40236 KB Output is correct
4 Correct 153 ms 10580 KB Output is correct
5 Correct 816 ms 43200 KB Output is correct
6 Correct 102 ms 10488 KB Output is correct
7 Correct 9 ms 6184 KB Output is correct
8 Correct 7 ms 6092 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 6176 KB Output is correct
2 Correct 15 ms 6192 KB Output is correct
3 Correct 9 ms 6160 KB Output is correct
4 Correct 11 ms 5964 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3542 ms 43180 KB Output is correct
2 Correct 3734 ms 42848 KB Output is correct
3 Correct 2076 ms 40260 KB Output is correct
4 Correct 2149 ms 26876 KB Output is correct
5 Correct 557 ms 13488 KB Output is correct
6 Correct 359 ms 12252 KB Output is correct

Subtask #5
0 / 26.0

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