結果

問題 No.942 プレゼント配り
ユーザー uwiuwi
提出日時 2019-12-05 00:15:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 236 ms / 2,000 ms
コード長 4,511 bytes
コンパイル時間 3,538 ms
コンパイル使用メモリ 87,432 KB
実行使用メモリ 47,156 KB
最終ジャッジ日時 2024-05-08 12:33:22
合計ジャッジ時間 7,425 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 62 ms
37,552 KB
testcase_01 AC 236 ms
44,408 KB
testcase_02 AC 46 ms
36,760 KB
testcase_03 AC 46 ms
36,988 KB
testcase_04 AC 232 ms
45,872 KB
testcase_05 AC 229 ms
45,348 KB
testcase_06 AC 46 ms
36,772 KB
testcase_07 AC 61 ms
37,860 KB
testcase_08 AC 220 ms
45,592 KB
testcase_09 AC 234 ms
44,912 KB
testcase_10 AC 50 ms
36,940 KB
testcase_11 AC 47 ms
36,980 KB
testcase_12 AC 48 ms
36,716 KB
testcase_13 AC 47 ms
37,024 KB
testcase_14 AC 231 ms
46,584 KB
testcase_15 AC 204 ms
46,000 KB
testcase_16 AC 216 ms
47,156 KB
testcase_17 AC 215 ms
47,024 KB
testcase_18 AC 61 ms
37,844 KB
testcase_19 AC 45 ms
36,896 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 AdvD5 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	public static void skip(int[] a, int id)
	{
		Arrays.sort(a, id+1, a.length);
		for(int i = id+1, j = a.length-1;i < j;i++,j--){
			int d = a[i]; a[i] = a[j]; a[j] = d;
		}
	}
	
	void solve()
	{
		int n = ni(), K = ni();
		
		if(K == 1) {
			out.println("Yes");
			for(int i = 1;i <= n;i++) {
				out.print(i + " ");
			}
			out.println();
			return;
		}
		if((long)n*(n+1)/2 % K != 0) {
			out.println("No");
			return;
		}
		if(n/K%2 == 0) {
			out.println("Yes");
			for(int i = 0;i < K;i++) {
				for(int j = 0;j < n/K;j++) {
					if(j % 2 == 0) {
						out.print(j*K+i+1 + " ");
					}else {
						out.print(j*K+K-1-i+1 + " ");
					}
				}
				out.println();
			}
			return;
		}
		int m = n/K;
		if(m == 1) {
			out.println("No");
			return;
		}
		
		// [[1, 8, 15, 2, 9, 13, 3, 10, 11, 4, 6, 14, 5, 7, 12]]
		out.println("Yes");
		for(int i = 0;i < K;i++) {
			out.print(0*K+1+i + " ");
			out.print(1*K+1+(i+K/2)%K + " ");
			out.print(3*K-(2*i%K) + " ");
			for(int j = 3;j < n/K;j++) {
				if(j % 2 == 1) {
					out.print(j*K+i+1 + " ");
				}else {
					out.print(j*K+K-1-i+1 + " ");
				}
			}
			out.println();
		}
		
	}
	
	public static boolean nextPermutation(int[] a) {
		int n = a.length;
		int i;
		for (i = n - 2; i >= 0 && a[i] >= a[i + 1]; i--)
			;
		if (i == -1)
			return false;
		int j;
		for (j = i + 1; j < n && a[i] < a[j]; j++)
			;
		int d = a[i];
		a[i] = a[j - 1];
		a[j - 1] = d;
		for (int p = i + 1, q = n - 1; p < q; p++, q--) {
			d = a[p];
			a[p] = a[q];
			a[q] = d;
		}
		return true;
	}

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