-
Notifications
You must be signed in to change notification settings - Fork 0
/
1067.cpp
63 lines (54 loc) · 1.26 KB
/
1067.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <iostream>
#include <map>
using namespace std;
struct tree {
string name;
map<string, tree *> children;
tree() {
this->name = "";
this->children = {};
}
tree(string name) {
this->name = name;
this->children = {};
}
};
void print_tr(tree *tr, int n) {
for (int i = 0; i < n - 1; ++i) {
cout << " ";
}
if (!tr->name.empty()) {
cout << tr->name << endl;
}
++n;
for (auto &j : tr->children) {
print_tr(j.second, n);
}
}
int main() {
int n = 0;
cin >> n;
tree *tr_root = new tree();
for (int i = 0; i < n; ++i) {
string path;
cin >> path;
string dir;
tree *tr = tr_root;
for (int j = 0; j <= path.size(); ++j) {
if (path[j] == '\\' || path[j] == '\0') {
auto dir_tr = tr->children.find(dir);
if (dir_tr == tr->children.end()) {
tr->children[dir] = new tree(dir);
tr = tr->children.find(dir)->second;
} else {
tr = dir_tr->second;
}
dir = "";
} else {
dir += path[j];
}
}
}
print_tr(tr_root, 0);
return 0;
}