HDU 6071 Lazy Running(同余最短路)

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
ll d[5];
struct node{
	int x,y;ll dis;
	node(){}node(int _x,int _y,ll _dis){x=_x;y=_y;dis=_dis;}
	bool operator <(const node &a)const{dis>a.dis;}
};
priority_queue<node>q;
vector<ll>v;
ll dis[5][60005],vis[5][60005],md;
void dij(){
	q.push(node(2,0,0));
	dis[2][0]=0;
	while(!q.empty()){
		node now=q.top();q.pop();
		int x=now.x,y=now.y;
		if(vis[x][y])continue;
		vis[x][y]=1;
		int to;ll w;
		w=d[x];to=(x%4)+1;
		if(dis[to][(y+w)%md]==-1||dis[to][(y+w)%md]>dis[x][y]+w){
			dis[to][(y+w)%md]=dis[x][y]+w;
			q.push(node(to,(y+w)%md,dis[x][y]+w));
		}
		to=x-1>=1?x-1:4;w=d[to];
		if(dis[to][(y+w)%md]==-1||dis[to][(y+w)%md]>dis[x][y]+w){
			dis[to][(y+w)%md]=dis[x][y]+w;
			q.push(node(to,(y+w)%md,dis[x][y]+w));
		}
	}
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--){
		memset(dis,-1,sizeof(dis));
		memset(vis,0,sizeof(vis));
		ll k;
		scanf("%lld",&k);for(int i=1;i<=4;i++)scanf("%lld",&d[i]);
		ll ans=(ll)2e18;
		md=2*min(d[1],d[2]);
		dij();
		for(int i=0;i<md;i++){
			if(dis[2][i]!=-1){
				if(dis[2][i]>=k)ans=min(dis[2][i],ans);
				else {
					ans=min(ans,(k-dis[2][i]+md-1)/md*md+dis[2][i]);
				}
			}
		}
		printf("%lld\n",ans);
	}	
	return 0;
}

  https://post.icpc-camp.org/d/674-poi-x-sums

#include<stdio.h>
#include<string.h>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=5005;
const int INF=(int)1e9+7;

struct node{
	int x,y;
	node(){}node(int _x,int _y){x=_x;y=_y;}
	bool operator < (const node &a)const{return y>a.y;}
};
priority_queue<node>q;
int a[MAXN];
int dis[50005],vis[50005];
void dij(int n){
	q.push(node(0,0));
	while(!q.empty()){
		node now=q.top();q.pop();
		int x=now.x,y=now.y;
		if(vis[x])continue;
		vis[x]=1;
		for(int i=1;i<=n;i++){
			if(dis[(x+a[i])%a[1]]>dis[x]+a[i]){
				dis[(x+a[i])%a[1]]=dis[x]+a[i];
				q.push(node((x+a[i])%a[1],dis[x]+a[i]));
			}
		}
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	sort(a+1,a+1+n);
	for(int i=1;i<a[1];i++)dis[i]=INF;	
	dij(n);
	int q;
	scanf("%d",&q);
	while(q--){
		int x;
		scanf("%d",&x);
		if(dis[x%a[1]]<=x)printf("TAK\n");
		else printf("NIE\n");
	}
	return 0;
}