CERC2017 H Hidden Hierarchy(树+模拟)

题意：

在一些给定的目录里按要求展开到制定大小并按字典序输出

思路：

因为有目录这个东西，所以想到模拟一个类似字典树的东西，不过这里每个儿子可能有n个节点，而且不能O(1)查询了

代码超长。。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<vector>
#include<map>
#include<functional>

#define fst first
#define sc second
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define lc root<<1
#define rc root<<1|1
#define lowbit(x) ((x)&(-x)) 

using namespace std;

typedef double db;
typedef long double ldb;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PI;
typedef pair<ll,ll> PLL;

const db eps = 1e-;
const int mod = 1e9+;
const int maxn = 2e6+;
const int maxm = 2e6+;
const int inf = 0x3f3f3f3f;
const db pi = acos(-1.0);

//vector<string>str;//每个编号对应的字符串
string str[ + ];
bool cmp(int a, int b){
    return str[a] < str[b];
}
vector<int>v[ + ];//v[i]为i的孩子们
int tol = ;
int vis[ + ];//结尾节点
int vl[ + ];//节点的值
int T;
void insert(vector<string>s, int val){
    int root = ;
    int sz = s.size();
    for(int i = ; i < sz; i++){
        //cout << i << "   "<<s[i]<<endl;
        int flg = ;
        for(int j = ; j < (int)v[root].size(); j++){
            if(str[v[root][j]] == s[i]){
                root = v[root][j];
                flg = ;
                break;
            }
        }
        if(!flg){
            //cout << "  bug  "<<tol<<endl;
            v[root].pb(tol);
            str[tol] = s[i];
            if(i==(sz-)){
                vis[tol] = ;
                vl[tol] = val;
            }
            root = tol++;
        }
    }
    return;
}
int size[ + ];
int readydfs(int root){
    int sz = v[root].size();
    int res = ;
    if(sz == ){
        return vl[root];
    }
    int flg = ;
    //cout << root << "  "<<str[root]<<endl;
    for(int i = ; i < sz; i++){
        //cout << v[root][i] << "  " << str[v[root][i]]<<endl;
        if(vis[v[root][i]] != ){
            flg = ;
        }
        res += readydfs(v[root][i]);
    }
    if(!flg) vis[root] = ;

    return vl[root] = res;
}
void dfs(int root, string s, int c){
    int sz = v[root].size();
    int flg = ;
    if(vis[root]==)flg = ;
    if(vl[root] < T){
        if(vis[root] == ) flg = ;
        else flg = ;
    }
    //cout << s <<endl;
    /*if(flg == 0){
        cout<<"- "<<s<<"/ "<<vl[root]<<endl;
    }*/
    if(flg == ){
        cout <<"  "<<s<<"/ "<<vl[root]<<endl;
        return;
    }
    else if(flg == ){
        cout << "+ "<<s<<"/ "<<vl[root]<<endl;
        return;
    }
    sort(v[root].begin(), v[root].end(), cmp);
    int vv = ;
    for(int i = ; i < sz; i++){
        if(vis[v[root][i]]!=){
            if(vv &&vl[v[root][i]]>=T){
                cout<<"- "<<s<<"/ "<<vl[root]<<endl;
                vv = ;
                break;
            }
            //if(flg == 3) dfs(v[root][i], s+"/"+str[v[root][i]], 0);

        }
    }
    if(!vv){
        for(int i = ; i < sz; i++){
            if(vis[v[root][i]]!=){

                dfs(v[root][i], s+"/"+str[v[root][i]], );

            }
        }
    }
    else cout << "+ "<<s<<"/ "<<vl[root]<<endl;
    return;
}
int main() {
    tol = ;
    str[] = "/";
    mem(vis, );
    mem(vl, );
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    string tmp;
    for(int t = ; t <= n; t++){
        int val;
        cin >> tmp >> val;
        int len = tmp.size();
        vector<string>s;
        int p = ;
        for(int i = ; i < len; i++){
            if(i && (tmp[i] == '/')){
                s.pb(tmp.substr(p+, i-p-));
                p = i;
            }
            if(i == len - ){
                s.pb(tmp.substr(p+, i-p));
            }
        }
        insert(s, val);
    }
    readydfs();
    /*for(int i = 0; i < tol; i++){
        cout << i <<"  "<<vl[i]<<endl;
    }*/
    cin >> T;
    string s = "";
    dfs(, s, );
    return ;
}