poj 2960 S-Nim（Java）

这题题目贼长…….

Arthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows:
The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.
The players take turns chosing a heap and removing a positive number of beads from it.
The first player not able to make a move, loses.
Arthur and Caroll really enjoyed playing this simple game until they
recently learned an easy way to always be able to find the best move:
Xor the number of beads in the heaps in the current position (i.e. if we have 2, 4 and 7 the xor-sum will be 1 as 2 xor 4 xor 7 = 1).
If the xor-sum is 0, too bad, you will lose.
Otherwise, move such that the xor-sum becomes 0. This is always possible.
It is quite easy to convince oneself that this works. Consider these facts:
The player that takes the last bead wins.
After the winning player’s last move the xor-sum will be 0.
The xor-sum will change after every move.
Which means that if you make sure that the xor-sum always is 0 when you have made your move, your opponent will never be able to win, and, thus, you will win.

Understandibly it is no fun to play a game when both players know how to play perfectly (ignorance is bliss). Fourtunately, Arthur and Caroll soon came up with a similar game, S-Nim, that seemed to solve this problem. Each player is now only allowed to remove a number of beads in some predefined set S, e.g. if we have S = {2, 5} each player is only allowed to remove 2 or 5 beads. Now it is not always possible to make the xor-sum 0 and, thus, the strategy above is useless. Or is it?

your job is to write a program that determines if a position of S-Nim is a losing or a winning position. A position is a winning position if there is at least one move to a losing position. A position is a losing position if there are no moves to a losing position. This means, as expected, that a position with no legal moves is a losing position.

Input
Input consists of a number of test cases.
For each test case: The first line contains a number k (0 < k ≤ 100) describing the size of S, followed by k numbers si (0 < si ≤ 10000) describing S. The second line contains a number m (0 < m ≤ 100) describing the number of positions to evaluate. The next m lines each contain a number l (0 < l ≤ 100) describing the number of heaps and l numbers hi (0 ≤ hi ≤ 10000) describing the number of beads in the heaps.
The last test case is followed by a 0 on a line of its own.
Output
For each position: If the described position is a winning position print a ‘W’.If the described position is a losing position print an ‘L’.
Print a newline after each test case.

其实仔细一看原来是把经典nim的解法给讲了一遍，可以跳过不看。

题目大意其实只要一点点，给出一个S集合，和几堆珠子，每次只能取集合内有的数目，里里外外看都是模板题…..然而这题我做了超久，因为输入打错了，更窒息的是我在debug的时候把输出代码也一起打错了….导致一直以为输入毫无问题，心态崩。（回来提醒一下，下面这个代码超时）

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) {
        InputReader reader = new InputReader();
        int k = reader.nextInt();
        while (k != 0) {
            int[] move = new int[k];
            for (int i = 0; i < k; i++) {
                move[i] = reader.nextInt();
            }
            int m = reader.nextInt();
            for (int i = 0; i < m; i++) {
                int[] heap = new int[reader.nextInt()];
                // System.out.println(heap.length);
                for (int j = 0; j < heap.length; j++) {
                    heap[j] = reader.nextInt();
                    //System.out.println(heap[i]);
                }
                if (grundy(heap, move) == 0) {
                    System.out.print("L");
                } else {
                    System.out.print("W");
                }
            }
            System.out.println();
            k = reader.nextInt();
        }
    }

    public static int grundy(int[] heap, int[] move) {
        int max = Arrays.stream(heap).max().getAsInt();
        int[] sg = new int[max + 1];
        for (int i = 1; i <= max; i++) {
            Set<Integer> set = new HashSet<>();
            for (int j = 0; j < move.length; j++) {
                if (move[j] <= i) {
                    set.add(sg[i - move[j]]);
                    //System.out.println(move[j] + " " + i);
                }
            }
            int res = 0;
            while (set.contains(res)) {
                res++;
            }
            sg[i] = res;
        }
        int ans = 0;
        for (int i = 0; i < heap.length; i++) {
            ans ^= sg[heap[i]];
             //System.out.println(heap[i]+" "+i);
        }
        // System.out.print(" "+ans+" ");
        return ans;
    }
}

class InputReader {
    BufferedReader buf;
    StringTokenizer tok;

    InputReader() {
        buf = new BufferedReader(new InputStreamReader(System.in));
    }

    boolean hasNext() {
        while (tok == null || !tok.hasMoreElements()) {
            try {
                tok = new StringTokenizer(buf.readLine());
            } catch (Exception e) {
                return false;
            }
        }
        return true;
    }

    String next() {
        if (hasNext())
            return tok.nextToken();
        return null;
    }

    String nextLine() throws IOException {
        if (hasNext())
            return buf.readLine();
        return null;
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    /*
     * BigInteger nextBigInteger() { return new BigInteger(next()); }
     * 
     * BigDecimal nextBigDecimal() { return new BigDecimal(next()); }
     */
}

其实还能优化的，每一组求一次sg数组就好了，oj炸了还没交，如果超时了再改吧….没超那就算了

（今早去交了，超时了…..这就是flag吧）

于是优化一波，也没用优化的很彻底，觉得差不多就交了，这次a了。AC代码：

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class Main {
    static int[] sg = new int[10005];

    public static void main(String[] args) {
        InputReader reader = new InputReader();
        PrintWriter out = new PrintWriter(System.out);
        int k = reader.nextInt();
        while (k != 0) {
            int[] move = new int[k];
            for (int i = 0; i < k; i++) {
                move[i] = reader.nextInt();
            }
            grundy(move);
            int m = reader.nextInt();
            for (int i = 0; i < m; i++) {
                int[] heap = new int[reader.nextInt()];
                for (int j = 0; j < heap.length; j++) {
                    heap[j] = reader.nextInt();
                }
                if (judge(heap)) {
                    out.print("L");
                } else {
                    out.print("W");
                }
            }
            Arrays.fill(sg, 0);
            out.println();
            k = reader.nextInt();
        }
        out.close();
    }

    public static void grundy(int[] move) {
        for (int i = 1; i <= 10000; i++) {
            Set<Integer> set = new HashSet<>();
            for (int j = 0; j < move.length; j++) {
                if (move[j] <= i) {
                    set.add(sg[i - move[j]]);
                    // System.out.println(move[j] + " " + i);
                }
            }
            int res = 0;
            while (set.contains(res)) {
                res++;
            }
            sg[i] = res;
        }
    }

    public static boolean judge(int[] heap) {
        int ans = 0;
        for (int i = 0; i < heap.length; i++) {
            ans ^= sg[heap[i]];
        }
        return ans == 0;
    }
}

class InputReader {
    BufferedReader buf;
    StringTokenizer tok;

    InputReader() {
        buf = new BufferedReader(new InputStreamReader(System.in));
    }

    boolean hasNext() {
        while (tok == null || !tok.hasMoreElements()) {
            try {
                tok = new StringTokenizer(buf.readLine());
            } catch (Exception e) {
                return false;
            }
        }
        return true;
    }

    String next() {
        if (hasNext())
            return tok.nextToken();
        return null;
    }

    String nextLine() throws IOException {
        if (hasNext())
            return buf.readLine();
        return null;
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    /*
     * BigInteger nextBigInteger() { return new BigInteger(next()); }
     * 
     * BigDecimal nextBigDecimal() { return new BigDecimal(next()); }
     */
}