【差分约束】zoj两题

关注

原创最新推荐文章于 2020-03-07 20:40:34 发布 538 阅读 AI 写同款· GEO 优化 ›

差分约束系统，出纳员的雇佣 Tehran的一家每天24小时营业的超市，需要一批出纳员来满足它的需要。超市经理雇佣你来帮他解决问题：超市在每天的不同时段需要不同数目的出纳员（例如：午夜时只需一小批，而下午则需要很多）来为顾客提供优质服务。他希望雇佣最少数目的出纳员。经理已经提供你一天的每一小时需要出纳员的最少数量——R(0), R(1), …, R(23)。R（0）表示从午夜到上午1：00需要出纳员的最少数目，R（1）表示上阅读详情

【我是为了写总结...求轻虐...】

zoj1420(出纳员雇佣)

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1420

code

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<climits>
#include<cctype>
#define maxe 20005
#define maxq 1000

using namespace std;

int n, r[25], p[25], que[maxq], tim[25], dis[25], head, tail, ans;
bool iq[25];

int t[maxe], c[maxe], nt[maxe], h[25], tot;

void adde(int a, int b, int x)
{
	t[tot] = b; c[tot] = x; 
	nt[tot] = h[a]; h[a] = tot++;
}

bool relax(int a, int b, int x)
{
	if (dis[a] + x > dis[b])
	{
		dis[b] = dis[a] + x; if (!iq[b]) return 1;
	}
	return 0;
}

bool spfa(int ans)
{
	int i;
	tot = 1;
	memset(h, 0, sizeof(h));
	memset(iq, 0, sizeof(iq));
	memset(tim, 0, sizeof(tim));
	for (i = 1; i <= 24; i++) dis[i] = -1000000000;
	for (i = 1; i <= 24; i++) 
		adde(i, i - 1, -p[i]) ,adde(i - 1, i, 0);
	for (i = 1; i <= 8; i++) 
		adde(i + 16, i, r[i] - ans);
	for (i = 9; i <= 24; i++) 
		adde(i - 8, i, r[i]);
	adde(0, 24, ans);
	head = 1, tail = 1;
	dis[0] = 0; que[1] = 0; iq[0] = 1; tim[0] = 1;
	int p, qt, q;
	while (head <= tail)
	{
		p = que[head];
		iq[p] = 0;
		for (q = h[p]; q; q = nt[q])
			if (relax(p, t[q], c[q]))
			{
				qt = t[q]; iq[qt] = 1;
				if (++tim[qt] > 24) return 0;
				if (++tail > maxq) tail = 1;
				que[tail] = qt;
			}
		if (++head > maxq) head = 1;
	}
	if (dis[24] == ans) return 1;
		else return 0;
}

bool getans()
{
	for(ans = 0; ans <= n; ans++) if (spfa(ans)) return 1;
	return 0;
}

int main()
{
	freopen("test.in", "r", stdin);
	freopen("test.out", "w", stdout);
	int stime, i, ad;
	scanf("%d", &stime);
	while(stime--)
	{
		for (i = 1; i <= 24; i++) scanf("%d", &r[i]);
		scanf("%d", &n);
		for (i = 1; i <= n; i++) 
		{
			scanf("%d", &ad);
	   	++p[ad + 1];
		}
		if (getans()) printf("%d\n", ans); else puts("No Solution");
	}
	return 0;
}

zoj2770 火烧连营

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2770

code:

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<cctype>
#define maxn 10100
#define maxm 10010
#define maxe 50010
using namespace std;

int i, j, k, n, m, c, tot = 0, h[maxn], nt[maxe], t[maxe], len[maxe], que[maxn + 10], tim[maxn];
long long dis[maxn];
bool iq[maxn];

void adde(int a, int b, int c)
{
	t[++tot] = b; nt[tot] = h[a]; h[a] = tot; len[tot] = c;
}

bool spfa()
{
	int head, tail, p, q;
	for (int i = 0; i <= n; i++) 
	{
		iq[i] = 1;
		tim[i] = 1;
		que[i + 1] = i;
		dis[i] = 0;
	}
	tail = n + 1; head = 1;
	while (head <= tail)
	{
		p = que[head];	iq[p] = 0;		
		for(q = h[p]; ~q; q = nt[q])
			if (dis[p] + len[q] < dis[t[q]])
			{
				int tq = t[q];
				dis[tq] = dis[p] + len[q];
				if (!iq[tq])
				{
					++tail; if (tail > maxn) tail = 0;
					que[tail] = tq; iq[tq] = 1; 
					if (++tim[tq] > n + 2) return 0;
				}
			}
		++head; if (head > maxn) head = 0;
	}
	return 1;
}

int main()
{
   while (scanf("%d%d\n", &n, &m) != EOF)
   {
		tot = 0;
		memset(h, -1, sizeof h);
	   for (i = 1; i <= n; ++i)
		   scanf("%d", &c), adde(i - 1, i, c), adde(i, i - 1, 0);
	   while(m--) 
		   scanf("%d%d%d", &i, &j, &k), adde(j, i - 1, -k);
	   if (spfa()) printf("%d\n", - dis[0]);
			else puts("Bad Estimations");
   }
   return 0;
}