#include<iostream>
#include<vector>
#include<string>
#include<algorithm>

using namespace std;

void whiteSpace(int deep){
    for(int i = 0; i < deep; i++){
        cout << "  ";
    }
}
void printDirect(string s, int whitePrefix){
    //完整地打印 s 的 dir tree
    int deep = -1;
    for(size_t i = 0; i < s.size(); i++){
        size_t j = i;
        while(s[j] != '\\' && j != s.size()) j++;
        string dir = s.substr(i, j - i);
        deep++;
        whiteSpace(deep + whitePrefix);
        cout << dir << endl;
        i = j;
    }
}
void printRelate(string a, string p){
    //基于上一行p的打印情况部分打印a
    int same = 0;
    size_t i = 0;
    for(i = 0; i < p.size() && i < a.size(); i++){
        if(a[i] == p[i]){
            if(a[i] == '\\') same++;
        } else {
            break;
        }
    }
    a = a.substr(i, a.size() - i); //前i个字符都无需打印，但是需要有same个whiteSpace作为前缀
    printDir...