King
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1645 Accepted Submission(s): 764
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.
1 2 gt 0
2 2 lt 2
1 2
1 0 gt 0
1 0 lt 0
0
successful conspiracy
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#define clr(x) memset(x,0,sizeof(x))
#define clr_1(x) memset(x,-1,sizeof(x))
#define clrmax(x) memset(x,0x3f3f3f3f,sizeof(x))
#define clrmin(x) memset(x,-0x3f3f3f3f,sizeof(x))
using namespace std;
struct node
{
int to,val,next;
}edge[];
int head[];
int dis[];
int inf[];
int in[];
char s[];
int n,m,cnt,from,to,k,num;
bool spfa(int s);
void addedge(int from,int to,int val);
int main()
{
while(scanf("%d",&n)!=EOF && n>)
{
scanf("%d",&m);
clr_1(head);
clrmin(dis);
clr(inf);
clr(in);
cnt=;
for(int i=;i<=m;i++)
{
scanf("%d%d%s%d",&from,&to,s,&k);
if(s[]=='g')
{
addedge(from-,from+to,k+);
inf[from-]=;
inf[from+to]=;
}
else
{
addedge(from+to,from-,-k);
inf[from-]=;
inf[from+to]=;
}
}
num=;
for(int i=;i<=n;i++)
{
if(inf[i])
{
addedge(n+,i,);
num++;
}
}
num++;
clr(inf);
if(spfa(n+))
printf("lamentable kingdom\n");
else
printf("successful conspiracy\n");
}
return ;
}
void addedge(int from,int to,int val)
{
edge[++cnt].val=val;
edge[cnt].to=to;
edge[cnt].next=head[from];
head[from]=cnt;
return ;
}
bool spfa(int s)
{
queue<int> Q;
dis[s]=;
inf[s]=in[s]=;
Q.push(s);
int v,k;
while(!Q.empty())
{
v=Q.front();
Q.pop();
inf[v]=;
for(int i=head[v];i!=-;i=edge[i].next)
{
if(dis[v]+edge[i].val>dis[edge[i].to])
{
dis[edge[i].to]=dis[v]+edge[i].val;
if(!inf[edge[i].to])
{
Q.push(edge[i].to);
inf[edge[i].to]=;
if(++in[edge[i].to]>num)
return ;
}
}
}
}
return ;
}