题解 | 斗兽棋

#include <iostream>
#include <string>
#include <unordered_map>

using namespace std;

int main() {
    string s1, s2;
    cin >> s1 >> s2;
    if (s1 == s2) {
        cout << "tie" << endl;
        return 0;
    }
    unordered_map<string, string> rules = {
        {"elephant", "tiger"},
        {"tiger", "cat"},
        {"cat", "mouse"},
        {"mouse", "elephant"}
    };

    // 检查 s1 是否能击败 s2（用 find 避免插入无效键）
    auto it1 = rules.find(s1);
    if (it1 != rules.end() && it1->second == s2) {
        cout << "win" << endl;
    }
    //检查 s2 是否能击败 s1
    else {
        auto it2 = rules.find(s2);
        if (it2 != rules.end() && it2->second == s1) {
            cout << "lose" << endl;
        }
        //无效输入/无胜负关系（仍判平局）
        else {
            cout << "tie" << endl;
        }
    }

    return 0;
}