Submission #1174095

---

Source Code Expand

import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.Stream;

public class Main {
    public static void main(String[] args) {
        new Main().solve();
    }

    private static final int[] dx = {1, 0, -1, 0};
    private static final int[] dy = {0, 1, 0, -1};
    private XorShift random = new XorShift();
    int n = 8;

    void solve() {
        try (Scanner in = new Scanner(System.in)) {
            for (int turn = 0; turn < 1000; ++turn) {
                int d = in.nextInt();
                int t = in.nextInt();
                Tank[] tanks = new Tank[n];
                for (int i = 0; i < n; ++i) {
                    tanks[i] = new Tank();
                    tanks[i].i = i + 1;
                    tanks[i].c = in.nextInt();
                }
                for (int i = 0; i < n; ++i) {
                    tanks[i].a = in.nextInt();
                }
                solve(d, t, tanks);
            }
        }
    }

    class Tank {
        int c, a, i;
    }

    void solve(int D, int T, Tank[] tanks) {
        int sum = Stream.of(tanks).mapToInt(x -> x.c).sum();
        if (sum < 50) {
            Arrays.sort(tanks, (a, b) -> a.c - b.c);
            System.out.println("change " + tanks[0].i);
            return;
        }
        for (Tank t : tanks) {
            if (t.c != t.a) {
                System.out.println("fill " + t.i);
                return;
            }
        }
        if (D < 35) {
            System.out.println("pass");
            return;
        }
        Arrays.sort(tanks, (a, b) -> b.c - a.c);
        for (int b = 1; b < (1 << n); ++b) {
            int count = Integer.bitCount(b);
            int s = 0;
            for (int i = 0; i < n; ++i) {
                if ((b & (1 << i)) != 0) {
                    s += tanks[i].c;
                }
            }
            if (s == D) {
                StringBuilder sb = new StringBuilder();
                sb.append("sell ").append(count);
                for (int i = 0; i < n; ++i) {
                    if ((b & (1 << i)) != 0) {
                        sb.append(" " + tanks[i].i);
                    }
                }
                System.out.println(sb);
                return;
            }
        }
        System.out.println("pass");
    }


    private final class XorShift {
        int x = 123456789;
        int y = 362436069;
        int z = 521288629;
        int w = 88675123;

        int nextInt(int n) {
            final int t = x ^ (x << 11);
            x = y;
            y = z;
            z = w;
            w = (w ^ (w >>> 19)) ^ (t ^ (t >>> 8));
            final int r = w % n;
            return r < 0 ? r + n : r;
        }

        int nextInt() {
            final int t = x ^ (x << 11);
            x = y;
            y = z;
            z = w;
            return w = (w ^ (w >>> 19)) ^ (t ^ (t >>> 8));
        }

        long nextLong() {
            return ((long) nextInt() << 32) | (long) nextInt();
        }
    }

    private void tr(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }
}

Submission Info

Judge Result