結果

問題 No.942 プレゼント配り
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-12-05 02:00:33
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,483 bytes
コンパイル時間 4,943 ms
コンパイル使用メモリ 89,764 KB
実行使用メモリ 58,664 KB
最終ジャッジ日時 2024-12-15 02:43:51
合計ジャッジ時間 8,008 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 230 ms
56,752 KB
testcase_02 AC 80 ms
51,328 KB
testcase_03 AC 80 ms
51,356 KB
testcase_04 AC 298 ms
58,492 KB
testcase_05 AC 281 ms
56,424 KB
testcase_06 AC 79 ms
51,216 KB
testcase_07 AC 94 ms
53,072 KB
testcase_08 AC 248 ms
58,612 KB
testcase_09 AC 248 ms
58,536 KB
testcase_10 AC 86 ms
51,056 KB
testcase_11 AC 79 ms
51,400 KB
testcase_12 AC 82 ms
51,276 KB
testcase_13 AC 80 ms
51,036 KB
testcase_14 AC 254 ms
57,076 KB
testcase_15 AC 268 ms
58,528 KB
testcase_16 AC 279 ms
58,132 KB
testcase_17 AC 229 ms
58,664 KB
testcase_18 AC 94 ms
52,960 KB
testcase_19 AC 80 ms
51,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

public class Main {

  private static void solve() {
    int n = ni();
    int k = ni();

    long sum = (long) n * (n + 1) / 2;

    if (sum % k != 0 || n == k) {
      System.out.println("No");
    } else if (n == 1) {
      System.out.println("Yes\n1");
    } else {
      int m = n / k;
      int[][] ret = new int[k][m];
      int v = 1;
      for (int i = 0; i < m - 1; i += 2) {
        for (int j = 0; j < k; j++) {
          ret[j][i] = v++;
        }
        for (int j = k - 1; j >= 0; j--) {
          ret[j][i + 1] = v++;
        }
      }

      if (m % 2 == 1) {
        v -= k;
        for (int j = k - 1; j >= 0; j -= 2) {
          ret[j][m - 2] = v++;
        }
        for (int j = k - 2; j >= 0; j -= 2) {
          ret[j][m - 2] = v++;
        }
        for (int j = k - 2; j >= 0; j -= 2) {
          ret[j][m - 1] = v++;
        }
        for (int j = k - 1; j >= 0; j -= 2) {
          ret[j][m - 1] = v++;
        }
      }

      out.println("Yes");
      for (int i = 0; i < k; i++) {
        for (int j = 0; j < m; j++) {
          out.print(ret[i][j] + " ");
        }
        out.println();
      }
    }

  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}

0