結果
問題 | No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい |
ユーザー | hiromi_ayase |
提出日時 | 2017-07-20 01:31:49 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 955 ms / 4,000 ms |
コード長 | 4,658 bytes |
コンパイル時間 | 2,515 ms |
コンパイル使用メモリ | 86,096 KB |
実行使用メモリ | 78,764 KB |
最終ジャッジ日時 | 2024-04-17 04:15:34 |
合計ジャッジ時間 | 23,939 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 748 ms
72,148 KB |
testcase_01 | AC | 643 ms
71,856 KB |
testcase_02 | AC | 317 ms
66,880 KB |
testcase_03 | AC | 595 ms
71,492 KB |
testcase_04 | AC | 595 ms
69,844 KB |
testcase_05 | AC | 448 ms
71,016 KB |
testcase_06 | AC | 955 ms
78,764 KB |
testcase_07 | AC | 379 ms
71,648 KB |
testcase_08 | AC | 537 ms
72,808 KB |
testcase_09 | AC | 541 ms
69,272 KB |
testcase_10 | AC | 511 ms
66,956 KB |
testcase_11 | AC | 668 ms
67,220 KB |
testcase_12 | AC | 551 ms
65,644 KB |
testcase_13 | AC | 317 ms
65,408 KB |
testcase_14 | AC | 445 ms
65,012 KB |
testcase_15 | AC | 189 ms
62,464 KB |
testcase_16 | AC | 616 ms
67,444 KB |
testcase_17 | AC | 645 ms
71,628 KB |
testcase_18 | AC | 668 ms
70,180 KB |
testcase_19 | AC | 315 ms
65,640 KB |
testcase_20 | AC | 356 ms
65,596 KB |
testcase_21 | AC | 388 ms
66,816 KB |
testcase_22 | AC | 594 ms
67,036 KB |
testcase_23 | AC | 463 ms
66,896 KB |
testcase_24 | AC | 330 ms
64,960 KB |
testcase_25 | AC | 544 ms
67,172 KB |
testcase_26 | AC | 365 ms
66,028 KB |
testcase_27 | AC | 478 ms
66,336 KB |
testcase_28 | AC | 314 ms
65,032 KB |
testcase_29 | AC | 519 ms
66,852 KB |
testcase_30 | AC | 56 ms
55,516 KB |
testcase_31 | AC | 58 ms
55,076 KB |
testcase_32 | AC | 611 ms
68,640 KB |
testcase_33 | AC | 730 ms
75,368 KB |
testcase_34 | AC | 489 ms
68,464 KB |
testcase_35 | AC | 56 ms
55,064 KB |
testcase_36 | AC | 54 ms
55,272 KB |
testcase_37 | AC | 55 ms
55,448 KB |
testcase_38 | AC | 57 ms
55,096 KB |
testcase_39 | AC | 84 ms
57,040 KB |
testcase_40 | AC | 87 ms
56,768 KB |
testcase_41 | AC | 158 ms
58,580 KB |
testcase_42 | AC | 154 ms
58,524 KB |
testcase_43 | AC | 151 ms
58,824 KB |
testcase_44 | AC | 159 ms
58,348 KB |
testcase_45 | AC | 150 ms
58,204 KB |
testcase_46 | AC | 275 ms
59,324 KB |
testcase_47 | AC | 272 ms
60,440 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.HashMap; import java.util.Map; import java.util.NoSuchElementException; import java.util.SortedSet; import java.util.TreeMap; import java.util.TreeSet; public class Main { public static void main(String[] args) { FastScanner sc = new FastScanner(); int N = sc.nextInt(); int K = sc.nextInt(); int[][][] table = new int[11][100001][]; int[] ptr = new int[11]; for (int i = 0; i < N; i ++) { int S = sc.nextInt(); int P = sc.nextInt(); int U = sc.nextInt(); int[] d = new int[3]; table[S][ptr[S]] = d; d[0] = P; d[1] = U; d[2] = i; ptr[S] ++; } for (int i = 0; i <= 10; i ++) { table[i] = Arrays.copyOf(table[i], ptr[i]); } int counter = 0; int[] uCount = new int[100001]; for (int i = 10; i >= 0; i--) { Map<Integer, SortedSet<int[]>> subMap = new HashMap<>(); TreeMap<Integer, SortedSet<int[]>> map = new TreeMap<>((a, b) -> { if (uCount[a] == uCount[b]) { if (subMap.get(a).first()[0] == subMap.get(b).first()[0]) { return a - b; } else { return subMap.get(a).first()[0] - subMap.get(b).first()[0]; } } else { return uCount[a] - uCount[b]; } }); for (int[] d : table[i]) { int U = d[1]; if (!subMap.containsKey(U)) { subMap.put(U, new TreeSet<>((a, b) -> a[0] - b[0])); } subMap.get(U).add(d); } for (Map.Entry<Integer, SortedSet<int[]>> entry : subMap.entrySet()) { map.put(entry.getKey(), entry.getValue()); } while (map.size() > 0) { SortedSet<int[]> set = map.firstEntry().getValue(); map.remove(map.firstKey()); int[] d = set.first(); set.remove(d); System.out.println(d[2]); counter ++; uCount[d[1]] ++; if (counter == K) { return; } if (set.size() > 0) { map.put(d[1], set); } } } } } class FastScanner { public static String debug = null; private final InputStream in = System.in; private int ptr = 0; private int buflen = 0; private byte[] buffer = new byte[1024]; private boolean eos = false; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { if (debug != null) { buflen = debug.length(); buffer = debug.getBytes(); debug = ""; eos = true; } else { buflen = in.read(buffer); } } catch (IOException e) { e.printStackTrace(); } if (buflen < 0) { eos = true; return false; } else 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 isEOS() { return this.eos; } 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(); } public long[] nextLongList(int n) { return nextLongTable(1, n)[0]; } public int[] nextIntList(int n) { return nextIntTable(1, n)[0]; } public long[][] nextLongTable(int n, int m) { long[][] ret = new long[n][m]; for (int i = 0; i < n; i ++) { for (int j = 0; j < m; j ++) { ret[i][j] = nextLong(); } } return ret; } public int[][] nextIntTable(int n, int m) { int[][] ret = new int[n][m]; for (int i = 0; i < n; i ++) { for (int j = 0; j < m; j ++) { ret[i][j] = nextInt(); } } return ret; } }