結果

問題 No.625 ソンタクロース
ユーザー uwiuwi
提出日時 2017-12-24 20:03:53
言語 Java21
(openjdk 21)
結果
AC  
実行時間 358 ms / 4,000 ms
コード長 4,007 bytes
コンパイル時間 3,786 ms
コンパイル使用メモリ 77,888 KB
実行使用メモリ 62,072 KB
最終ジャッジ日時 2023-08-22 18:06:05
合計ジャッジ時間 7,506 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
50,852 KB
testcase_01 AC 67 ms
50,644 KB
testcase_02 AC 69 ms
50,700 KB
testcase_03 AC 65 ms
50,584 KB
testcase_04 AC 67 ms
50,600 KB
testcase_05 AC 67 ms
50,764 KB
testcase_06 AC 69 ms
50,896 KB
testcase_07 AC 67 ms
50,692 KB
testcase_08 AC 67 ms
50,632 KB
testcase_09 AC 67 ms
50,908 KB
testcase_10 AC 67 ms
50,612 KB
testcase_11 AC 67 ms
50,916 KB
testcase_12 AC 65 ms
50,888 KB
testcase_13 AC 66 ms
50,732 KB
testcase_14 AC 67 ms
50,592 KB
testcase_15 AC 140 ms
56,700 KB
testcase_16 AC 90 ms
52,168 KB
testcase_17 AC 201 ms
57,280 KB
testcase_18 AC 358 ms
62,072 KB
testcase_19 AC 161 ms
56,824 KB
testcase_20 AC 150 ms
57,004 KB
testcase_21 AC 127 ms
56,664 KB
testcase_22 AC 281 ms
59,216 KB
testcase_23 AC 116 ms
54,776 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2017;
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 N625_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		if(!(1 <= n && n <= 1000))throw new AssertionError();
		if(!(1 <= m && m <= 20000))throw new AssertionError();
		
		int[][] dp = new int[n][n];
		dp[n-1][n-1] = m;
		for(int i = n-2;i >= 0;i--){
			int[][] prev = new int[n-1-i][];
			int p = 0;
			for(int j = n-1;j > i;j--){
				prev[p++] = new int[]{dp[i+1][j], j};
			}
			Arrays.sort(prev, 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]);
				}
			});
			// (1 + x) * 2 > n-i
			int need = (n-i)/2 + 1 - 1;
			int all = m;
			for(int j = 0;j < need;j++){
				dp[i][prev[j][1]] = Math.max(0, prev[j][0] + 1);
				all -= Math.max(0, prev[j][0] + 1);
			}
			dp[i][i] = all;
		}
		for(int j = 0;j < n;j++){
			if(dp[j][j] < 0)continue;
			for(int i = 0;i < n;i++){
				if(i < j){
					out.print(-1 + " ");
				}else{
					out.print(dp[j][i] + " ");
				}
			}
			break;
		}
		out.println();
	}
	
	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 N625_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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