結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー tanzakutanzaku
提出日時 2016-10-14 22:56:12
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 7,958 bytes
コンパイル時間 4,580 ms
コンパイル使用メモリ 86,652 KB
実行使用メモリ 77,356 KB
最終ジャッジ日時 2024-11-22 08:31:33
合計ジャッジ時間 22,374 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 WA -
testcase_12 RE -
testcase_13 WA -
testcase_14 RE -
testcase_15 WA -
testcase_16 AC 501 ms
68,044 KB
testcase_17 RE -
testcase_18 RE -
testcase_19 WA -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 AC 500 ms
67,580 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 RE -
testcase_29 RE -
testcase_30 AC 60 ms
50,468 KB
testcase_31 AC 59 ms
50,272 KB
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 AC 58 ms
50,620 KB
testcase_36 AC 59 ms
50,324 KB
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 133 ms
53,080 KB
testcase_44 AC 141 ms
53,048 KB
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int N = io.nextInt();
			int K = io.nextInt();
			
			TreeMap<Integer, Integer> mp = new TreeMap<>();
			TreeMap<Integer, TreeSet<Team>> mp2 = new TreeMap<>();
			List<Integer> ut = new ArrayList<>();
			
			for (int i = 0; i < N; i++) {
				Team t = new Team();
				t.s = io.nextInt();
				t.p = io.nextInt();
				t.u = io.nextInt();
				t.i = i;
				if(!mp.containsKey(t.u)) {
					ut.add(t.u);
					mp.put(t.u, mp.size());
				}
				t.u = mp.get(t.u);
				TreeSet<Team> ts = mp2.get(t.u);
				if(ts == null) ts = new TreeSet<>();
				ts.add(t);
				mp2.put(t.u, ts);
			}
			
			long[] cnt = new long[ut.size()];
			Seg2 seg = new Seg2(ut.size());
			for(int i = 0; i < ut.size(); i++) {
//				dump(i + " " + mp2.get(i).first().val(0));
//				dump(i + " " + mp2.get(i).first().s + " " + mp2.get(i).first().s);
				seg.update(i, mp2.get(i).first().val(0));
			}
			
			for(int i = 0; i < K; i++) {
				int idx = seg.get(0, ut.size());
//				dump(i, idx);
				io.out.println(mp2.get(idx).pollFirst().i);
				cnt[idx]++;
				if(!mp2.get(idx).isEmpty()) {
//					dump(idx + " " + mp2.get(idx).first().val(cnt[idx]));
					seg.update(idx, mp2.get(idx).first().val(cnt[idx]));
				} else {
//					dump(idx + " " + -1);
					seg.update(idx, -1);
				}
			}
		}
	}
	
	static
	class Team implements Comparable<Team> {
		int s, p, u, i;
		
		long val(long c) {
			return (long)s<<58 | (200000-c)<<30 | ((1<<29)-p);
		}

		@Override
		public int compareTo(Team arg0) {
			// TODO Auto-generated method stub
			return -Long.compare(val(0), arg0.val(0));
		}
		
	}
	
	static
	class Seg2 {
		final int n;
		final int[] idx;
		final long[] seg;
		
		public Seg2(final int n) {
			this.n = Integer.highestOneBit(n) << 1;
			seg = new long[this.n << 1];
			idx = new int[this.n << 1];
		}
		
		int get(int l, int r) { return get(l, r, 0, 0, n); }
		int get(int l, int r, int k, int curL, int curR) {
			if(curR <= l || curL >= r) return -1;
			if(l <= curL && curR <= r) { return idx[k]; }
			final int curM = (curL + curR) / 2;
			int ll = get(l, r, 2 * k + 1, curL, curM);
			int rr = get(l, r, 2 * k + 2, curM, curR);
//			dump(l, r, k, curL, curR, ll, rr, n);
			if(ll == -1) return rr;
			if(rr == -1) return ll;
			return seg[ll] > seg[rr] ? ll : rr;
		}
		
		void update(int i, long v) {
			i += n - 1;
			seg[i] = v;
			idx[i] = i - (n - 1);
			while(i != 0) {
				i = (i - 1) / 2;
				seg[i] = Math.max(seg[2*i+1], seg[2*i+2]);
				idx[i] = (seg[2*i+1] > seg[2*i+2] ? idx[2*i+1] : idx[2*i+2]);
			}
		}
	}
	
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0