結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-07-20 01:31:49
言語 Java19
(openjdk 21)
結果
AC  
実行時間 1,132 ms / 4,000 ms
コード長 4,658 bytes
コンパイル時間 3,255 ms
コンパイル使用メモリ 80,396 KB
実行使用メモリ 76,436 KB
最終ジャッジ日時 2023-07-30 02:04:59
合計ジャッジ時間 29,245 ms
ジャッジサーバーID
(参考情報)
judge13 / judge5
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 830 ms
72,748 KB
testcase_01 AC 680 ms
71,716 KB
testcase_02 AC 346 ms
69,376 KB
testcase_03 AC 659 ms
70,472 KB
testcase_04 AC 642 ms
70,980 KB
testcase_05 AC 523 ms
71,044 KB
testcase_06 AC 1,132 ms
76,016 KB
testcase_07 AC 393 ms
71,360 KB
testcase_08 AC 621 ms
73,424 KB
testcase_09 AC 672 ms
70,244 KB
testcase_10 AC 585 ms
67,996 KB
testcase_11 AC 680 ms
68,348 KB
testcase_12 AC 570 ms
65,872 KB
testcase_13 AC 351 ms
66,296 KB
testcase_14 AC 434 ms
64,980 KB
testcase_15 AC 212 ms
62,624 KB
testcase_16 AC 694 ms
67,764 KB
testcase_17 AC 779 ms
72,560 KB
testcase_18 AC 761 ms
71,516 KB
testcase_19 AC 360 ms
66,160 KB
testcase_20 AC 372 ms
65,132 KB
testcase_21 AC 448 ms
68,512 KB
testcase_22 AC 642 ms
67,548 KB
testcase_23 AC 543 ms
67,916 KB
testcase_24 AC 353 ms
65,492 KB
testcase_25 AC 631 ms
67,580 KB
testcase_26 AC 431 ms
67,012 KB
testcase_27 AC 559 ms
67,884 KB
testcase_28 AC 334 ms
64,752 KB
testcase_29 AC 629 ms
68,396 KB
testcase_30 AC 60 ms
54,568 KB
testcase_31 AC 60 ms
54,724 KB
testcase_32 AC 651 ms
69,844 KB
testcase_33 AC 879 ms
76,436 KB
testcase_34 AC 636 ms
72,612 KB
testcase_35 AC 58 ms
54,720 KB
testcase_36 AC 59 ms
55,072 KB
testcase_37 AC 64 ms
54,760 KB
testcase_38 AC 67 ms
55,344 KB
testcase_39 AC 97 ms
56,500 KB
testcase_40 AC 97 ms
56,884 KB
testcase_41 AC 175 ms
57,444 KB
testcase_42 AC 172 ms
59,540 KB
testcase_43 AC 159 ms
59,024 KB
testcase_44 AC 167 ms
58,808 KB
testcase_45 AC 158 ms
58,456 KB
testcase_46 AC 297 ms
60,144 KB
testcase_47 AC 336 ms
61,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.SortedSet;
import java.util.TreeMap;
import java.util.TreeSet;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    int K = sc.nextInt();
    
    int[][][] table = new int[11][100001][];
    int[] ptr = new int[11];
    for (int i = 0; i < N; i ++) {
      int S = sc.nextInt();
      int P = sc.nextInt();
      int U = sc.nextInt();
      
      int[] d = new int[3];
      table[S][ptr[S]] = d;
      d[0] = P;
      d[1] = U;
      d[2] = i;
      ptr[S] ++;
    }

    for (int i = 0; i <= 10; i ++) {
      table[i] = Arrays.copyOf(table[i], ptr[i]);
    }
    

    int counter = 0;
    int[] uCount = new int[100001];
    for (int i = 10; i >= 0; i--) {

      Map<Integer, SortedSet<int[]>> subMap = new HashMap<>();

      TreeMap<Integer, SortedSet<int[]>> map = new TreeMap<>((a, b) ->  {
          if (uCount[a] == uCount[b]) {
            if (subMap.get(a).first()[0] == subMap.get(b).first()[0]) {
              return a - b;
            } else {
              return subMap.get(a).first()[0] - subMap.get(b).first()[0];
            }
          } else {
            return uCount[a] - uCount[b];
          }
      });
      
      for (int[] d : table[i]) {
        int U = d[1];
        if (!subMap.containsKey(U)) {
          subMap.put(U, new TreeSet<>((a, b) -> a[0] - b[0]));
        }
        subMap.get(U).add(d);
      }
      
      for (Map.Entry<Integer, SortedSet<int[]>> entry : subMap.entrySet()) {
        map.put(entry.getKey(), entry.getValue());
      }
      
      while (map.size() > 0) {
        SortedSet<int[]> set = map.firstEntry().getValue();
        map.remove(map.firstKey());
        int[] d = set.first();
        set.remove(d);
        
        System.out.println(d[2]);
        counter ++;
        uCount[d[1]] ++;
        
        if (counter == K) {
          return;
        }

        if (set.size() > 0) {
          map.put(d[1], set);
        }
      }
      
    }
    
  }

}


class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0