201809-3 元素选择器

 

 

#include <bits/stdc++.h>

using namespace std;

const int N = 2000 + 5;

struct elem{
    string tag;
    string id;
    int fa;
};

vector<elem> elem(105);
vector<int> ans;
int n, m;
int get_subs(string str, string sub[50]) {
    istringstream in(str);
    int idx = 0;
    while(in >> sub[idx]) idx++;
    return idx;
}

int check_ancestor(string sub[50], int items, int fa) {
    while(items > 0) {
        string p;

        if(fa == -1)
            return 0;
        if(sub[items - 1][0] == '#')
            p = elem[fa].id;
        else
            p = elem[fa].tag;

        if(sub[items - 1] == p)
            items --;
        fa = elem[fa].fa;
    }
    return 1;
}
void query(string str) {
    int i, id = 0, s_cnt;
    string sub[50];

    s_cnt = get_subs(str, sub);
    for(i = 0; i < s_cnt; i++)
        if(sub[i][0] != '#')
             transform(sub[i].begin(), sub[i].end(), sub[i].begin(), ::toupper);

    string& s = sub[s_cnt - 1];
    if(s[0] == '#')
        id = 1;

    ans.clear();
    for(i = 0; i < n; i++) {
        string p;
        if(id)
            p = elem[i].id;
        else
            p = elem[i].tag;
        if(p == s)
            if(check_ancestor(sub, s_cnt - 1, elem[i].fa))
                ans.push_back(i + 1);
    }
}

void print_result() {
    cout << ans.size() ;
    for(size_t i = 0; i < ans.size(); i++) {
        cout << " " << ans[i];
    }
    cout << endl;
}

int main() {

    string str;
    int level[101] = {-1};
    cin >> n >> m;
    getchar();
    for(int i = 0; i < n; i++) {
        int c;
        getline(cin, str);
        c = count(str.begin(), str.end(), '.');
        level[c / 2] = i;

        elem[i].id.clear();
        istringstream s(str.substr(c));
        if(s >> elem[i].tag) s >> elem[i].id;
        if(i)
            elem[i].fa = level[c / 2 - 1];
        transform(elem[i].tag.begin(), elem[i].tag.end(), elem[i].tag.begin(), ::toupper);
    }
    elem[0].fa = -1;

    for(int i = 0; i < m; i++) {
        getline(cin, str);
        query(str);
        print_result();
    }
    return 0;
}