Submission #8891368

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
#define BIT(S,i) ((S&(1ll<<i))>0)
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
constexpr long long INF = 1e18;

signed main(){
	int N;
	cin>>N;
	int XOR = 0;
	REP(i,N){
		int X,Y,Z;
		cin>>X>>Y>>Z;
		int M;
		cin>>M;
		int maxx,maxy,maxz,minx,miny,minz;
		maxx=maxy=maxz=-INF;
		minx=miny=minz=INF;
		REP(i,M){
			int x,y,z;
			cin>>x>>y>>z;
			CHMAX(maxx,x);
			CHMAX(maxy,y);
			CHMAX(maxz,z);
			CHMIN(minx,x);
			CHMIN(miny,y);
			CHMIN(minz,z);
		}
		XOR^=minx^miny^minz;
		XOR^=(X-1-maxx)^(Y-1-maxy)^(Z-1-maxz);
	}
	if(XOR)cout<<"WIN"<<endl;
	else cout<<"LOSE"<<endl;
}

Submission Info

Judge Result