Submission #72539282

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
unordered_map<char,int> Hash1, Hash2;

void sol() {
    int n, m; cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        char p;cin >> p;
        Hash1[p] = 1;
    }
    for (int i = 0; i < m; ++i) {
        char p;cin >> p;
        Hash2[p] = 1;
    }
}

void cmp() {
    string str;
    cin >> str;
    bool a = true, b = true;
    for(auto p : str) {
        if(Hash1.count(p) == 0)
            a = false;
        if(Hash2.count(p) == 0)
            b = false;
    }

    if((!a && !b) || (a && b))
        cout << "Unknown\n";
    else if (a)
        cout << "Takahashi\n";
    else
        cout << "Aoki\n";
}

signed main() {
    sol();
    int n;cin >> n;
    while(n--){
        cmp();
    }
    return 0;
}

Submission Info

Judge Result