Problem B - 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 n1, n2, ..., nr, it must be true thatn1 +n2 + ... +nr <m. And if this is the case, we say that toymcontains directly the toysn1,n2,...,nr . It should be clear that toys that may be contained in any of the toysn1,n2,...,nr 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:
For example, the sequence
On the other hand, the following sequences do not describe generalized matrioshkas:
-
-9 -7 -2 2 -3 -1 -2 2 1 3 7 9because 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 9because 7 and 2 may not be allocated together inside9.
-
-9 -7 -2 2 -3 -1 -2 3 2 1 7 9because 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 than107.
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.
XX Colombian National Programming Contest
//很简单的题目用复杂的思路在想,注定完蛋啊!
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<stdlib.h>
#include<math.h>
int num[200000],a[200000]={0,0},stack[100003]={0,0};
main()
{
int i,j,d,top=0,ok=1,count=1;
char ch;
while(scanf("%d%c",&num[count],&ch)!=EOF)
{
if(ch==' ') count++;
else //字符为换行符
{
stack[++top]=num[1];a[1]=0;
for(i=2;i<=count;i++)
{
if(num[i]+stack[top]==0)
{
top--;
a[top]+=abs(num[i]);//被包含的娃娃大小要保存在包含他的娃娃上面
if(top&&a[top]>=abs(stack[top]))
ok=0;
}
else
{
stack[++top]=num[i];
a[top]=0;
}
}
if(top==0&&ok)
printf(":-) Matrioshka!\n");
else printf(":-( Try again.\n");
top=0;
ok=1;
count=1;
}
}
return 0;
}