2014牡丹江现场-Ｈ-大模拟

大模拟

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <vector>
#include <map>

using namespace std;

const int maxn = 1e7+10;
const int max_node = 1e5+10;

int T,N,len;
char line[maxn];
char text[maxn];

struct node
{
    string contain;
    int kind;
    int sons;
    map<string,int> key;
    map<string,int> nxt;
    vector <pair<int,int> > val;
}json[max_node];

int n_eon = 0;

pair<int,int> dfs(int pos,int fa)
{
    json[++n_eon].kind = 0;
    json[n_eon].key.clear();
    json[n_eon].val.clear();
    json[n_eon].nxt.clear();

    int cur_eon = n_eon;

    //printf("%s\n",text+pos);
    bool flag_key = false;

    string val;
    string key;

    while(pos < len)
    {
        if(text[pos] == '{' && flag_key)
        {
            pair<int,int> tmp = dfs(pos+1,n_eon);
            int n_pos = tmp.first;
            pair<int,int> pr;
            pr.first = pos;
            pr.second = n_pos;
            //val.clear();
            //for(int i=pos;i<n_pos;i++)
            //{
            //    val += text[i];
            //}

            pos = n_pos;
            flag_key = false;
            //printf("02:get val %s\n",val.c_str());
            json[cur_eon].val.push_back(pr);
            json[cur_eon].nxt.insert(pair<string,int>(key,tmp.second));
        }
        else if(text[pos] == '}')
        {
            return pair<int,int>(pos+1,cur_eon);
        }
        else if(text[pos] == '"')
        {
            if(flag_key == false)
            {
                key.clear();
                while(++pos < len && text[pos] != '"')
                {
                    key += text[pos];
                }
                pos++;
                //printf("get key %s cur:%d \n",key.c_str(),cur_eon);
                json[cur_eon].key.insert(pair<string,int>(key,json[cur_eon].val.size()));
                flag_key = true;
            }
            else
            {
                pair<int,int> pr;
                pr.first = pos;
                //val.clear();
                //val+='"';

                while(++pos < len && text[pos] != '"')
                {
                    //val += text[pos];
                }

                //val+='"';
                pr.second = ++pos;
                //pos++;
                //printf("01:get val %s cur:%d siz:%d\n",val.c_str(),cur_eon,json[cur_eon].val.size());
                json[cur_eon].val.push_back(pr);
                flag_key = false;
            }
        }
        else if(text[pos] == ':')
        {
            if(flag_key)
            {

            }
            else
            {
                //printf("Error! no key\n");
            }
            pos++;
        }
        else if(text[pos] == ',')
        {
            pos++;
        }
        //pos++;
    }
}

char op[maxn];
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    scanf("%d ",&T);
    while(T--)
    {
        n_eon = 0;
        gets(line);
        len = strlen(line);
        int cnt = 0;
        for(int i=0;i<len;i++)
        {
            if(line[i] == ' ') continue;
            else text[cnt++] = line[i];
        }
        text[cnt] = 0;

        len = cnt;
        dfs(1,0);
        //printf("load!\n");
        scanf("%d ",&N);
        for(int i=0;i<N;i++)
        {
            //printf("N:%d i:%d\n",N,i);
            gets(op);
            int l = strlen(op),pos = 0;
            int cur = 1;
            //printf("q:%s\n",op);
            while(pos < l)
            {
                if(op[pos] == '"')
                {
                    string key;
                    while(++pos < l && op[pos] != '"')
                    {
                        key += op[pos];
                    }
                    //printf("query: %s\n",key.c_str());
                    pos++;
                    if(json[cur].key.count(key) != 0)
                    {
                        if(op[pos] == '.' && json[cur].nxt.count(key) != 0)
                        {
                            cur = json[cur].nxt[key];
                            pos++;
                            continue;
                        }
                        if(op[pos] == 0)
                        {
                            //printf("cur:%d get: %d num:%d\n",cur,json[cur].key[key],json[cur].val.size());
                            //printf("%s\n",json[cur].val[ json[cur].key[key] ].c_str());
                            pair<int,int> tp = json[cur].val[ json[cur].key[key] ];
                            for(int i=tp.first; i < tp.second ; i++)
                            {
                                putchar(text[i]);
                            }
                            puts("");
                            break;
                        }
                        else
                        {
                            printf("Error!\n");
                            break;
                        }
                    }
                    else
                    {
                        printf("Error!\n");
                        break;
                    }
                }
            }
        }
    }
}