题解 | 斗兽棋

#include <bits/stdc++.h>
#define il inline

using namespace std;
using ll = long long;
using ull = unsigned long long;
using int128=__int128_t;

const ll N = 6e5 + 5, mod = 1e9+7, inf = 1e18;
const double esp=1e-3;
double PI=3.1415926;

il void solve(){
    string a,b;
    cin>>a>>b;
    
    map<pair<string,string>,string>mp;
    mp[{"elephant","tiger"}]="win";
    mp[{"tiger","elephant"}]="lose";

    mp[{"tiger","cat"}]="win";
    mp[{"cat","tiger"}]="lose";

    mp[{"cat","mouse"}]="win";
    mp[{"mouse","cat"}]="lose";

    mp[{"mouse","elephant"}]="win";
    mp[{"elephant","mouse"}]="lose";

    cout<<(mp[{a,b}]=="lose"||mp[{a,b}]=="win"?mp[{a,b}]:"tie");
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    int t = 1;

    //cin >> t;

    while (t--) {
    
        solve();

    }

    return 0;
}