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 bym we find the toys represented by n₁, n₂, ..., n_r, it must be true thatn₁ + n₂ + ... + n_r <m. And if this is the case, we say that toy mcontains directly the toys n₁,n₂, ..., n_r . It should be clear that toys that may be contained in any of the toysn₁, n₂,..., n_r are not considered as directly contained in the toym.

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 toys2 and 3. Note that the first copy of toy2 occurs left from the second one and that the second copy contains directly a toy1. 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 inside9.
• -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 than10⁷.

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.

刚看以为挺简单的，迅速写了个代码结果发现想错了，因为每个toy里可能有一个或多个toy，而这个区分就有点麻烦，改来改去用了个map，总算是搞定了，主要是要记录下每个toy直接包含的toy是否超出它本身的体积，为此我把每个toy目前包含的数量都用map记下来（因为多重嵌套的话可能会回到之前的任意一层去）

代码如下（把前面那一串include忽略掉吧。。。。。。）

#include<iostream>

#include<string>
#include<cstring>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cmath>
#include<set>
#include<ctime>
#include<cctype>
#include<memory>
#include<cstdlib>
#include<map>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
typedef vector<int> vi;

typedef set<int> si;

string str;
int main()
{
    while(getline(cin,str))
    {
        map<int,int> mapii;
        stack<int> stk;
        string s;
        int len=str.size();
        int pos=0;
        int num;
        bool first=true;
        bool check=true;
        while(pos!=string::npos)
        {
            pos=0;
            pos=str.find(' ',pos);
            s=str.substr(0,pos);
            str.erase(0,pos+1);
            int num=atoi(s.c_str());
            if(first)
                {
                    first=false;
                      stk.push(num);
                      mapii[num]=0;
                }
            else if(num<0)
            {
                mapii[num]=0;
                if(stk.top()<num+mapii[stk.top()])
                {
                    mapii[stk.top()]+=num;
                    stk.push(num);
                }
                else
                    {
                        check=false;
                        break;
                    }
            }
            else
            {

                if(stk.top()==-num)
                {
                    mapii.erase(stk.top());
                    stk.pop();
                }
                else
                {
                    check=false;
                    break;
                }
            }
        }
        if(stk.empty()&&check)
                cout<<":-) Matrioshka!"<<endl;
            else
                cout<<":-( Try again."<<endl;
    }
   return 0;
}