P1488 肥猫的游戏

P1488 肥猫的游戏

解题思路：这题就是分情况讨论。当第黑色三角形在最外面的时候，当黑色三角形被两个面包围的时候，当黑色三角形被三个面包围的时候。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef unsigned long long ull;
typedef pair<ll,int>P;
const int inf = 0x7f7f7f7f;
const ll INF = 1e16;
const int N = 5e4+10;
const ull base = 131;
const ll mod =  1e9+7;
const double PI = acos(-1.0);
const double eps = 1e-4;

inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}
inline string readstring(){string str;char s=getchar();while(s==' '||s=='\n'||s=='\r'){s=getchar();}while(s!=' '&&s!='\n'&&s!='\r'){str+=s;s=getchar();}return str;}
int random(int n){return (int)(rand()*rand())%n;}
void writestring(string s){int n = s.size();for(int i = 0;i < n;i++){printf("%c",s[i]);}}
ll fast_power(ll a,ll p){
    ll ans = 1;
    while(p){
        if(p&1) ans = (ans*a)%mod;
        p >>= 1;
        a = (a*a)%mod;
    }
    return ans;
}


int num[N];

int main(){
    srand((unsigned)time(NULL));
    //freopen(  "out.txt","w",stdout);
    int n = read();
    int a,b,c;
    for(int i = 1;i <= n-2;i++){
        int x = read(),y = read(),z = read();
        x++;y++;z++;
        num[x]++;
        num[y]++;
        num[z]++;
        if(i == 1){
            a = x;
            b = y;
            c = z;
        }
    }
    if(num[a]==1||num[b]==1||num[c]==1){
        puts("JMcat Win");
    }else if(n%2){
        puts("PZ Win");
    }else {
        puts("JMcat Win");
    }
    return 0;
}