結果
| 問題 | No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい |
| ユーザー |
 ぴろず
|
| 提出日時 | 2016-10-14 22:56:29 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,403 bytes |
| コンパイル時間 | 3,974 ms |
| コンパイル使用メモリ | 93,332 KB |
| 実行使用メモリ | 66,208 KB |
| 最終ジャッジ日時 | 2024-11-22 08:34:08 |
| 合計ジャッジ時間 | 21,310 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 4 WA * 44 |
ソースコード
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)->Integer.compare(passed[l1.get(0).u], passed[l2.get(0).u]));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;}@Overridepublic 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) {}}}