結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー uwiuwi
提出日時 2016-10-14 22:43:16
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,495 bytes
コンパイル時間 4,518 ms
コンパイル使用メモリ 86,148 KB
実行使用メモリ 54,976 KB
最終ジャッジ日時 2024-05-01 23:35:37
合計ジャッジ時間 16,802 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 RE -
testcase_02 AC 310 ms
51,116 KB
testcase_03 RE -
testcase_04 RE -
testcase_05 WA -
testcase_06 RE -
testcase_07 AC 268 ms
51,836 KB
testcase_08 AC 292 ms
52,236 KB
testcase_09 RE -
testcase_10 AC 305 ms
52,328 KB
testcase_11 AC 312 ms
51,976 KB
testcase_12 WA -
testcase_13 AC 258 ms
51,608 KB
testcase_14 WA -
testcase_15 AC 234 ms
51,640 KB
testcase_16 AC 378 ms
54,152 KB
testcase_17 AC 324 ms
54,220 KB
testcase_18 AC 337 ms
54,976 KB
testcase_19 AC 263 ms
52,256 KB
testcase_20 WA -
testcase_21 AC 262 ms
51,340 KB
testcase_22 AC 310 ms
52,356 KB
testcase_23 AC 295 ms
52,304 KB
testcase_24 AC 255 ms
51,656 KB
testcase_25 AC 291 ms
53,156 KB
testcase_26 AC 256 ms
51,652 KB
testcase_27 AC 310 ms
52,024 KB
testcase_28 AC 297 ms
51,748 KB
testcase_29 AC 317 ms
51,748 KB
testcase_30 AC 63 ms
44,072 KB
testcase_31 AC 64 ms
43,520 KB
testcase_32 RE -
testcase_33 RE -
testcase_34 AC 284 ms
51,924 KB
testcase_35 AC 76 ms
44,064 KB
testcase_36 WA -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 WA -
testcase_42 AC 125 ms
45,960 KB
testcase_43 AC 135 ms
46,244 KB
testcase_44 AC 121 ms
46,296 KB
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest161014;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[][] ds = new int[n][];
		for(int i = 0;i < n;i++){
			ds[i] = new int[]{ni(), ni(), ni(), i};
		}
		Arrays.sort(ds, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				if(a[0] != b[0])return -(a[0] - b[0]);
				return a[1] - b[1];
			}
		});
		int sel = 0;
		int[] uc = new int[100001];
		for(int i = 0;i < n;){
			int j = i;
			while(j < n && ds[i][0] == ds[j][0])j++;
			if(sel + j-i <= K){
				for(int k = i;k < j;k++){
					uc[ds[k][2]]++;
					out.println(ds[k][3]);
					sel++;
				}
			}else{
				int[] ap = new int[100001];
				Arrays.fill(ap, 999999999);
				for(int k = i;k < j;k++){
					ap[ds[k][2]] = uc[ds[k][2]];
				}
				int[] h = new int[100001];
				int[] next = new int[n];
				Arrays.fill(next, -1);
				Arrays.fill(h, -1);
				for(int k = j-1;k >= i;k--){
					next[k] = h[ds[k][2]];
					h[ds[k][2]] = k;
				}
				
				int[] temp = new int[100001];
				int[] temp2 = new int[100001];
				SegmentTreeRMQPos st = new SegmentTreeRMQPos(ap);
				while(sel < K){
					int p = 0;
					int min = st.st[1];
					while(true){
						int lmin = st.st[1];
						if(lmin != min)break;
						temp[p] = st.pos[1];
						temp2[p] = h[st.pos[1]];
						h[st.pos[1]] = next[temp2[p]];
						p++;
						st.update(st.pos[1], min+1);
					}
					Arrays.sort(temp2, 0, p);
					for(int k = 0;k < p;k++){
						out.println(ds[temp2[k]][3]);
						if(++sel == K)break;
					}
				}
				break;
			}
			
			i = j;
		}
	}
	
	public static class SegmentTreeRMQPos {
		public int M, H, N;
		public int[] st;
		public int[] pos;
		
		public SegmentTreeRMQPos(int n)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			pos = new int[M];
			for(int i = 0;i < N;i++)pos[H+i] = i;
			Arrays.fill(st, 0, M, Integer.MAX_VALUE);
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		public SegmentTreeRMQPos(int[] a)
		{
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			pos = new int[M];
			for(int i = 0;i < N;i++){
				st[H+i] = a[i];
				pos[H+i] = i;
			}
			Arrays.fill(st, H+N, M, Integer.MAX_VALUE);
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		public void update(int pos, int x)
		{
			st[H+pos] = x;
			for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
		}
		
		private void propagate(int i)
		{
			if(st[2*i] <= st[2*i+1]){
				st[i] = st[2*i];
				pos[i] = pos[2*i];
			}else{
				st[i] = st[2*i+1];
				pos[i] = pos[2*i+1];
			}
		}
		
		public int minpos;
		public int minval;
		
		public int minx(int l, int r){
			if(l >= r)return 0;
			minval = Integer.MAX_VALUE;
			minpos = -1;
			while(l != 0){
				int f = l&-l;
				if(l+f > r)break;
				int v = st[(H+l)/f];
				if(v < minval){
					minval = v;
					minpos = pos[(H+l)/f];
				}
				l += f;
			}
			
			while(l < r){
				int f = r&-r;
				int v = st[(H+r)/f-1];
				if(v < minval){
					minval = v;
					minpos = pos[(H+r)/f-1];
				}
				r -= f;
			}
			return minval;
		}
		
		public int min(int l, int r){ 
			minpos = -1;
			minval = Integer.MAX_VALUE;
			min(l, r, 0, H, 1);
			return minval;
		}
		
		private void min(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				if(st[cur] < minval){
					minval = st[cur];
					minpos = pos[cur];
				}
			}else{
				int mid = cl+cr>>>1;
				if(cl < r && l < mid)min(l, r, cl, mid, 2*cur);
				if(mid < r && l < cr)min(l, r, mid, cr, 2*cur+1);
			}
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0