首页 > 代码库 > HDU-4782-Beautiful Soup(模拟)

HDU-4782-Beautiful Soup(模拟)

2024-07-25 19:39:28   218人阅读

Problem Description
　　Coach Pang has a lot of hobbies. One of them is playing with “tag soup” with the help of Beautiful Soup. Coach Pang is satisfied with Beautiful Soup in every respect, except the prettify() method, which attempts to turn a soup into a nicely formatted string. He decides to rewrite the method to prettify a HTML document according to his personal preference. But Coach Pang is always very busy, so he gives this task to you. Considering that you do not know anything about “tag soup” or Beautiful Soup, Coach Pang kindly left some information with you:
　　In Web development, “tag soup” refers to formatted markup written for a web page that is very much like HTML but does not consist of correct HTML syntax and document structure. In short, “tag soup” refers to messy HTML code.
　　Beautiful Soup is a library for parsing HTML documents (including “tag soup”). It parses “tag soup” into regular HTML documents, and creates parse trees for the parsed pages.
　　The parsed HTML documents obey the rules below.

HTML
　　HTML stands for HyperText Markup Language.
　　HTML is a markup language.
　　A markup language is a set of markup tags.
　　The tags describe document content.
　　HTML documents consist of tags and texts.

Tags
　　HTML is using tags for its syntax.
　　A tag is composed with special characters: ‘<’, ‘>’ and ‘/’.
　　Tags usually come in pairs, the opening tag and the closing tag.
　　The opening tag starts with “<” and the tagname. It usually ends with a “>”.
　　The closing tag starts with “</” and the same tagname as the corresponding opening tag. It ends with a “>”.
　　There will not be any other angle brackets in the documents.
　　Tagnames are strings containing only lowercase letters.
　　Tags will contain no line break (‘\n’).
　　Except tags, anything occured in the document is considered as text content.

Elements
　　An element is everything from an opening tag to the matching closing tag (including the two tags).
　　The element content is everything between the opening and the closing tag.
　　Some elements may have no content. They’re called empty elements, like <hr></hr>.
　　Empty elements can be closed in the opening tag, ending with a “/>” instead of “>”.
　　All elements are closed either with a closing tag or in the opening tag.
　　Elements can have attributes.
　　Elements can be nested (can contain other elements).
　　The <html> element is the container for all other elements, it will not have any attributes.

Attributes
　　Attributes provide additional information about an element.
　　Attributes are always specified in the opening tag after the tagname.
　　Tag name and attributes are separated by single space.
　　An element may have several attributes.
　　Attributes come in name="value" pairs like class="icpc".
　　There will not be any space around the ‘=‘.
　　All attribute names are in lowercase.

A Simple Example <a href=http://www.mamicode.com/"http://icpc.baylor.edu/">ACM-ICPC
　　The <a> element defines an HTML link with the <a> tag.
　　The link address is specified in the href attribute.
　　The content of the element is the text “ACM-ICPC”
　　
　　You are feeling dizzy after reading all these, when Coach Pang shows up again. He starts to spout for hours about his personal preference and you catch his main points with difficulty. Coach Pang says:

　　Your task is to write a program that will turn parsed HTML documents into formatted parse trees. You should print each tag or text content on its own line preceded by a number of spaces that indicate its depth in the parse tree. The depth of the root of the a parse tree (the <html> tag) is 0. He is satisfied with the tags, so you shouldn’t change anything of any tag. For text content, throw away unnecessary white spaces including space (ASCII code 32), tab (ASCII code 9) and newline (ASCII code 10), so that words (sequence of characters without white spaces) are separated by single space. There should not be any trailing space after each line nor any blank line in the output. The line contains only white spaces is also considered as blank line. You quickly realize that your only job is to deal with the white spaces.
 

Input
　　The first line of the input is an integer T representing the number of test cases.
　　Each test case is a valid HTML document starts with a <html> tag and ends with a </html> tag. See sample below for clarification of the input format.
　　The size of the input file will not exceed 20KB.
 

Output
　　For each test case, first output a line “Case #x:”, where x is the case number (starting from 1).
　　Then you should write to the output the formatted parse trees as described above. See sample below for clarification of the output format.
 

Sample Input
2
<html><body>
<h1>ACM
ICPC</h1>
<p>Hello<br/>World</p>
</body></html>
<html><body><p>
Asia Chengdu Regional</p>
<p class="icpc">
ACM-ICPC</p></body></html>
 

Sample Output
[pre]Case #1:
<html>
 <body>
  <h1>
   ACM ICPC
  </h1>
  <p>
   Hello
   <br/>
   World
  </p>
 </body>
</html>
Case #2:
<html>
 <body>
 <p>
   Asia Chengdu Regional
  </p>
  <p class="icpc">
   ACM-ICPC
  </p>
 </body>
</html>
[/pre]

Hint

Please be careful of the number of leading spaces of each line in above sample output.
 

Source
2013 Asia Chengdu Regional Contest
 

思路：注意以下几点：①\n  \t  都要当成空格处理。②</>   ③行末空格。 ④<里面的东西不能动> 

#include <stdio.h>
#include <string.h>

char s[50000];
int nxt[50000];

void ps(int x)//输出前面的空格
{
    puts("");

    for(int i=0;i<x;i++) putchar(' ');
}

int main()
{
    int T,i,j,len,last,suojin,cas;
    bool in;//标记是否在<>里面

    scanf("%d",&T);

    len=0;

    while(gets(s+len)!=NULL)//先全部读入
    {
         if(!s[0]) continue;

         len=strlen(s);

         s[len]=' ';//末尾加个空格

         len++;
    }

    in=0;

    for(i=0;i<len;i++)
    {
        if(s[i]=='<') in=1;
        else if(s[i]=='>') in=0;
        else if(!in && s[i]=='\t') s[i]=' ';//把制表符换成空格，方便后面处理
        nxt[i]=i+1;
    }

    last=0;
    in=0;

    for(i=1;i<len;i++)
    {
        if(s[i]=='<') in=1;
        else if(s[i]=='>') in=0;

        if(s[i]==' ')
        {
            if((!in && s[last]==' ') || s[last]=='>') nxt[last]=nxt[i];//过滤掉多余的空格
            else last=i;
        }
        else last=i;
    }

//    for(i=head;i<len;i=nxt[i]) printf("%c",s[i]);

    for(i=0;i<len;i=nxt[i])
    {
        if(s[i]==' ' && s[nxt[i]]=='<') nxt[last]=nxt[i];//过滤行末空格

        last=i;
    }

    suojin=0;

    cas=2;

    puts("Case #1:");

    for(i=0;i<len;)
    {
        if(s[i]=='<' && s[nxt[i]]=='/' && s[nxt[nxt[i]]]=='>')//特判</>
        {
            if(suojin) ps(suojin);

            printf("</>");

            i=nxt[nxt[nxt[i]]];
        }
        else if(s[i]=='<' && s[i+1]!='/')
        {
            if(suojin) ps(suojin);

            for(j=i;j<len;j=nxt[j])
            {
                printf("%c",s[j]);

                if(s[j]=='>') break;
                else if(s[j]=='/' && s[j+1]=='>') suojin--;//<br/>
            }

            i=nxt[j];

            suojin++;
        }
        else if(s[i]=='<' && s[i+1]=='/')
        {
            suojin--;

            ps(suojin);

            for(j=i;j<len;j=nxt[j])
            {
                printf("%c",s[j]);
                if(s[j]=='>') break;
            }

            i=nxt[j];

            if(suojin==0)
            {
                if(cas>T)
                {
                    puts("");
                    return 0;
                }

                printf("\nCase #%d:\n",cas++);
            }
        }
        else
        {
            ps(suojin);

            for(j=i;j<len;j=nxt[j])
            {
                if(s[j]=='<') break;

                printf("%c",s[j]);
            }

            i=j;
        }
    }
}


HDU-4782-Beautiful Soup(模拟)


联系
我们