結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
コンテスト
ユーザー Grenache
提出日時 2016-10-14 23:02:35
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 5,077 bytes
コンパイル時間 4,081 ms
コンパイル使用メモリ 81,124 KB
実行使用メモリ 178,176 KB
最終ジャッジ日時 2024-11-22 09:24:32
合計ジャッジ時間 83,666 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 6 WA * 37 TLE * 5
権限があれば一括ダウンロードができます

ソースコード

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<Set<Integer>> univs = new ArrayList<>(100_000 + 1);
		for (int i = 0; i < 100_000 + 1; i++) {
			univs.add(new HashSet<>());
		}

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

		PriorityQueue<Team> pq = new PriorityQueue<>();
		for (int i = 0; i < n; i++) {
			int s = sc.nextInt();
			int p = sc.nextInt();
			int u = sc.nextInt();

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

		Set<Integer> update = new HashSet<>();
		while (n - pq.size() < k) {
			Team e = pq.remove();

			if (update.contains(e.no)) {
				update.remove(e.no);
				pq.add(e);
			} else {
				pr.println(e.no);
				pr.flush();

				univ[e.u]++;
				univs.get(e.u).remove(e.no);
				update.addAll(univs.get(e.u));
			}
		}
	}

	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