結果

問題 No.3329 Only the Rightest Choice is Right!!!
コンテスト
ユーザー tenten
提出日時 2025-11-11 08:34:49
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 4,956 bytes
コンパイル時間 3,134 ms
コンパイル使用メモリ 90,916 KB
実行使用メモリ 44,224 KB
最終ジャッジ日時 2025-11-11 08:34:58
合計ジャッジ時間 8,720 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other TLE * 1 -- * 73
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;
import java.math.*;

public class Main {
    static int[] values;
    static int[] weights;
    static Result[][] dp;
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int w = sc.nextInt();
        values = new int[n];
        for (int i = 0; i < n; i++) {
            values[i] = sc.nextInt();
        }
        weights = new int[n];
        for (int i = 0; i < n; i++) {
            weights[i] = sc.nextInt();
        }
        dp = new Result[n][w + 1];
        Result ans = dfw(n - 1, w);
        System.out.println(ans.list.size());
        System.out.println(ans.list.stream().map(x -> x.toString()).collect(Collectors.joining(" ")));
    }
    
    static Result dfw(int idx, int v) {
        if (v < 0) {
            return null;
        }
        if (idx < 0) {
            return new Result(0);
        }
        if (dp[idx][v] == null) {
            Result left = dfw(idx - 1, v);
            Result right = dfw(idx - 1, v - weights[idx]);
            if (right == null) {
                dp[idx][v] = left;
            } else {
                right = right.add(idx + 1, values[idx]);
                if (left.compareTo(right) > 0) {
                    dp[idx][v] = left;
                } else {
                    dp[idx][v] = right;
                }
            }
        }
        return dp[idx][v];
    }
    
    static class Result {
        int value;
        List<Integer> list = new ArrayList<>();
        
        public Result(int value) {
            this.value = value;
        }
        
        public Result add(int idx, int v) {
            Result ans = new Result(value + v);
            ans.list.addAll(list);
            ans.list.add(idx);
            return ans;
        }
        
        public int compareTo(Result another) {
            if (value == another.value) {
                for (int i = 0; i < list.size() && i < another.list.size(); i++) {
                    if (list.get(i) != another.list.get(i)) {
                        return list.get(i) - another.list.get(i);
                    }
                }
                return list.size() - another.list.size();
            } else {
                return value - another.value;
            }
        }
    }
}

class FastScanner {
    private DataInputStream din;
    private byte[] buffer;
    private int bufferPointer, bytesRead;
    private static final int BUFFER_SIZE = 1 << 16; // 65,536 バイト

    public FastScanner() {
        din = new DataInputStream(System.in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    private byte read() {
        try {
            if (bufferPointer == bytesRead) {
                bytesRead = din.read(buffer, 0, BUFFER_SIZE);
                if (bytesRead == -1) return -1;
                bufferPointer = 0;
            }
            return buffer[bufferPointer++];
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    public String next() {
        byte b = read();
        // 空白文字を読み飛ばす
        while (isSpaceChar(b)) {
            b = read();
        }
        StringBuilder sb = new StringBuilder();
        while (!isSpaceChar(b)) {
            sb.append((char) b);
            b = read();
        }
        return sb.toString();
    }

    public int nextInt() {
        int ret = 0;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return neg ? -ret : ret;
    }

    public long nextLong() {
        long ret = 0;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10L + c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return neg ? -ret : ret;
    }

    public double nextDouble() {
        double ret = 0, div = 1;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (!isSpaceChar(c) && c != '.');
        if (c == '.') {
            while (!isSpaceChar(c = read())) {
                ret += (c - '0') / (div *= 10);
            }
        }
        return neg ? -ret : ret;
    }

    private boolean isSpaceChar(byte c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public void close() {
        try {
            if (din != null) din.close();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }
}
0