結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー ぴろずぴろず
提出日時 2016-10-14 23:03:36
言語 Java21
(openjdk 21)
結果
AC  
実行時間 676 ms / 4,000 ms
コード長 5,545 bytes
コンパイル時間 3,080 ms
コンパイル使用メモリ 93,964 KB
実行使用メモリ 64,908 KB
最終ジャッジ日時 2024-05-02 00:49:08
合計ジャッジ時間 21,736 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 560 ms
64,908 KB
testcase_01 AC 470 ms
62,600 KB
testcase_02 AC 331 ms
60,028 KB
testcase_03 AC 495 ms
62,580 KB
testcase_04 AC 468 ms
62,808 KB
testcase_05 AC 415 ms
62,400 KB
testcase_06 AC 676 ms
64,628 KB
testcase_07 AC 355 ms
59,932 KB
testcase_08 AC 423 ms
62,552 KB
testcase_09 AC 397 ms
61,272 KB
testcase_10 AC 416 ms
60,976 KB
testcase_11 AC 435 ms
61,420 KB
testcase_12 AC 441 ms
60,128 KB
testcase_13 AC 341 ms
58,768 KB
testcase_14 AC 362 ms
60,248 KB
testcase_15 AC 319 ms
58,620 KB
testcase_16 AC 450 ms
62,308 KB
testcase_17 AC 458 ms
63,344 KB
testcase_18 AC 469 ms
60,604 KB
testcase_19 AC 349 ms
58,584 KB
testcase_20 AC 346 ms
60,180 KB
testcase_21 AC 358 ms
58,908 KB
testcase_22 AC 435 ms
60,892 KB
testcase_23 AC 381 ms
59,160 KB
testcase_24 AC 337 ms
58,464 KB
testcase_25 AC 413 ms
59,132 KB
testcase_26 AC 374 ms
58,836 KB
testcase_27 AC 410 ms
60,312 KB
testcase_28 AC 339 ms
58,500 KB
testcase_29 AC 430 ms
63,328 KB
testcase_30 AC 86 ms
51,344 KB
testcase_31 AC 90 ms
51,052 KB
testcase_32 AC 520 ms
62,528 KB
testcase_33 AC 531 ms
60,812 KB
testcase_34 AC 406 ms
60,804 KB
testcase_35 AC 89 ms
51,040 KB
testcase_36 AC 89 ms
50,888 KB
testcase_37 AC 90 ms
50,916 KB
testcase_38 AC 92 ms
51,228 KB
testcase_39 AC 122 ms
51,644 KB
testcase_40 AC 122 ms
51,500 KB
testcase_41 AC 181 ms
53,100 KB
testcase_42 AC 185 ms
53,436 KB
testcase_43 AC 176 ms
53,380 KB
testcase_44 AC 174 ms
52,936 KB
testcase_45 AC 135 ms
51,892 KB
testcase_46 AC 226 ms
55,632 KB
testcase_47 AC 230 ms
55,656 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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) {}}
}
0