题解 | 斗兽棋

#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;

int main() {
    string s1, s2;
    cin >> s1 >> s2;  // 读取输入的两个棋子

    // 构建胜负规则映射表
    unordered_map<string, string> resultMap = {
        {"elephant tiger", "win"},
        {"tiger cat", "win"},
        {"cat mouse", "win"},
        {"mouse elephant", "win"},
        {"tiger elephant", "lose"},
        {"cat tiger", "lose"},
        {"mouse cat", "lose"},
        {"elephant mouse", "lose"}
    };

    // 判断结果
    if (s1 == s2) {
        cout << "tie" << endl;
    } else {
        string key = s1 + " " + s2;
        // 查找映射表中的结果，若不存在则默认输出"tie"（实际不会发生）
        if(resultMap.find(key) != resultMap.end())
        {
            cout << resultMap[key] << endl;
        }
        else {
            cout << "tie" << endl;
        }
    }

    return 0;
}