Submission #1272269

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272269		lioow	Voting Cities (NOI22_votingcity)	C++20	100 / 100	74 ms	8552 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define ld long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
#define pil pair<int,int>
#define p3 pair<int,pii>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
//const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
  if(e==0) return 1;
  int tmp=expo(b,e/2);
  if(e%2) return mul(tmp,mul(tmp,b));
  else return mul(tmp,tmp);
}
const int maxn=100005;
const int N=1e5;

vector<pii>adj[5000];
void solve(){
	int n,e,k;cin>>n>>e>>k;
	vector<int>ada(k+1);
	repp(i,1,k){
		cin>>ada[i];
	}
	repp(i,1,e){
		int u,v,w;cin>>u>>v>>w;
		adj[v].pb({u,w});
	}
	vector<vector<int>>dist(n,vector<int>(1<<5,INF));
	priority_queue<p3,vector<p3>,greater<p3>>pq;
	repp(i,1,k){
		pq.push({0,{ada[i],0}});
		dist[ada[i]][0]=0;
	}
	while(!pq.empty()){
		int dis=pq.top().fi;
		auto[x,mask]=pq.top().se;pq.pop();
		if(dis!=dist[x][mask]) continue;
		// gapake
		for(auto[v,w]:adj[x]){
			if(dist[v][mask]>dis+w){
				dist[v][mask]=dis+w;
				pq.push({dis+w,{v,mask}});
			}
		}
		repp(j,0,4){
			if(!(mask&(1<<j))){
				int ah=mask^(1<<j);
				for(auto [v,w]:adj[x]){
					int diss=dis+w/10*(10-(j+1));
					if(dist[v][ah]>diss){
						dist[v][ah]=diss;
						pq.push({diss,{v,ah}});
					}
				}
			}
		}
	}
	int q;cin>>q;
	while(q--){
		int st;cin>>st;
		int a[5];
		repp(j,0,4) cin>>a[j];
		int ans=INF;
		repp(kk,0,(1<<5)-1){
			int sum=0;
			bool tr=1;
			repp(i,0,4){
				if(kk&(1<<i)){
					if(a[i]==-1){
						tr=0;
						break;
					}
					sum+=a[i];
				}
			}
			if(!tr) continue;
			ans=min(ans,dist[st][kk]+sum);
		}
		cout<<(ans==INF?-1:ans)<<endl;
	}
}

signed main(){
  liow;
  int t=1;
 // cin>>t;
  while(t--){
    solve();
  }
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 10 / 10
• Subtask 7: 15 / 15
• Subtask 8: 50 / 50