題干：

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

題目大意：

n個(gè)數(shù)的一個(gè)序列，m個(gè)約束，si, ni, oi, ki, 代表了序列中第si個(gè)數(shù)到第si+ni、個(gè)數(shù)的和大于或小于ki，gt = 大于，lt = 小于

解題報(bào)告：

? 跟【POJ - 1201】Intervals，這題差不多。同樣是注意判無解的時(shí)候要建一個(gè)超級(jí)源點(diǎn)和所有點(diǎn)連邊，因?yàn)檫@樣的話，只需要跑一遍SPFA就可以了。不然的話你需要枚舉每一個(gè)點(diǎn)為起點(diǎn)進(jìn)行SPFA，因?yàn)閳D不一定是個(gè)連通圖。比如沒有對(duì)1號(hào)點(diǎn)的約束，那么1號(hào)點(diǎn)就是單獨(dú)一個(gè)連通塊的。

AC代碼：

#include<cstdio> #include<iostream> #include<algorithm> #include<queue> #include<map> #include<vector> #include<set> #include<string> #include<cmath> #include<cstring> #define F first #define S second #define ll long long #define pb push_back #define pm make_pair using namespace std; const int MAX = 2000 + 5; const int INF = 0x3f3f3f3f; int n,m; int tot,head[MAX]; struct Edge {int v,ne,w; } e[MAX<<4]; void add(int u,int v,int w) {e[++tot].v = v;e[tot].w = w;e[tot].ne = head[u];head[u] = tot; } int vis[MAX],dis[MAX],cnt[MAX]; int spfa(int st) {for(int i = 0; i<=n+1; i++) dis[i]=-INF,vis[i]=cnt[i]=0;queue<int> q;q.push(st);vis[st]=1,dis[st]=0;while(q.size()) {int cur = q.front();q.pop();vis[cur] = 0;for(int i = head[cur]; ~i; i = e[i].ne) {int v = e[i].v;if(dis[v] < dis[cur] + e[i].w) {dis[v] = dis[cur] + e[i].w;if(vis[v] == 0) {vis[v] = 1;cnt[v]++;if(cnt[v] > n) return 0;q.push(v);}}}}return 1; } int main() {char op[4];while(~scanf("%d",&n)) {if(n == 0) break;scanf("%d",&m);tot=0;memset(head,-1,sizeof head);for(int x,y,z,i = 1; i<=m; i++) {scanf("%d%d%s%d",&x,&y,op,&z);if(op[0] == 'g') add(x-1,x+y,z+1); else add(x+y,x-1,1-z);}for(int i = 0; i<=n; i++) {add(n+1,i,0);}if(spfa(n+1) == 0) printf("successful conspiracy\n");else printf("lamentable kingdom\n");}return 0 ; }

AC代碼：

?

總結(jié)

以上是生活随笔為你收集整理的【POJ - 1364】King（差分约束判无解）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。