hdu1531King【差分约束系统】

Problem Description

Once, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was a sound king.'' After nine months her child was born, and indeed, she gave birth to a nice son.
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.

 

Input

The input consists of blocks of lines. Each block except the last corresponds to one set of problems and king's decisions about them. In the first line of the block there are integers n, and m where 0 < n <= 100 is length of the sequence S and 0 < m <= 100 is the number of subsequences Si. Next m lines contain particular decisions coded in the form of quadruples si, ni, oi, ki, where oi represents operator > (coded as gt) or operator < (coded as lt) respectively. The symbols si, ni and ki have the meaning described above. The last block consists of just one line containing 0.

 

Output

The output contains the lines corresponding to the blocks in the input. A line contains text successful conspiracy when such a sequence does not exist. Otherwise it contains text lamentable kingdom. There is no line in the output corresponding to the last ``null'' block of the input.

 

Sample Input

   
   
   
   

    
    
    
    4 2
1 2 gt 0
2 2 lt 2
1 2
1 0 gt 0
1 0 lt 0
0
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    lamentable kingdom
successful conspiracy
   
   
   
   

 

Source

Central Europe 1997
真心觉得国外的题简单QAQ

 

Recommend

LL   |   We have carefully selected several similar problems for you:   1384  1535  1534  1317  1217

这是一个题意不明害死人的题==si是什么鬼？接到a后面表示下标，呵呵呵呵，而且数据不严谨

说题意：给出a_si+a_si+1+…+a_si+n大于或者小于ki（哈哈哈，那个下标我是用下标标签写的）那么设从a[1]到a[i]的和为一个数，把它转化成最长路或者最短路都可做。为什么说他不严谨呢？我调用spfa()的时候点的个数代入n+2或者n+1结果都对，正常来说应该是n+2个点 算上了另外加的源点的。还有特别注意的一点是每个点都必须和源点连边的

/*******************
hdu1531
2016.3.2
0MS	1740K	1828 B	C++
*******************/
#include <iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int inf=0x3f3f3f3f;
const int maxn=500;
struct Edge
{
    int v,cost;
    Edge(int _v=0,int _cost=0):v(_v),cost(_cost){}
};
vector<Edge>E[maxn];
void addedge(int u,int v,int w)
{
    E[u].push_back(Edge(v,w));
}
bool vis[maxn];
int cnt[maxn];
int dist[maxn];
bool spfa(int start,int n)
{
    memset(vis,false,sizeof(vis));
    memset(dist,-inf,sizeof(dist));
    vis[start]=true;
    dist[start]=0;
    queue<int>que;
    while(!que.empty()) que.pop();
    que.push(start);
    memset(cnt,0,sizeof(cnt));
    cnt[start]=1;
    while(!que.empty())
    {
        int u=que.front();
        que.pop();
        vis[u]=false;
        for(int i=0;i<E[u].size();i++)
        {
            int v=E[u][i].v;
            if(dist[v]<dist[u]+E[u][i].cost)
            {
                dist[v]=dist[u]+E[u][i].cost;
                if(!vis[v])
                {
                    vis[v]=true;
                    que.push(v);
                    if(++cnt[v]>n) return false;
                }
            }
        }
    }
    return true;
}
int main()
{
 //   freopen("cin.txt","r",stdin);
    int n,m,si,ni,ki;
    char oi[4];
    while(~scanf("%d",&n)&&n)
    {
        scanf("%d",&m);
        for(int i=0;i<=n+2;i++) E[i].clear();
        while(m--)
        {
            scanf("%d%d%s%d",&si,&ni,oi,&ki);
            if(oi[0]=='g') addedge(si-1,si+ni,ki+1);
            else addedge(si+ni,si-1,1-ki);
        }
        for(int i=0;i<=n;i++)addedge(n+1,i,0);
        if(spfa(n+1,n+2)) puts("lamentable kingdom");
        else puts("successful conspiracy");
    }
    return 0;
}