結果

問題 No.2364 Knapsack Problem
ユーザー AsahiAsahi
提出日時 2023-06-30 22:53:52
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 10,745 bytes
コンパイル時間 2,989 ms
コンパイル使用メモリ 87,396 KB
実行使用メモリ 53,352 KB
最終ジャッジ日時 2024-07-07 10:46:20
合計ジャッジ時間 5,236 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
41,420 KB
testcase_01 AC 68 ms
38,252 KB
testcase_02 RE -
testcase_03 RE -
testcase_04 AC 66 ms
38,400 KB
testcase_05 RE -
testcase_06 WA -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 AC 72 ms
38,272 KB
testcase_11 RE -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 69 ms
37,968 KB
testcase_18 WA -
testcase_19 AC 69 ms
38,008 KB
testcase_20 WA -
testcase_21 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

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

class Main{
    static PrintWriter out = new PrintWriter(System.out);
    static In in  = new In();
    static Out outer = new Out();
    static final int [] directionX4 = {0,1,0,-1};
    static final int [] directionY4 = {-1,0,1,0};
    static final int [] directionX8 = {-1,-1,0,1,1,1,0,-1};
    static final int [] directionY8 = {0,1,1,1,0,-1,-1,-1};
    static final long MOD7 = 1000000007;
    static final long MOD9 = 998244353 ;
    static final int  inf = (1 << 30);
    static final long lnf = (1L << 60);
    final String yes = "Yes";
    final String no  = "No" ;
    // (*^8^人) 通ってぇぇ
    void solve() {
        int n = in.nextInt() , m = in.nextInt() , w = in.nextInt();
        int  [] A = in.IntArray(n);
        long [] B = in.LongArray(n);
        int  [] C = in.IntArray(n);
        long [] D = in.LongArray(n);
        // 動的計画法と順列を組み合わせようにもひらめかなかないから貪欲~
        PAIR [] product = new PAIR[n];
        PAIR [] magic = new PAIR[m];
        for(int i = 0 ; i < n ; i ++ ) 
            product[i] = new PAIR(A[i],B[i]);
        for(int i = 0 ; i < m ; i ++ )
            magic[i] = new PAIR(C[i],D[i]);
        Arrays.sort(product,Comparator.comparing(PAIR::second,Comparator.reverseOrder()).thenComparing(PAIR::first));
        Arrays.sort(magic,Comparator.comparing(PAIR::second).thenComparing(PAIR::first,Comparator.reverseOrder()));
        int pos = 0;
        long ans = 0 ;
        PAIR now = new PAIR(0,0);
        for(int i = 0 ; i < n ; i ++ ) {
            int f = now.first;
            long s = now.second;
            if(f + product[i].first <= w) {
                f += product[i].first;
                s += product[i].second;
                now = new PAIR(f, s);
            }
            else if(pos < m) {
                while(f + product[i].first > w && pos < m) {
                    if(f - magic[pos].first < 0) {
                        pos++;
                        continue;
                    }
                    f -= magic[pos].first;
                    s -= magic[pos].second;
                    pos++;
                }
                if(f + product[i].first <= w)
                    now = new PAIR(f + product[i].first , s + product[i].second);
            }
            else{
                break;
            }
            ans = Math.max(ans,now.second);
        }
        out.println(ans);
    }
    public static void main(String[] args) {
        new Main().solve();
        out.flush();
    }
}
class PAIR {
    int first ; long second;
    PAIR(int first , long second) {
        this.first = first;
        this.second = second;
    }
    int first() {
        return this.first;
    }
    long second() {
        return this.second;
    }
}
class Out{
    void print(int    [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(long   [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(String [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(char   [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(double [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(boolean[] a) { System.out.println(Arrays.toString(a)) ; }
    void print(int    [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(long   [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(String [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(char   [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(double [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(boolean[][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(int begin , int end) { for(int i = begin ; i < end ; i ++ ) System.out.printf("%3d",i); }
}
class LongPair implements Comparable<LongPair>{
    private long first ;
    private long second;
    LongPair(long first,long second) {
        this.first = first;
        this.second = second;
    }
    long first()  { 
        return this.first ;
    }
    long second() { 
        return this.second;
    }
    @Override
    public boolean equals(Object o) {
        if (!(o instanceof LongPair)) {
            return false;
        }
        LongPair that = (LongPair)o;
        return first == that.first && second == that.second;
    }
    @Override
    public int hashCode() {
        return Objects.hash(first, second);
    }
    @Override
    public int compareTo(LongPair o) {
        return first == o.first ? Long.compare(second, o.second) : Long.compare(first, o.first);
    }
    @Override
    public String toString(){ 
        return first()+" "+second();
    }
}
class Pair implements Comparable<Pair>{
    private int first ;
    private int second;
    Pair(int first,int second) {
        this.first = first;
        this.second = second;
    }
    int first()  { 
        return this.first ;
    }
    int second() { 
        return this.second;
    }
    @Override
    public boolean equals(Object o) {
        if (!(o instanceof Pair)) {
            return false;
        }
        Pair that = (Pair)o;
        return first == that.first && second == that.second;
    }
    @Override
    public int hashCode() {
        return Objects.hash(first, second);
    }
    @Override
    public int compareTo(Pair o) {
        return first == o.first ? Integer.compare(second, o.second) : Integer.compare(first, o.first);
    }
    @Override
    public String toString(){ 
        return first()+" "+second();
    }
}

class Triple {
    private int first;
    private int second;
    private int third;
    Triple(int first, int second, int third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }
    int first() {
        return this.first;
    }
    int second() {
        return this.second;
    }
    int third() {
        return this.third;
    }
    @Override
    public boolean equals(Object obj) {
        if (this == obj) {
            return true;
        }

        if (obj == null || getClass() != obj.getClass()) {
            return false;
        }

        Triple other = (Triple) obj;
        return this.first == other.first && this.second == other.second && this.third == other.third;
    }

    @Override
    public int hashCode() {
        int result = 17;
        result = 31 * result + first;
        result = 31 * result + second;
        result = 31 * result + third;
        return result;
    }
    @Override 
    public String toString() {
        return this.first+" "+this.second+" "+this.third;
    }
}

class In{
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private 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;
    }
    private int readByte() { 
        if (hasNextByte()) return buffer[ptr++]; else return -1;
    }
    private static boolean isPrintableChar(int c) { 
        return 33 <= c && c <= 126;
    }
    public boolean hasNext() { 
        while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
            ptr++; 
        }
        return hasNextByte();
    }
    String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    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;
    }
    double nextDouble() { 
        return Double.parseDouble(next());
    }
    char nextChar() {
        return next().charAt(0);
    }
    int [] IntArray(int n) {
        final int [] Array = new int [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextInt();
        }
        return Array;
    }
    int [][] IntArray(int n , int m) {
        final int [][] Array = new int [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = IntArray(m);
        }
        return Array;
    }   
    long [] LongArray(int n) {
        final long [] Array = new long [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextLong();
        }
        return Array;
    }
    long [][] LongArray(int n , int m) {
        final long [][] Array = new long [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = LongArray(m);
        }
        return Array;
    }
    String [] StringArray(int n) {
        final String [] Array = new String [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next();
        }
        return Array;
    }
    char [] CharArray(int n) {
        final char [] Array = new char[n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().charAt(0);
        }
        return Array;
    }
    char [][] CharArray(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().toCharArray();
        }
        return Array;
    }
    char [][] CharArray2(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j < n ; j ++ ) {
                Array[i][j] = next().charAt(0);
            }
        }
        return Array;
    }
}
0