시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
20 초 (추가 시간 없음) 1024 MB (추가 메모리 없음) 3 3 2 100.000%

문제

You are given a list of valid arithmetic expressions using non-negative integers, parentheses (), plus +, multiply *, and an extra operator #. The expressions are fully parenthesized and in infix notation.

A fully parenthesized expression is an expression where every operator and its operands are wrapped in a single parenthesis. For example, the expression $x+y$ becomes $(x+y)$ when fully parenthesized, and $x+y+z$ becomes $((x+y)+z)$. However, $0$ is still $0$ when fully parenthesized, because it consists of a single number and no operators. $((x+y))$ is not considered fully parenthesized because it has redundant parentheses.

The operators + and * denote addition and multiplication, and # can be any total function.

You want to group the expressions into equivalence classes, where expressions are in the same equivalence class if and only if they are guaranteed to result in the same numeric value, regardless of which function # represents.

You can assume that # represents the same function across all expressions in a given test case. That might mean that # represents some known function like addition or subtraction, but not both in different parts of the same test case.

For example, consider the following expressions:

  • F1=((1#(1+1))+((2#3)*2))
  • F2=(((2#3)+(1#2))+(2#3))
  • F3=((2*(2#3))+(1#2)).

Let A = 1#2, and let B = 2#3. Then we can say F1=F2=F3, regardless of the function # represents because the expressions can be rewritten as:

  • F1=((1#2)+((2#3)*2))=(A+(B*2))=(A+2B)
  • F2=(((2#3)+(2#3))+(1#2))=((B+B)+A)=(A+2B)
  • F3=((2*(2#3))+(1#2))=((2*B)+A)=(A+2B).

However, consider the expressions F4=((0#0)+(0#0)) and F5=(0#0). If # represents addition, then F4=F5. However, if # is f(x,y)=C, such that $C$ is a non-zero integer, then F4≠F5 since 2C≠C. Therefore F4 and F5 are not in the same equivalence class.

입력

The first line of the input gives the number of test cases, $T$. $T$ test cases follow. Each test case begins with a line containing the integer $N$. $N$ lines follow. $i$-th line contains one expression, Ei.

출력

For each test case, output one line containing Case #x: Y1,Y2,…,YN, where $x$ is the test case number (starting from 1) and $Y_i$ is the lexicographically smallest sequence satisfying the conditions below:

  1. $1 \le Y_i \le Z$, where $Z$ denotes the total number of equivalence classes in a given test case.
  2. $Y_i=Y_j$ if and only if $E_i$ and $E_j$ are in the same equivalence class.

제한

  • $1 \le T \le 100$
  • $1 \le N \le 100$
  • The length of $E_i$ is at most $100$, for all $i$.
  • $E_i$ will be valid, for all $i$.

Test Set 1 (14점)

No more than one # in each expression.

Test Set 2 (23점)

No additional constraints.

예제 입력 1

3
7
(1*(1#2))
(0*(1#2))
(1#2)
0
(3*0)
((1#2)*1)
(((1+(1#2))+3)*0)
5
(1*((1+(2#2))+3))
((0+(2#2))+4)
(100#2)
(((1+(2#2))+3)*1)
((50*2)#2)
2
(9999999999999999999999999999999999999999+1)
(100000000000000000000*100000000000000000000)

예제 출력 1

Case #1: 1 2 1 2 2 1 2
Case #2: 1 1 2 1 2
Case #3: 1 1

This sample test set contains $3$ test cases.

Test case 1 has $7$ expressions and a total of $2$ equivalence classes, denoted $G_1$ and $G_2$.

E1=(1*(1#2)), E2=(0*(1#2)), ……, E7=(((1+(1#2))+3)*0).

$E_1$, $E_3$, and $E_6$ belong to $G_1$, and $E_2$, $E_4$, $E_5$, and $E_7$ belong to $G_2$.

There are $2$ sequences of $Y_i$ that satisfy the requirement about equivalence classes in test case 1: 2 1 2 1 1 2 1 and 1 2 1 2 2 1 2.
Since 1 2 1 2 2 1 2 is the lexicographically smaller one, the output for test case 1 is: Case #1: 1 2 1 2 2 1 2.

Test case 2 has $5$ expressions and a total of $2$ equivalence classes, denoted $G_1$ and $G_2$.

$E_1$, $E_2$, and $E_4$ belong to $G_1$, and $E_3$ and $E_5$ belong to $G_2$.

Therefore, the output for test case 2 is: Case #2: 1 1 2 1 2.

Test case 3 has $2$ expressions that do not contain any #.

These two expressions evaluate to the same value, and therefore belong to the same equivalence class.

예제 입력 2

1
9
((2*(2#3))+(1#2))
(0*(1#2))
0
((1#(1+1))+((2#3)*2))
(3*0)
(1#(2#3))
(((2#3)+(1#2))+(2#3))
(4#7)
(7#4)

예제 출력 2

Case #1: 1 2 2 1 2 3 1 4 5

In the provided sample, there are a total of $5$ equivalence classes. The first expression in the input is ((2*(2#3))+(1#2)). All expressions from its equivalence class are denoted with 1 in the output. The equivalence class denoted with 2 consists of (0*(1#2))0, and (3*0). The equivalence class denoted with 3 consists of (1#(2#3)). Finally, the last two expressions, (4#7) and (7#4), are not equivalent to any of the prior expressions or to one another. Note that 2 1 1 2 1 3 2 5 4 is one of many other sequences that satisfy the requirement about equivalence classes the given input, but it is not a correct answer because this sequence is not the lexicographically smallest one.

채점 및 기타 정보

  • 예제는 채점하지 않는다.