10.09T1

  1 /*
  2     Name:booklist
  3     Copyright:BashuOJ
  4     Author: ZYH
  5     Date: 09/10/18 09:06
  6     Description: imitate
  7 */
  8 #include<algorithm>
  9 #include<iostream>
 10 #include<cstdio>
 11 #include<map>
 12 #include<string>
 13 #define N 1005
 14 using namespace std;
 15 struct point {
 16     int id,father;
 17     int ch[1000],size;
 18     string name;
 19     int special;
 20 } p[N];
 21 int find(int id,string k) {
 22     for(int i=1; i<=p[id].size; i++) {
 23         if(p[p[id].ch[i]].name==k)return p[id].ch[i];
 24     }
 25     return -1;
 26 }
 27 int tot=-1;
 28 int newnode(string k) {
 29     p[tot+1].id=tot+1;
 30     tot++;
 31     p[tot].size=0;
 32     p[tot].name=k;
 33     return tot;
 34 }
 35 struct node {
 36     int id;
 37     string name;
 38 };
 39 bool cmp(node a,node b) {
 40     if(p[a.id].size!=0&&p[b.id].size==0)return 1;
 41     if(p[a.id].size==0&&p[b.id].size)return 0;
 42     for(int i=0; i<min(a.name.size(),b.name.size()); i++) {
 43         if(a.name[i]<b.name[i])return 1;
 44         else if(a.name[i]>b.name[i])return 0;
 45     }
 46     if(a.name.size()<b.name.size())return 1;
 47     return 0;
 48 }
 49 void bfs(int now,int dep,int pos) {
 50     node a[1000];
 51     if(now) {
 52         for(int i=1; i<=dep-1; i++)cout<<"    ";
 53         cout<<p[now].name;
 54         if(pos==p[p[now].father].size&&p[p[now].father].special&&p[now].size)p[now].special=1;
 55         if(pos==p[p[now].father].size&&p[p[now].father].special&&!p[now].size)return;
 56         cout<<‘\n‘;
 57     }
 58     for(int i=1; i<=p[now].size; i++) {
 59         a[i].id=p[now].ch[i];
 60         a[i].name=p[p[now].ch[i]].name;
 61     }
 62     sort(a+1,a+p[now].size+1,cmp);
 63     for(int i=1; i<=p[now].size; i++) {
 64         bfs(a[i].id,dep+1,i);
 65     }
 66 }
 67 string used[1000];
 68 int all=0;
 69 int main() {
 70     freopen("booklist.in","r",stdin);
 71     freopen("booklist.out","w",stdout);
 72     string k;
 73     newnode("");
 74     while(getline(cin,k)&&k!="0") {
 75         used[++all]=k;
 76         int level=0;
 77         string temp="";
 78         int now=0;
 79         for(int i=0; i<k.size(); i++) {
 80             if(k[i]!=‘/‘) {
 81                 temp=temp+k[i];
 82                 //    cout<<"now->"<<k[i]<<"  temp->"<<temp<<endl;
 83             }
 84             if(k[i]==‘/‘||i==k.size()-1) {
 85                 int judge=find(now,temp);
 86                 //    cout<<"Judge->"<<judge;
 87                 if(judge!=-1) { //如果找到有这一本书
 88             //        cout<<"temp->"<<temp<<"  id->"<<judge<<‘\n‘;
 89                     int flag=0;
 90                     for(int j=1;j<all;j++)if(used[j]==k)flag=1;
 91                     if(i==k.size()-1&&!flag) {
 92                         int id=newnode(temp);
 93             //            cout<<"temp->"<<temp<<"  id->"<<id<<‘\n‘;
 94                         p[now].ch[++p[now].size]=id;
 95                         p[id].father=now;
 96                         now=id;
 97                     } else now=judge;
 98                     temp="";
 99                 } else {
100                     int id=newnode(temp);
101             //        cout<<"temp->"<<temp<<"  id->"<<id<<‘\n‘;
102                     p[now].ch[++p[now].size]=id;
103                     p[id].father=now;
104                     now=id;
105                     temp="";
106                 }
107             }
108         }
109     }
110     p[0].special=1;
111     bfs(0,0,p[0].size);
112     return 0;
113 }