Submission #1754067

---

Source Code Expand

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

public class Main {
    static IO io = new IO();
    public static void main(String[] args) {

        int w = io.nextInt();
        int h = io.nextInt();
        int n = io.nextInt();
        int x[] = new int[n];
        int y[] = new int[n];
        for (int i=0; i<n; i++) {
            x[i] = io.nextInt();
            y[i] = io.nextInt();
        }

        Deque<List<Integer>> que = new ArrayDeque<>();
        Deque<List<Integer>> tmp = new ArrayDeque<>();
        for (int i=0; i<n; i++) {
            List<Integer> init = new ArrayList<>();
            init.add(i);
            tmp.offer(init);
        }

        // 並び方の列挙
        while (!tmp.isEmpty()) {
            List<Integer> poll = tmp.poll();
            if (poll.size()==n) {
                que.offer(poll);
            }
            for (int i=0; i<n; i++) {
                if (!poll.contains(i)) {
                    List<Integer> next = new ArrayList<>(poll);
                    next.add(i);
                    tmp.offer(next);
                }
            }
        }

        long ans = 0;
        int dx[] = {0, 1, 0, -1};
        int dy[] = {1, 0, -1, 0};

        // 総当たり計算
        while (!que.isEmpty()) {
            List<Integer> poll = que.poll();
            boolean map[][] = new boolean[w+1][h+1];
            long pre = 0;
            for (int k=0; k<n; k++) {
                int now = poll.get(k);
                // まず装置の足元の金塊を回収
                pre++;
                map[x[now]][y[now]] = true;
                //System.out.println("(" + x[now] + "," + y[now] + ")の金塊回収装置を使います");
                for (int i=0; i<4; i++) {
                    int j = 1;
                    while (1<=x[now]+j*dx[i] && x[now]+j*dx[i]<=w && 1<=y[now]+j*dy[i] && y[now]+j*dy[i]<=h
                            && !map[x[now]+j*dx[i]][y[now]+j*dy[i]]) {
                        map[x[now]+j*dx[i]][y[now]+j*dy[i]] = true;
                        pre++;
                        //System.out.println("(" + (x[now]+j*dx[i]) + "," + (y[now]+j*dy[i]) + ")を回収");
                        j++;
                    }
                }
            }
            ans = Math.max(pre, ans);
        }

        System.out.println(ans);

    }

    static class IO extends PrintWriter {
        private final InputStream in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        IO() {
            this(System.in);
        }

        IO(InputStream source) {
            super(System.out);
            this.in = source;
        }

        boolean hasNextByte() {
            if (ptr < buflen) return true;
            else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) return false;
            }
            return true;
        }

        int readByte() {
            if (hasNextByte()) return buffer[ptr++];
            else return -1;
        }

        boolean isPrintableChar(int c) {
            return 33 <= c && c <= 126;
        }

        void skipUnprintable() {
            while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
        }

        boolean hasNext() {
            skipUnprintable();
            return hasNextByte();
        }

        long nextLong() {
            if (!hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) throw new NumberFormatException();
            while (true) {
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                } else if (b == -1 || !isPrintableChar(b)) return minus ? -n : n;
                else throw new NumberFormatException();
                b = readByte();
            }
        }

        int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }

        public void close() {
            super.close();
            try {
                in.close();
            } catch (IOException ignored) {
            }
        }
    }
}

Submission Info

Judge Result