結果
問題 | No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい |
ユーザー | ぴろず |
提出日時 | 2016-10-14 23:03:36 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 566 ms / 4,000 ms |
コード長 | 5,545 bytes |
コンパイル時間 | 4,651 ms |
コンパイル使用メモリ | 82,440 KB |
実行使用メモリ | 66,976 KB |
最終ジャッジ日時 | 2023-08-14 12:33:12 |
合計ジャッジ時間 | 19,253 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 472 ms
65,904 KB |
testcase_01 | AC | 401 ms
63,996 KB |
testcase_02 | AC | 287 ms
61,356 KB |
testcase_03 | AC | 418 ms
64,120 KB |
testcase_04 | AC | 407 ms
63,664 KB |
testcase_05 | AC | 351 ms
63,452 KB |
testcase_06 | AC | 566 ms
66,976 KB |
testcase_07 | AC | 313 ms
60,660 KB |
testcase_08 | AC | 387 ms
65,816 KB |
testcase_09 | AC | 376 ms
62,588 KB |
testcase_10 | AC | 363 ms
60,528 KB |
testcase_11 | AC | 396 ms
65,232 KB |
testcase_12 | AC | 369 ms
60,360 KB |
testcase_13 | AC | 290 ms
60,040 KB |
testcase_14 | AC | 310 ms
60,188 KB |
testcase_15 | AC | 266 ms
62,288 KB |
testcase_16 | AC | 398 ms
63,832 KB |
testcase_17 | AC | 399 ms
63,344 KB |
testcase_18 | AC | 419 ms
63,736 KB |
testcase_19 | AC | 304 ms
60,200 KB |
testcase_20 | AC | 300 ms
61,160 KB |
testcase_21 | AC | 318 ms
62,064 KB |
testcase_22 | AC | 392 ms
60,784 KB |
testcase_23 | AC | 334 ms
60,488 KB |
testcase_24 | AC | 285 ms
60,284 KB |
testcase_25 | AC | 351 ms
60,528 KB |
testcase_26 | AC | 295 ms
61,688 KB |
testcase_27 | AC | 341 ms
60,192 KB |
testcase_28 | AC | 287 ms
58,176 KB |
testcase_29 | AC | 361 ms
64,584 KB |
testcase_30 | AC | 70 ms
51,400 KB |
testcase_31 | AC | 71 ms
51,340 KB |
testcase_32 | AC | 425 ms
64,956 KB |
testcase_33 | AC | 454 ms
62,344 KB |
testcase_34 | AC | 325 ms
62,480 KB |
testcase_35 | AC | 68 ms
51,604 KB |
testcase_36 | AC | 70 ms
51,604 KB |
testcase_37 | AC | 70 ms
49,420 KB |
testcase_38 | AC | 72 ms
51,512 KB |
testcase_39 | AC | 90 ms
51,528 KB |
testcase_40 | AC | 87 ms
52,644 KB |
testcase_41 | AC | 150 ms
54,716 KB |
testcase_42 | AC | 157 ms
54,884 KB |
testcase_43 | AC | 151 ms
54,460 KB |
testcase_44 | AC | 143 ms
54,144 KB |
testcase_45 | AC | 110 ms
52,752 KB |
testcase_46 | AC | 198 ms
56,996 KB |
testcase_47 | AC | 193 ms
57,664 KB |
ソースコード
package no432; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Collection; import java.util.InputMismatchException; import java.util.List; import java.util.Map; import java.util.NoSuchElementException; import java.util.PriorityQueue; import java.util.stream.Collectors; public class Main { public static void main(String[] args) { IO io = new IO(); int n = io.nextInt(); int k = io.nextInt(); Team[] t = new Team[n]; for(int i=0;i<n;i++) { t[i] = new Team(i,io.nextInt(),io.nextInt(),io.nextInt()); } Arrays.sort(t, (t1,t2)-> -Integer.compare(t1.s, t2.s)); int passedSum = 0; int[] passed = new int[100010]; int begin = 0; ArrayList<Integer> ans = new ArrayList<>(); while(begin < n && passedSum < k) { int end = begin + 1; while (end < n && t[end].s == t[begin].s) { end++; } Map<Integer,List<Team>> map = Arrays.stream(t, begin, end).collect(Collectors.groupingBy((x)->x.u)); Collection<List<Team>> univs = map.values(); for(List<Team> li: univs) { li.sort((t1,t2)-> -Integer.compare(t1.p, t2.p)); } PriorityQueue<List<Team>> pq = new PriorityQueue<>((l1,l2)->{ Team t1 = l1.get(l1.size()-1); Team t2 = l2.get(l2.size()-1); int x = Integer.compare(passed[t1.u], passed[t2.u]); if (x != 0) return x; return Integer.compare(t1.p, t2.p); }); pq.addAll(univs); while(!pq.isEmpty() && passedSum < k) { List<Team> li = pq.poll(); Team pass = li.get(li.size() - 1); li.remove(li.size() - 1); ans.add(pass.id); passed[pass.u]++; passedSum++; if (li.size() > 0) { pq.offer(li); } } begin = end; } for(int x: ans) { io.println(x); } io.flush(); } } class Team { int id,s,p,u; public Team(int id, int s, int p, int u) { super(); this.id = id; this.s = s; this.p = p; this.u = u; } @Override public String toString() { return "Team [id=" + id + ", s=" + s + ", p=" + p + ", u=" + u + "]"; } } class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} 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 static boolean isNewLine(int c) { return c == '\n' || c == '\r';} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; 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 char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(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() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;} public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try {in.close();} catch (IOException e) {}} }