Submission #8843440

---

Source Code Expand

import java.io.*;
import java.util.*;

class Tofu {
  final int x, y, z;
  final int m;
  final int[][] xyzs;
  
  Tofu(int x, int y, int z, int m, int[][] xyzs) {
    this.x = x;
    this.y = y;
    this.z = z;
    this.m = m;
    this.xyzs = xyzs;
  }
  
  int[] calculate() {
    int xMin = Integer.MAX_VALUE;
    int yMin = Integer.MAX_VALUE;
    int zMin = Integer.MAX_VALUE;
    int xMax = 0;
    int yMax = 0;
    int zMax = 0;
    for (int[] xyz : xyzs) {
      xMin = Math.min(xMin, xyz[0]);
      yMin = Math.min(yMin, xyz[1]);
      zMin = Math.min(zMin, xyz[2]);
      xMax = Math.max(xMax, xyz[0]);
      yMax = Math.max(yMax, xyz[1]);
      zMax = Math.max(zMax, xyz[2]);
    }
    
    return new int[]{
      xMin,
      yMin,
      zMin,
      x - xMax - 1,
      y - yMax - 1,
      z - zMax - 1
    };
  }
}

class Solver {
  final int n;
  final Tofu[] ts;
  
  Solver(int n, Tofu[] ts) {
    this.n = n;
    this.ts = ts;
  }
  
  public String solve() {
    int xor = 0;
    for (Tofu t : ts) {
      for (int v : t.calculate()) {
        xor = xor ^ v;
      }
    }
    return xor == 0 ? "LOSE" : "WIN";
  }
}

public class Main {
  private static void execute(ContestReader reader, PrintWriter out) {
    int n = reader.nextInt();
    Tofu[] ts = new Tofu[n];
    for (int i = 0; i < n; i++) {
      int x = reader.nextInt();
      int y = reader.nextInt();
      int z = reader.nextInt();
      int m = reader.nextInt();
      int[][] xyzs = reader.nextInt(m, 3);
      ts[i] = new Tofu(x, y, z, m, xyzs);
    }
    out.println(new Solver(n, ts).solve());
  }
  
  public static void main(String[] args) {
    ContestReader reader = new ContestReader(System.in);
    PrintWriter out = new PrintWriter(System.out);
    execute(reader, out);
    out.flush();
  }
}

class ContestReader {
  private BufferedReader reader;
  private StringTokenizer tokenizer;
  
  ContestReader(InputStream in) {
    reader = new BufferedReader(new InputStreamReader(in));
  }
  
  public String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }
  
  public int nextInt() {
    return Integer.parseInt(next());
  }
  
  public long nextLong() {
    return Long.parseLong(next());
  }
  
  public double nextDouble() {
    return Double.parseDouble(next());
  }
  
  public String[] next(int n) {
    String[] array = new String[n];
    for (int i = 0; i < n; i++) {
      array[i] = next();
    }
    return array;
  }
  
  public int[] nextInt(int n) {
    int[] array = new int[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextInt();
    }
    return array;
  }
  
  public long[] nextLong(int n) {
    long[] array = new long[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextLong();
    }
    return array;
  }
  
  public double[] nextDouble(int n) {
    double[] array = new double[n];
    for (int i = 0; i < n; i++) {
      array[i] = nextDouble();
    }
    return array;
  }
  
  public char[] nextCharArray() {
    return next().toCharArray();
  }
  
  public int[][] nextInt(int n, int m) {
    int[][] matrix = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextInt();
      }
    }
    return matrix;
  }
  
  public long[][] nextLong(int n, int m) {
    long[][] matrix = new long[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextLong();
      }
    }
    return matrix;
  }
  
  public double[][] nextDouble(int n, int m) {
    double[][] matrix = new double[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        matrix[i][j] = nextDouble();
      }
    }
    return matrix;
  }
  
  public char[][] nextCharArray(int n) {
    char[][] matrix = new char[n][];
    for (int i = 0; i < n; i++) {
      matrix[i] = next().toCharArray();
    }
    return matrix;
  }
}

Submission Info

Judge Result