Directory Listing(zoj 1635)-CSDN博客

本文链接：https://blog.csdn.net/iamyujulong/article/details/4252735

本文介绍了一道关于UNIX目录树的模拟题，题目要求根据给定的目录结构和文件大小，输出格式化的目录树结构，并计算每个目录的总大小。文章提供了一段C++代码实现，包括读取输入、构建目录树、计算目录大小及打印目录树的过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Time Limit: 1 Second Memory Limit: 32768 KB

Given a tree of UNIX directories and file/directory sizes, you are supposed to list them as a tree with proper indention and sizes.

Input

The input consists of several test cases. Each case consists of several lines which represent the levels of the directory tree. The first line contains the root file/directory. If it is a directory, then its children will be listed in the second line, inside a pair of parentheses. Similarly, if any of its children is a directory, then the contents of that directory will be listed in the next line, inside a pair of parentheses. The format of a file/directory is:

name size or *name size

where name, the name of the file/directory, is a string of no more than 10 characters; size > 0 is the integer size of the file/directory; * means the name is a directory. It is guaranteed that name will not contain characters '(', ')', '[', ']', and '*'. There are no more than 10 levels for each case, and no more than 10 files/directories on each level.

Output

For each test case, list the tree in the format shown by the sample. Files/directories that are of depth d will have their names indented by 8d spaces. Do NOT print tabs to indent the output. The size of a directory D is the sum of the sizes of all the files/directories in D, plus its own size.

Sample Input

*/usr 1
(*mark 1 *alex 1)
(hw.c 3 *course 1) (hw.c 5)
(aa.txt 12)
*/usr 1
()

Sample Output

|_*/usr[24]
        |_*mark[17]
        |       |_hw.c[3]
        |       |_*course[13]
        |               |_aa.txt[12]
        |_*alex[6]
                |_hw.c[5]
|_*/usr[1]

Author: CHEN, Yue

Source: Zhejiang University Local Contest 2003

有点烦的模拟题..

#include<iostream>

using namespace std;

struct

{

char name[ 15 ];

int next[ 15 ];

int num;

int key;

void Init(){ num = 0 ;}