牛客IOI周赛26-普及组 最短路

Posted 2021-06-24 爷灬傲奈我何123

link:https://ac.nowcoder.com/acm/problem/219918

思路：
建立虚拟原点 31个点，如果a[i]>>k&1 就和k连一条边权为a[i]的无向边，比赛时候没想到这种建图=-=。

// Problem: 最短路
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/11233/D
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define IL inline
#define x first
#define y second
typedef long long ll;
using namespace std;
const int N=200010;
const int M=1000010;
const ll inf=0x3f3f3f3f3f3f3f3f;
int h[N],e[M],ne[M],idx,w[M];
ll dist[N];
int a[N];
void add(int a,int b,int c)
{
	e[idx]=b,ne[idx]=h[a],w[idx]=c,h[a]=idx++;
}
bool st[N];
void dijkstra()
{
	priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>>q;
	q.push({0,1});
	dist[1] = 0;
	while(q.size())
	{
		auto t  = q.top();
		q.pop();
		if(st[t.y])	continue;
		st[t.y]=1;
		for(int i=h[t.y];~i;i=ne[i])
		{
			int  j = e[i];
			if(dist[j]>dist[t.y]+w[i])
			{
				dist[j]=dist[t.y]+w[i];
				q.push({dist[j],j});
			}
		}
	}
}
int main()
{
	memset(h,-1,sizeof h);
	int n;
	cin >> n ;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=n;i++)
		for(int j=0;j<=30;j++)
			if(a[i]>>j&1)
				add(i,j+n+1,a[i]),add(j+n+1,i,a[i]);
		memset(dist,0x3f,sizeof dist);
		dijkstra();
	for(int i=1;i<=n;i++)
		if(dist[i]==inf)
			cout<<-1<<" ";
		else
		cout<<dist[i]<<" ";
    return 0;
}