UVA 11111 Generalized Matrioshkas

Problem B - Generalized Matrioshkas

Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be opened in two halves, so that one finds another doll inside. Then this doll may be opened to find another one inside it. This can be repeated several times, till a final doll -that cannot be opened- is reached.

Recently, Vladimir realized that the idea of nesting dolls might be generalized to nesting toys. Indeed, he has designed toys that contain toys but in a more general sense. One of these toys may be opened in two halves and it may have more than one toy inside it. That is the new feature that Vladimir wants to introduce in his new line of toys.

Vladimir has developed a notation to describe how nesting toys should be constructed. A toy is represented with a positive integer, according to its size. More precisely: if when opening the toy represented by m we find the toys represented by n₁, n₂, ..., n_r, it must be true that n₁ + n₂ + ... + n_r < m. And if this is the case, we say that toy m contains directly the toys n₁, n₂, ..., n_r . It should be clear that toys that may be contained in any of the toys n₁, n₂, ..., n_r are not considered as directly contained in the toy m.

A generalized matrioshka is denoted with a non-empty sequence of non zero integers of the form:

a₁    a₂    ...    a_N

such that toy k is represented in the sequence with two integers - k and k, with the negative one occurring in the sequence first that the positive one.

For example, the sequence

-9     -7     -2    2     -3     -2     -1    1    2    3    7    9

represents a generalized matrioshka conformed by six toys, namely, 1, 2 (twice), 3, 7 and 9. Note that toy 7 contains directly toys 2and 3. Note that the first copy of toy 2 occurs left from the second one and that the second copy contains directly a toy 1. It would be wrong to understand that the first -2 and the last 2 should be paired.

On the other hand, the following sequences do not describe generalized matrioshkas:

• -9     -7     -2    2     -3     -1     -2    2    1    3    7    9
  because toy 2 is bigger than toy 1 and cannot be allocated inside it.

• -9     -7     -2    2     -3     -2     -1    1    2    3    7     -2    2    9
  because 7 and 2 may not be allocated together inside 9.

• -9     -7     -2    2     -3     -1     -2    3    2    1    7    9
  because there is a nesting problem within toy 3.

Your problem is to write a program to help Vladimir telling good designs from bad ones.

Input

The input file contains several test cases, each one of them in a separate line. Each test case is a sequence of non zero integers, each one with an absolute value less than 10⁷.

Output

Output texts for each input case are presented in the same order that input is read.

For each test case the answer must be a line of the form

:-) Matrioshka!

if the design describes a generalized matrioshka. In other case, the answer should be of the form

:-( Try again.

Sample Input

-9 -7 -2 2 -3 -2 -1 1 2 3 7 9
-9 -7 -2 2 -3 -1 -2 2 1 3 7 9
-9 -7 -2 2 -3 -1 -2 3 2 1 7 9
-100 -50 -6 6 50 100
-100 -50 -6 6 45 100
-10 -5 -2 2 5 -4 -3 3 4 10
-9 -5 -2 2 5 -4 -3 3 4 9

Sample Output

:-) Matrioshka!
:-( Try again.
:-( Try again.
:-) Matrioshka!
:-( Try again.
:-) Matrioshka!
:-( Try again.

题意： 给定一些玩具，每个玩具都是拆成2份，比如-9 和 9 代表一个容量9的玩具。  玩具里面可以套小的玩具。。 只要容量足够。。要求给定序列能不能成功组装。。

思路： 用栈的思想。 这题等同于括号平衡的高级版。。多一个容量的判断即可。。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct S
{
    int stack;
    long long value;
} s[100005];
int save[100005];
int save_n = 0;
int sb;
char c;
int top = 0;
int judge = 0;

int main()
{
    memset(s, 0 , sizeof(s));
    memset(save, 0 , sizeof(save));
    s[0].stack = 999999999;
    while (scanf("%d%c", &save[save_n ++], &c) != EOF)
    {
	if (c == '\n')
	{
	    for (int i = 0; i < save_n; i ++)
	    {
		if (save[i] + s[top].stack == 0)
		{
		    s[top --].stack = 0;
		    s[top].value += abs(save[i]);
		    if (s[top].value >= abs(s[top].stack))
		    {
			judge = 1;
			break;
		    }
		}
		else
		{
		    top ++;
		    s[top].stack = save[i];
		    s[top].value = 0;
		}
	    }
	    if (top)
		judge = 1;
	    if (judge)
		printf(":-( Try again.\n");
	    else
		printf(":-) Matrioshka!\n");
	    memset(save, 0 , sizeof(save));
	    memset(s, 0 , sizeof(s));
	    s[0].stack = 999999999;
	    save_n = 0;
	    judge = 0;
	    top = 0;
	}
    }
    return 0;
}