結果

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

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 558 ms
67,236 KB
testcase_01 AC 567 ms
67,172 KB
testcase_02 AC 528 ms
64,952 KB
testcase_03 AC 470 ms
64,944 KB
testcase_04 AC 502 ms
65,112 KB
testcase_05 AC 536 ms
65,328 KB
testcase_06 AC 551 ms
67,336 KB
testcase_07 AC 472 ms
65,528 KB
testcase_08 AC 514 ms
65,380 KB
testcase_09 AC 497 ms
65,092 KB
testcase_10 AC 447 ms
62,704 KB
testcase_11 AC 567 ms
62,880 KB
testcase_12 AC 483 ms
62,976 KB
testcase_13 AC 474 ms
62,256 KB
testcase_14 AC 532 ms
63,068 KB
testcase_15 AC 437 ms
62,608 KB
testcase_16 AC 538 ms
64,956 KB
testcase_17 AC 575 ms
62,864 KB
testcase_18 AC 511 ms
64,656 KB
testcase_19 AC 526 ms
62,932 KB
testcase_20 AC 449 ms
62,364 KB
testcase_21 AC 467 ms
62,896 KB
testcase_22 AC 506 ms
62,940 KB
testcase_23 AC 440 ms
62,740 KB
testcase_24 AC 538 ms
62,684 KB
testcase_25 AC 554 ms
62,860 KB
testcase_26 AC 506 ms
62,512 KB
testcase_27 AC 497 ms
62,648 KB
testcase_28 AC 497 ms
62,772 KB
testcase_29 AC 542 ms
63,012 KB
testcase_30 AC 63 ms
50,428 KB
testcase_31 AC 64 ms
50,112 KB
testcase_32 AC 567 ms
64,536 KB
testcase_33 AC 501 ms
65,100 KB
testcase_34 AC 504 ms
64,376 KB
testcase_35 AC 65 ms
50,684 KB
testcase_36 AC 62 ms
50,388 KB
testcase_37 AC 64 ms
50,260 KB
testcase_38 AC 66 ms
50,148 KB
testcase_39 AC 80 ms
51,320 KB
testcase_40 AC 80 ms
51,196 KB
testcase_41 AC 152 ms
52,856 KB
testcase_42 AC 152 ms
52,448 KB
testcase_43 AC 133 ms
51,912 KB
testcase_44 AC 133 ms
51,884 KB
testcase_45 AC 95 ms
51,404 KB
testcase_46 AC 165 ms
53,092 KB
testcase_47 AC 163 ms
52,940 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