FamilyTreeExpertSystem.cpp

#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

map<string, string> genderExpert;
vector<pair<string, string>> parentsExpert;

void initializeExpert() {
    genderExpert["tom"] = "male";
    genderExpert["anna"] = "female";
    genderExpert["bob"] = "male";
    genderExpert["jill"] = "female";
    genderExpert["kate"] = "female";
    genderExpert["sam"] = "male";

    parentsExpert.push_back({"tom", "bob"});
    parentsExpert.push_back({"anna", "bob"});
    parentsExpert.push_back({"tom", "jill"});
    parentsExpert.push_back({"anna", "jill"});
    parentsExpert.push_back({"bob", "kate"});
    parentsExpert.push_back({"jill", "sam"});
}

bool parentExpert(const string& a, const string& b) {
    return any_of(parentsExpert.begin(), parentsExpert.end(), [&](const auto& p) {
        return p.first == a && p.second == b;
    });
}

bool siblingExpert(const string& a, const string& b) {
    if (a == b) return false;
    return any_of(parentsExpert.begin(), parentsExpert.end(), [&](const auto& p) {
        return parentExpert(p.first, a) && parentExpert(p.first, b);
    });
}

bool uncleOrAunt(const string& x, const string& y) {
    return any_of(parentsExpert.begin(), parentsExpert.end(), [&](const auto& p) {
        return parentExpert(p.first, y) && siblingExpert(x, p.first);
    });
}

int main() {
    initializeExpert();
    cout << boolalpha;
    cout << "Is Tom uncle/aunt of Kate? " << uncleOrAunt("tom", "kate") << '\n';
    cout << "Is Anna uncle/aunt of Sam? " << uncleOrAunt("anna", "sam") << '\n';
    return 0;
}