The 36th ACM/ICPC Asia Regional Beijing Site —— Online Contest
魔法女孩儿清除女巫,女巫的房间间的关系是一棵树,每次女孩儿只能进入左边的子节点,要进入右边的子节点,必须得回到父节点,又进入右边的子节点。
最后输出路径。
直接用栈和队列模拟即可,稍微注意一下,逗号与括号相连,括号与括号相连时该怎样入栈出栈,入队。
//93ms
#include <iostream>
using namespace std;
char str[1000001], room[50001][11];
void cpy(int l, int r, int id)
{
int i, j;
for(i = l, j = 0; i <= r; i++)
room[id][j++] = str[i];
room[id][j] = '\0';
}
int main()
{
int s[3000], q[100000];
int t, id;
int i, r, top, l, len;
scanf("%d", &t);
while(t--)
{
id = r = top = 0, l = 1;
scanf("%s", &str);
len = strlen(str);
if(str[len-1] != ')')
{
printf("1\n%s\n\n", str);
continue;
}
for(l = i = 0; i < len; i++)
{
if(str[i] == '(')
{
s[top++] = ++id;
q[r++] = id;
cpy(l, i-1, id);
l = i+1;
}
else if(str[i] == ',')
{
if(str[i-1] != ')')
{
q[r++] = ++id;
cpy(l, i-1, id);
}
q[r++] = s[top-1];
l = i+1;
}
else if(str[i] == ')')
{
if(str[i-1] != ')')
{
q[r++] = ++id;
cpy(l, i-1, id);
}
q[r++] = s[--top];
l = i+1;
}
}
printf("%d\n", id);
for(i = 1; i <= id; i++)
printf("%s\n", room[i]);
printf("%d ", q[0]);
for(i = 1; i < r-1; i++)
printf("%d\n%d ", q[i], q[i]);
printf("%d\n\n", q[r-1]);
}
return 0;
}