結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー GrenacheGrenache
提出日時 2016-10-14 23:19:30
言語 Java21
(openjdk 21)
結果
AC  
実行時間 543 ms / 4,000 ms
コード長 5,076 bytes
コンパイル時間 3,837 ms
コンパイル使用メモリ 76,980 KB
実行使用メモリ 60,264 KB
最終ジャッジ日時 2023-08-14 12:53:43
合計ジャッジ時間 21,935 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 498 ms
59,804 KB
testcase_01 AC 466 ms
59,544 KB
testcase_02 AC 384 ms
58,452 KB
testcase_03 AC 441 ms
60,048 KB
testcase_04 AC 455 ms
57,896 KB
testcase_05 AC 422 ms
58,420 KB
testcase_06 AC 543 ms
59,224 KB
testcase_07 AC 411 ms
58,140 KB
testcase_08 AC 374 ms
58,524 KB
testcase_09 AC 413 ms
57,960 KB
testcase_10 AC 393 ms
58,328 KB
testcase_11 AC 418 ms
58,736 KB
testcase_12 AC 406 ms
58,752 KB
testcase_13 AC 330 ms
57,604 KB
testcase_14 AC 358 ms
58,072 KB
testcase_15 AC 269 ms
57,500 KB
testcase_16 AC 438 ms
59,612 KB
testcase_17 AC 434 ms
59,140 KB
testcase_18 AC 432 ms
59,168 KB
testcase_19 AC 303 ms
56,596 KB
testcase_20 AC 375 ms
58,116 KB
testcase_21 AC 353 ms
57,604 KB
testcase_22 AC 415 ms
58,764 KB
testcase_23 AC 374 ms
57,976 KB
testcase_24 AC 304 ms
56,352 KB
testcase_25 AC 407 ms
58,176 KB
testcase_26 AC 362 ms
57,592 KB
testcase_27 AC 394 ms
58,172 KB
testcase_28 AC 301 ms
56,660 KB
testcase_29 AC 392 ms
58,596 KB
testcase_30 AC 79 ms
46,568 KB
testcase_31 AC 79 ms
46,788 KB
testcase_32 AC 443 ms
58,960 KB
testcase_33 AC 473 ms
60,264 KB
testcase_34 AC 369 ms
57,832 KB
testcase_35 AC 80 ms
46,744 KB
testcase_36 AC 79 ms
46,744 KB
testcase_37 AC 86 ms
46,664 KB
testcase_38 AC 85 ms
46,828 KB
testcase_39 AC 108 ms
47,000 KB
testcase_40 AC 111 ms
47,360 KB
testcase_41 AC 141 ms
50,172 KB
testcase_42 AC 144 ms
49,704 KB
testcase_43 AC 137 ms
48,420 KB
testcase_44 AC 143 ms
50,196 KB
testcase_45 AC 112 ms
46,984 KB
testcase_46 AC 186 ms
53,480 KB
testcase_47 AC 185 ms
53,476 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.util.*;


public class Main_yukicoder433 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		univ = new int[100_000 + 1];
		List<PriorityQueue<Team>> univs = new ArrayList<>(100_000 + 1);
		for (int i = 0; i < 100_000 + 1; i++) {
			univs.add(new PriorityQueue<>());
		}

		int n = sc.nextInt();
		int k = sc.nextInt();

		for (int i = 0; i < n; i++) {
			int s = sc.nextInt();
			int p = sc.nextInt();
			int u = sc.nextInt();

			univs.get(u).add(new Team(i, s, p, u));
		}

		PriorityQueue<Team> pq = new PriorityQueue<>();
		for (PriorityQueue<Team> e : univs) {
			if (e.size() > 0) {
				pq.add(e.remove());
			}
		}

		int cnt = 0;
		while (cnt < k) {
			Team e = pq.remove();

			pr.println(e.no);

			univ[e.u]++;
			PriorityQueue<Team> ptmp = univs.get(e.u);
			if (ptmp.size() > 0) {
				pq.add(ptmp.remove());
			}
			cnt++;
		}
	}

	private static int[] univ;

	private static class Team implements Comparable<Team> {
		int no;
		int s;
		int p;
		int u;

		Team(int no, int s, int p, int u) {
			this.no = no;
			this.s = s;
			this.p = p;
			this.u = u;
		}

		@Override
		public int compareTo(Team o) {
			if (s != o.s) {
				return -Integer.compare(s, o.s);
			}
			if (univ[u] != univ[o.u]) {
				return Integer.compare(univ[u], univ[o.u]);
			}
			return Integer.compare(p, o.p);
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0