結果

問題 No.1087 転倒数の転倒数
ユーザー uwiuwi
提出日時 2020-06-19 22:24:26
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,625 bytes
コンパイル時間 3,713 ms
コンパイル使用メモリ 83,596 KB
実行使用メモリ 63,412 KB
最終ジャッジ日時 2023-09-16 14:42:25
合計ジャッジ時間 29,487 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
50,916 KB
testcase_01 AC 65 ms
50,984 KB
testcase_02 AC 65 ms
50,632 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 41 ms
49,236 KB
testcase_06 AC 42 ms
49,212 KB
testcase_07 AC 43 ms
51,208 KB
testcase_08 AC 42 ms
49,568 KB
testcase_09 AC 42 ms
49,188 KB
testcase_10 AC 42 ms
49,424 KB
testcase_11 AC 64 ms
50,732 KB
testcase_12 WA -
testcase_13 AC 65 ms
50,640 KB
testcase_14 AC 133 ms
53,388 KB
testcase_15 AC 64 ms
48,308 KB
testcase_16 AC 133 ms
53,296 KB
testcase_17 AC 437 ms
61,476 KB
testcase_18 AC 63 ms
50,572 KB
testcase_19 WA -
testcase_20 AC 135 ms
53,328 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 177 ms
55,848 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 387 ms
59,396 KB
testcase_30 AC 318 ms
57,224 KB
testcase_31 AC 423 ms
59,920 KB
testcase_32 AC 420 ms
59,564 KB
testcase_33 AC 378 ms
59,412 KB
testcase_34 WA -
testcase_35 AC 445 ms
61,412 KB
testcase_36 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class G {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int K = ni();
		if(K > n*(n-1)){
			out.println("No");
			return;
		}
		out.println("Yes");
		if(K <= n*(n-1)/2){
			int[] a = construct(n, K);
			
			int[][] as = new int[n][];
			for(int i = 0;i < n;i++){
				as[i] = construct(n, a[i]);
			}
			for(int i = 0;i < n;i++){
				for(int j = 0;j < n;j++){
					out.print(as[i][j] + n*i + " ");
				}
				out.println();
			}
		}else{
			int[] a = construct(n, K-n*(n-1)/2);
			
			int[][] as = new int[n][];
			for(int i = 0;i < n;i++){
				as[i] = construct(n, a[i]);
			}
			for(int i = 0;i < n;i++){
				for(int j = 0;j < n;j++){
					out.print(as[i][j] + n*(n-1-i) + " ");
				}
				out.println();
			}
		}
	}
	
	int[] construct(int n, int K)
	{
		int o = K;
		int[] a = new int[n];
		int[] ft = new int[n+3];
		for(int i = 0;i < n;i++)addFenwick(ft, i, 1);
		for(int i = 0;i < n;i++){
			int f = firstGEFenwick(ft, Math.min(K, n-1-i)+1);
			K -= Math.min(K, n-1-i);
			addFenwick(ft, f, -1);
			a[i] = f;
		}
		return a;
	}
	
	public static int sumFenwick(int[] ft, int i)
	{
		int sum = 0;
		for(i++;i > 0;i -= i&-i)sum += ft[i];
		return sum;
	}
	
	public static void addFenwick(int[] ft, int l, int r, int v)
	{
		addFenwick(ft, l, v);
		addFenwick(ft, r, -v);
	}
	
	public static void addFenwick(int[] ft, int i, int v)
	{
		if(v == 0 || i < 0)return;
		int n = ft.length;
		for(i++;i < n;i += i&-i)ft[i] += v;
	}
	
	public static int firstGEFenwick(int[] ft, int v)
	{
		int i = 0, n = ft.length;
		for(int b = Integer.highestOneBit(n);b != 0;b >>= 1){
			if((i|b) < n && ft[i|b] < v){
				i |= b;
				v -= ft[i];
			}
		}
		return i;
	}

	
	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 G().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