POJ 题目3159 Candies(差分约束)

原创 2015年07月07日 00:18:48
Candies
Time Limit: 1500MS   Memory Limit: 131072K
Total Submissions: 24721   Accepted: 6699

Description

During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the kids loved candies very much and often compared the numbers of candies they got with others. A kid A could had the idea that though it might be the case that another kid B was better than him in some aspect and therefore had a reason for deserving more candies than he did, he should never get a certain number of candies fewer than B did no matter how many candies he actually got, otherwise he would feel dissatisfied and go to the head-teacher to complain about flymouse’s biased distribution.

snoopy shared class with flymouse at that time. flymouse always compared the number of his candies with that of snoopy’s. He wanted to make the difference between the numbers as large as possible while keeping every kid satisfied. Now he had just got another bag of candies from the head-teacher, what was the largest difference he could make out of it?

Input

The input contains a single test cases. The test cases starts with a line with two integers N and M not exceeding 30 000 and 150 000 respectively. N is the number of kids in the class and the kids were numbered 1 through N. snoopy and flymouse were always numbered 1 and N. Then follow M lines each holding three integers A, B and c in order, meaning that kid A believed that kid B should never get over c candies more than he did.

Output

Output one line with only the largest difference desired. The difference is guaranteed to be finite.

Sample Input

2 2
1 2 5
2 1 4

Sample Output

5

Hint

32-bit signed integer type is capable of doing all arithmetic.

Source

POJ Monthly--2006.12.31, Sempr

题目大意:

给n个人派糖果,给出m组数据,每组数据包含A,B,c  三个数,
意思是A的糖果数比B少的个数不多于c,即B的糖果数 - A的糖果数<= c 。
最后求n 比 1 最多多多少糖果。
用STL的queue会超时
ac代码
#include<stdio.h>
#include<string.h>
#include<queue>
#include<iostream>
#define INF 0xfffffff
using namespace std;
int head[30030],vis[30030],cnt,dis[30030],n,m,q[30030];
struct s
{
	int u,v,w,next;
}edge[150010];
void add(int u,int v,int w)
{
	edge[cnt].u=u;
	edge[cnt].v=v;
	edge[cnt].w=w;
	edge[cnt].next=head[u];
	head[u]=cnt++;
}
void spfa(int s,int to)
{
	int i,top;
	top=0;
	for(i=1;i<=n;i++)
	{
		if(i==s)
		{
			vis[i]=1;
			dis[i]=0;
			q[top++]=i;
		}
		else
		{
			vis[i]=0;
			dis[i]=INF;
		}
	}
	while(top!=0)
	{
		int u=q[top-1];
		top--;
		vis[u]=0;
		for(i=head[u];i!=-1;i=edge[i].next)
		{
			int v=edge[i].v;
			int w=edge[i].w;
			if(dis[v]>dis[u]+w)
			{
				dis[v]=dis[u]+w;
				if(!vis[v])
				{
					vis[v]=1;
					q[top++]=v;
				}
			}
		}
	}
}
int main()
{
	//int n,m;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		memset(head,-1,sizeof(head));
		cnt=0;
		while(m--)
		{
			int a,b,c;
			scanf("%d%d%d",&a,&b,&c);
			add(a,b,c);
		}
		spfa(1,n);
		printf("%d\n",dis[n]);
	}
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

poj 3159 Candies 【简单差分约束】 【SPFA + 数组模拟栈】

Candies Time Limit: 1500MS   Memory Limit: 131072K Total Submissions: 25010   Acce...

poj 3159 Candies(差分约束原理 最短路)

题意:不懂差分约束的请看我转载的一篇差分约束详解http://blog.csdn.net/kirito_j/article/details/52132170 看完那个链接你们就懂了,在型如x-y...

POJ 3159 Candies 还是差分约束(栈的SPFA)

n个小朋友分糖果,你要满足他们的要求(a b x 意思为b不能超过a x个糖果)并且编号1和n的糖果差距要最大。...

poj3159Candies_差分约束系统解决_转换(spfa算法)

真是迷之题啊,第一次用vector超时,不知道是怎么回事!了解数组实现邻接表 题目链接 题意: 给n个人派糖果,给出m组数据,每组数据包含A,B,c 三个数, 意思是B不能比A多超过C个,即B-...

POJ3159 Candies(差分约束 PS:此题spfa+队列过不了,spfa + stack才能过)

Candies Time Limit: 1500MS   Memory Limit: 131072K Total Submissions: 25914   Accepted: 7074 ...

POJ 3159 Candies(差分约束 转spfa+stack 求最短路径)

POJ 3159 Candies(差分约束 转spfa+stack 求最短路径)

POJ 3159 Candies (差分约束 Dijkstra+优先队列 SPFA+栈)

During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher b...

POJ 3159-Candies(差分约束系统-SPFA+邻接表)

Candies Time Limit: 1500MS   Memory Limit: 131072K Total Submissions: 31137   Acce...
  • MIKASA3
  • MIKASA3
  • 2017年04月26日 16:06
  • 174

poj3159 Candies--单源最短路径&差分约束

原题链接: http://poj.org/problem?id=3159 一:原题内容 Description During the kindergarten days, f...
  • LaoJiu_
  • LaoJiu_
  • 2016年03月31日 16:08
  • 229

POJ3159 Candies(差分约束)

题意:给n个人分糖果,下标1到n,给出m个约束条件a b c,a的糖果数比b的糖果少的个数不多于c,即 b的糖果-a的糖果 思路:查分约束系统的第一题,b-a 题目没有负权,因此可以用Dijkst...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 题目3159 Candies(差分约束)
举报原因:
原因补充:

(最多只允许输入30个字)