結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー yuya178yuya178
提出日時 2017-11-08 15:41:33
言語 Java21
(openjdk 21)
結果
AC  
実行時間 567 ms / 4,000 ms
コード長 4,364 bytes
コンパイル時間 2,340 ms
コンパイル使用メモリ 79,644 KB
実行使用メモリ 67,588 KB
最終ジャッジ日時 2023-08-15 21:15:07
合計ジャッジ時間 20,155 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 466 ms
67,588 KB
testcase_01 AC 455 ms
67,260 KB
testcase_02 AC 421 ms
65,376 KB
testcase_03 AC 354 ms
65,340 KB
testcase_04 AC 433 ms
65,092 KB
testcase_05 AC 440 ms
65,632 KB
testcase_06 AC 567 ms
67,532 KB
testcase_07 AC 340 ms
66,008 KB
testcase_08 AC 406 ms
65,112 KB
testcase_09 AC 424 ms
65,448 KB
testcase_10 AC 390 ms
64,076 KB
testcase_11 AC 424 ms
63,664 KB
testcase_12 AC 380 ms
63,020 KB
testcase_13 AC 368 ms
63,064 KB
testcase_14 AC 397 ms
63,016 KB
testcase_15 AC 404 ms
63,332 KB
testcase_16 AC 425 ms
65,356 KB
testcase_17 AC 452 ms
65,376 KB
testcase_18 AC 439 ms
65,116 KB
testcase_19 AC 445 ms
63,148 KB
testcase_20 AC 372 ms
63,352 KB
testcase_21 AC 356 ms
63,472 KB
testcase_22 AC 403 ms
62,764 KB
testcase_23 AC 374 ms
63,536 KB
testcase_24 AC 444 ms
62,312 KB
testcase_25 AC 433 ms
63,540 KB
testcase_26 AC 415 ms
63,280 KB
testcase_27 AC 405 ms
63,192 KB
testcase_28 AC 412 ms
63,196 KB
testcase_29 AC 404 ms
63,308 KB
testcase_30 AC 51 ms
49,772 KB
testcase_31 AC 48 ms
49,852 KB
testcase_32 AC 479 ms
65,608 KB
testcase_33 AC 489 ms
65,760 KB
testcase_34 AC 394 ms
65,784 KB
testcase_35 AC 47 ms
49,840 KB
testcase_36 AC 47 ms
49,860 KB
testcase_37 AC 50 ms
50,484 KB
testcase_38 AC 51 ms
49,996 KB
testcase_39 AC 61 ms
51,788 KB
testcase_40 AC 62 ms
49,772 KB
testcase_41 AC 125 ms
54,076 KB
testcase_42 AC 129 ms
53,528 KB
testcase_43 AC 103 ms
52,460 KB
testcase_44 AC 104 ms
52,364 KB
testcase_45 AC 78 ms
51,876 KB
testcase_46 AC 147 ms
54,296 KB
testcase_47 AC 139 ms
54,264 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    int MOD = 1000000007;
    long inf = Long.MAX_VALUE;

    void solve()
    {
        int n = ni();
        int k = ni();
        int[][] g = new int[n][];
        for(int i = 0; i < n; i++){
            g[i] = new int[]{ni(), ni(), ni(), i};
        }
        Arrays.sort(g, (a,b) -> Long.compare((b[0]*1000000000000l-b[1]), (a[0]*1000000000000l-a[1])));
        HashMap<Integer, Integer> map = new HashMap<>();
        long[][] t = new long[n][];
        for (int i = 0; i < n; i++) {
            int a = g[i][2];
            int b = map.getOrDefault(a,0);
            t[i] = new long[]{(g[i][0]*1000000000000l-g[i][1]-b*10000000l), g[i][3]};
            map.merge(a, 1, (x, y) -> x + y);
        }
        Arrays.sort(t, (a,b) -> Long.compare(b[0],a[0]));
        for(int i = 0; i < k; i++){
            out.println(t[i][1]);
        }

    }
 
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0