結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー threepipes_sthreepipes_s
提出日時 2016-10-28 19:31:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 709 ms / 4,000 ms
コード長 8,111 bytes
コンパイル時間 3,079 ms
コンパイル使用メモリ 92,880 KB
実行使用メモリ 61,852 KB
最終ジャッジ日時 2024-11-24 05:20:54
合計ジャッジ時間 23,754 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 681 ms
61,096 KB
testcase_01 AC 615 ms
59,440 KB
testcase_02 AC 472 ms
53,824 KB
testcase_03 AC 613 ms
55,316 KB
testcase_04 AC 533 ms
53,408 KB
testcase_05 AC 523 ms
57,784 KB
testcase_06 AC 709 ms
61,852 KB
testcase_07 AC 564 ms
58,860 KB
testcase_08 AC 521 ms
54,920 KB
testcase_09 AC 514 ms
50,784 KB
testcase_10 AC 471 ms
50,392 KB
testcase_11 AC 574 ms
55,116 KB
testcase_12 AC 546 ms
50,008 KB
testcase_13 AC 359 ms
49,636 KB
testcase_14 AC 424 ms
50,164 KB
testcase_15 AC 297 ms
49,680 KB
testcase_16 AC 482 ms
51,632 KB
testcase_17 AC 502 ms
50,896 KB
testcase_18 AC 587 ms
51,584 KB
testcase_19 AC 360 ms
49,576 KB
testcase_20 AC 396 ms
50,564 KB
testcase_21 AC 378 ms
49,744 KB
testcase_22 AC 514 ms
50,388 KB
testcase_23 AC 430 ms
50,276 KB
testcase_24 AC 372 ms
49,688 KB
testcase_25 AC 487 ms
50,088 KB
testcase_26 AC 395 ms
50,088 KB
testcase_27 AC 501 ms
51,692 KB
testcase_28 AC 359 ms
49,548 KB
testcase_29 AC 489 ms
50,608 KB
testcase_30 AC 57 ms
37,212 KB
testcase_31 AC 56 ms
37,364 KB
testcase_32 AC 517 ms
51,384 KB
testcase_33 AC 569 ms
52,108 KB
testcase_34 AC 497 ms
51,956 KB
testcase_35 AC 59 ms
37,264 KB
testcase_36 AC 58 ms
37,440 KB
testcase_37 AC 60 ms
37,224 KB
testcase_38 AC 60 ms
37,064 KB
testcase_39 AC 115 ms
39,152 KB
testcase_40 AC 105 ms
39,116 KB
testcase_41 AC 166 ms
45,248 KB
testcase_42 AC 168 ms
45,092 KB
testcase_43 AC 163 ms
45,184 KB
testcase_44 AC 166 ms
44,964 KB
testcase_45 AC 126 ms
39,316 KB
testcase_46 AC 218 ms
45,372 KB
testcase_47 AC 208 ms
45,484 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Random;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
	static ContestScanner in;static Writer out;static StringBuilder sb=new StringBuilder();
	public static void main(String[] args)
	{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();
	in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}
	static void dump(int[]a){sb.setLength(0);for(int i=0;i<a.length;i++)
	sb.append(a[i]).append("\t");out.println(sb.toString().trim());}
	static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
	static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
	static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
	static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
	static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
	static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
	static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
	static void m_sort(int[]a,int s,int sz,int[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
	while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
	} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
	static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
	static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
	static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
	static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
	static void m_sort(long[]a,int s,int sz,long[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
	while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
	static void swap(long[]a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
	static void swap(int[]a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
	static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
	{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	static int binarySearchSmallerMax(int[]a,int v,int l,int r)
	{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	List<Integer>[]randomTree(int n,Random r){List<Integer>[]g=graph(n);
	for(int i=1;i<n;i++){int p=r.nextInt(i);g[p].add(i);g[i].add(p);}return g;}
	@SuppressWarnings("unchecked")
	static List<Integer>[]graph(int n){List<Integer>[]g=new List[n];
	for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
	void solve() throws NumberFormatException, IOException{
		int n = in.nextInt();
		int k = in.nextInt();
		int[] map = new int[100001];
		Arrays.fill(map, -1);
		List<Univ> univ = new ArrayList<>();
		int idx = 0;
		int[] s = new int[n];
		int[] p = new int[n];
		int[] u = new int[n];
		for(int i=0; i<n; i++){
			s[i] = in.nextInt();
			p[i] = in.nextInt();
			u[i] = in.nextInt();
			Team t = new Team(s[i], p[i], i);
			if(map[u[i]]==-1){
				Univ un = new Univ(idx);
				univ.add(un);
				un.qu.add(t);
				map[u[i]] = idx++;
			}else{
				Univ un = univ.get(map[u[i]]);
				un.qu.add(t);
			}
		}
		PriorityQueue<Univ> uq = new PriorityQueue<>();
		uq.addAll(univ);
		for(int i=0; i<k; i++){
			Univ un = uq.poll();
			Team t = un.qu.poll();
			un.chosen++;
			if(!un.qu.isEmpty()) uq.add(un);
			out.println(t.id);
		}
	}
}

class Univ implements Comparable<Univ>{
	PriorityQueue<Team> qu = new PriorityQueue<Team>();
	int chosen, id;
	public Univ(int id) {
		this.id = id;
	}
	@Override
	public int compareTo(Univ o) {
		if(qu.isEmpty()) return 1;
		Team me = qu.peek();
		Team en = o.qu.peek();
		if(me.s!=en.s) return en.s-me.s;
		if(chosen!=o.chosen) return chosen-o.chosen;
		return me.p-en.p;
	}
}

class Team implements Comparable<Team>{
	int s, p, id;
	public Team(int s, int p, int id) {
		this.s = s;
		this.p = p;
		this.id = id;
	}
	@Override
	public int compareTo(Team o) {
		if(s!=o.s)return o.s-s;
		return p-o.p;
	}
}

@SuppressWarnings("serial")
class MultiSet<T> extends HashMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public MultiSet<T> merge(MultiSet<T> set)
	{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
@SuppressWarnings("serial")
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
	{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
	int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
	public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
	public int hashCode(){return hash;}
	public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
	@Override
	public String toString() {
		return String.format("(%d, %d)", a, b);
	}
}
class Timer{
	long time;public void set(){time=System.currentTimeMillis();}
	public long stop(){return time=System.currentTimeMillis()-time;}
	public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
	@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
	private BufferedReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws IOException
	{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public long nextLong()throws IOException,NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt()throws NumberFormatException,IOException
	{return(int)nextLong();}
	public double nextDouble()throws NumberFormatException,IOException 
	{return Double.parseDouble(nextToken());}
	public void close() throws IOException {in.close();}
}
0