#450954 (Java) No.472 平均順位

• 問題: No.472 平均順位
• ユーザー: 37zigen
• 提出日時: 2020-03-29 04:48:21
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 636 ms / 2,000 ms
• コード長: 3,028 bytes
• コンパイル時間: 2,333 ms
• コンパイル使用メモリ: 81,244 KB
• 実行使用メモリ: 59,936 KB
• 最終ジャッジ日時: 2025-01-02 13:02:20
• 合計ジャッジ時間: 8,881 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 16

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Comparator;
import java.util.NoSuchElementException;
import java.util.Scanner;
public class Main { 
    public static void main(String[] args) {
        //long t = System.currentTimeMillis();
        new Main().run();
        //System.err.println(System.currentTimeMillis() - t);
    }
    
    void run() {
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int P=sc.nextInt();
        int base=0;
        int[][] A=new int[N][4];
        for(int i=0;i<N;++i) {
            A[i][0]=sc.nextInt();
            A[i][1]=sc.nextInt();
            A[i][2]=sc.nextInt();
            A[i][3]=1;
            base+=A[i][0];
            for(int j=3;j>=0;--j)A[i][j]=A[i][0]-A[i][j];
        }
        int[] dp=new int[P+1];
        for(int i=0;i<N;++i) {
            for(int solved=Math.min(P-1,3*i);solved>=0;--solved) {
                for(int add=1;add<=3&&solved+add<=P;++add) {
                    dp[solved+add]=Math.max(dp[solved+add], dp[solved]+A[i][add]);
                }
            }
        }
        System.out.println(1.*(base-dp[P])/N);
    }
    
    
    static void tr(Object... objects) {
        System.out.println(Arrays.deepToString(objects));
    }
}
    
    
class FastScanner {
    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;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public 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();
    }
    public 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();
        }
    }
    
    public int nextInt() {
        return (int)nextLong();
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX