CFF CSP认证考试题 第29次 LDAP

WA

可以过给出来的测试用例以及我自己写的一些用例。

#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
using namespace std;

struct Node{
    vector<int>ki;//key
    vector<int>vi;//value
}nodes[1010];
int n;

vector<int> getid(string s){//如果匹配上了就返回id
    int len = s.size();
    char op = 'f';
    int first = 0;
    int second = 0;
    vector<int> ans;
    for (int i = 0; i < len; ++i) {
        if(isdigit(s[i]) && op == 'f'){
            first = first*10 + (s[i]-'0');
        }
        else if(isdigit(s[i])){
            second = second*10 + (s[i]-'0');
        }
        else{
            op = s[i];
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < nodes[i].ki.size(); ++j) {
            if(nodes[i].ki[j] == first && nodes[i].vi[j] == second && op == ':'){
                ans.push_back(i);
            }
            else if(nodes[i].ki[j] == first && nodes[i].vi[j] != second && op == '~'){
                ans.push_back(i);
            }
        }
    }
    return ans;
}

void vecand(vector<int>v1 , vector<int>v2){//打印一样的元素and
    set<int>st;
    vector<int>vec;
    for (int i = 0; i < v1.size(); ++i) {
        for (int j = 0; j < v2.size(); ++j) {
            if(v1[i] == v2[j]){
                st.insert(v1[i]);
            }
        }
    }
    for(auto it:st){
        vec.push_back(it);
    }
    sort(vec.begin(),vec.end());//排序
    bool first = true;
    for(auto it:vec){
        if(!first){
            cout << " ";
        } else{
            first = false;
        }
        cout << it;
    }
    cout << endl;

    return;
}
void orvec(vector<int>v1, vector<int>v2){//打印都有的元素or
    set<int >st;
    vector<int>vec;
    for (int i = 0; i < v1.size(); ++i) {
        st.insert(v1[i]);
    }
    for (int i = 0; i < v2.size(); ++i) {
        st.insert(v2[i]);
    }
    for(auto it:st){
        vec.push_back(it);
    }
    sort(vec.begin(),vec.end());//排序
    bool first = true;
    for(auto it:vec){
        if(!first){
            cout << " ";
        } else{
            first = false;
        }
        cout << it;
    }
    cout << endl;
    return;
}

int main() {
    int id, keynum,key, value;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> id >> keynum;
        for (int j = 0; j < keynum; ++j) {
            cin >> key >> value;
            nodes[id].ki.push_back(key);
            nodes[id].vi.push_back(value);//存入用户
        }
    }
    int opnum;
    cin >> opnum;
    getchar();
    string s;
    for (int i = 0; i < opnum; ++i) {//遍历操作符
        char op;
        getline(cin,s);
        vector<int> result;
        vector<int> result2;
        if(isdigit(s[0]) ){//原子式
            result = getid(s);
            for (int j = 0; j < result.size(); ++j) {
                cout << result[j];
                if(j < result.size()-1){
                    cout << " ";
                }
            }
            cout << endl;
        }
        else{//组合式
            int first = 0;
            bool diyici = true;//第一次存入result 第二次存入result2
            for (int j = 0; j < s.size(); ++j) {
                int front ,end;
                if(s[j] == '('){
                    front = j+1;
                }
                else if(s[j] == ')'){
                    end = j-1;
                    if(diyici){
                        diyici = false;
                        result = getid(s.substr(front,end - front + 1));
                    }
                    else{
                        result2 = getid(s.substr(front,end - front + 1));
                    }
                }
            }
            if(s[0] == '&'){
                vecand(result,result2);//打印result 和 result2 的元素and
            } else{
                orvec(result,result2);//打印 or
            }
        }
    }
}
/*
2
1 2 1 2 2 3
2 2 2 3 3 1
4
1:2
3~1
&(1:2)(2:3)
|(1:2)(3:1)

 */