HDU1531 差分约束
King
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1564 Accepted Submission(s): 727
Unfortunately, as it used to happen in royal families, the son was a little retarded. After many years of study he was able just to add integer numbers and to compare whether the result is greater or less than a given integer number. In addition, the numbers had to be written in a sequence and he was able to sum just continuous subsequences of the sequence.
The old king was very unhappy of his son. But he was ready to make everything to enable his son to govern the kingdom after his death. With regards to his son's skills he decided that every problem the king had to decide about had to be presented in a form of a finite sequence of integer numbers and the decision about it would be done by stating an integer constraint (i.e. an upper or lower limit) for the sum of that sequence. In this way there was at least some hope that his son would be able to make some decisions.
After the old king died, the young king began to reign. But very soon, a lot of people became very unsatisfied with his decisions and decided to dethrone him. They tried to do it by proving that his decisions were wrong.
Therefore some conspirators presented to the young king a set of problems that he had to decide about. The set of problems was in the form of subsequences Si = {aSi, aSi+1, ..., aSi+ni} of a sequence S = {a1, a2, ..., an}. The king thought a minute and then decided, i.e. he set for the sum aSi + aSi+1 + ... + aSi+ni of each subsequence Si an integer constraint ki (i.e. aSi + aSi+1 + ... + aSi+ni < ki or aSi + aSi+1 + ... + aSi+ni > ki resp.) and declared these constraints as his decisions.
After a while he realized that some of his decisions were wrong. He could not revoke the declared constraints but trying to save himself he decided to fake the sequence that he was given. He ordered to his advisors to find such a sequence S that would satisfy the constraints he set. Help the advisors of the king and write a program that decides whether such a sequence exists or not.
0
//运行spfa判断是否存在负环。注意题目中是b-a>c,b-a<c,差分约束要求>=或<=,因此要转化成b-a>=c+1,b-a<=c-1;
//可以都转换成>=的形式求最长路或<=的形式求最短路。加一个公共源点,每个点到他的距离为0。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int maxn=,inf=0x7fffffff;
struct node
{
int to,next,val;
} edge[maxn*];//!
int mark[maxn],head[maxn],tot,dis[maxn],n,m,cnt[maxn];
void add(int a,int b,int c)
{
edge[tot].to=b;
edge[tot].next=head[a];
edge[tot].val=c;
head[a]=tot++;
}
bool spfa(int s)
{
for(int i=;i<=n+;i++)
dis[i]=-inf;
memset(mark,,sizeof(mark));
memset(cnt,,sizeof(cnt));
queue<int>q;
dis[s]=;
mark[s]=;
cnt[s]++;
q.push(s);
while(!q.empty())
{
int u=q.front();
q.pop();
mark[u]=;
for(int i=head[u]; i!=-; i=edge[i].next)
{
int v=edge[i].to;
if(dis[v]<dis[u]+edge[i].val)
{
dis[v]=dis[u]+edge[i].val;
if(!mark[v])
{
cnt[v]++;
if(cnt[v]>n+) return false;//加上公共源点有n+2个点,入队n+2次时存在负环。
q.push(v);
mark[v]=;
}
}
}
}
return true;
}
int main()
{
while(scanf("%d",&n)&&n){
scanf("%d",&m);
char ch[];
int a,b,c;
memset(head,-,sizeof(head));
tot=;
for(int i=;i<m;i++){
scanf("%d%d%s%d",&a,&b,ch,&c);
if(ch[]=='g') add(a-,b+a,c+);
else add(b+a,a-,-c);
}
for(int i=;i<=n;i++) add(n+,i,);
if(spfa(n+)) printf("lamentable kingdom\n");
else printf("successful conspiracy\n");
}
return ;
}
最新文章
- Asp.net MVC5引用ExtJS6
- ORA-06552: PL/SQL: Compilation unit analysis terminated ORA-06553: PLS-553: character set name is not recognized
- python3版本安装
- [已解决] java.net.InetAddress.getHostName() 阻塞问题
- putty自动登录
- Android中log4j的运用
- 【转】VSync Count 垂直同步
- 从BufferedImage到InputStream,实现绘图后进行下载(生成二维码图片并下载)
- live555 for Android
- odd or even?
- 201521123001《Java程序设计》第5周学习总结
- MySQL查询结果复制到新表(更新、插入)
- Spring mvc中junit测试遇到com.mysql.jdbc.exceptions.jdbc4.MySQLSyntaxErrorException错误怎么解决
- OpenCV使用中的一些总结
- bottle源码
- 【jvisualvm远程监控配置】
- Spark中master与worker的进程RPC通信实现
- 接收Android数据 递归显示表格数据
- PTA (Advanced Level) 1007 Maximum Subsequence Sum
- UVa 1632 阿里巴巴(区间DP)