結果
問題 | No.942 プレゼント配り |
ユーザー | yakamoto |
提出日時 | 2019-12-19 18:13:25 |
言語 | Scala(Beta) (3.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,320 bytes |
コンパイル時間 | 12,181 ms |
コンパイル使用メモリ | 270,192 KB |
実行使用メモリ | 76,280 KB |
最終ジャッジ日時 | 2024-07-07 01:35:28 |
合計ジャッジ時間 | 27,750 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 879 ms
75,776 KB |
testcase_02 | AC | 748 ms
68,272 KB |
testcase_03 | AC | 714 ms
63,732 KB |
testcase_04 | AC | 890 ms
69,252 KB |
testcase_05 | AC | 902 ms
76,280 KB |
testcase_06 | AC | 740 ms
68,028 KB |
testcase_07 | AC | 728 ms
64,260 KB |
testcase_08 | AC | 914 ms
67,220 KB |
testcase_09 | AC | 917 ms
69,240 KB |
testcase_10 | AC | 710 ms
63,932 KB |
testcase_11 | AC | 715 ms
64,016 KB |
testcase_12 | AC | 733 ms
64,020 KB |
testcase_13 | AC | 719 ms
63,864 KB |
testcase_14 | AC | 944 ms
69,484 KB |
testcase_15 | AC | 913 ms
67,368 KB |
testcase_16 | AC | 903 ms
67,388 KB |
testcase_17 | AC | 899 ms
67,116 KB |
testcase_18 | AC | 720 ms
64,184 KB |
testcase_19 | AC | 720 ms
63,940 KB |
ソースコード
object Main { import java.io.{BufferedReader, InputStream, InputStreamReader} import java.util.StringTokenizer import scala.reflect.ClassTag def main(args: Array[String]): Unit = { val out = new java.io.PrintWriter(System.out) new Main(out, new InputReader(System.in)).solve() out.flush() } private[this] val oj = System.getenv("ATCODER_DEBUG") == null @inline private final def DEBUG(f: => Unit): Unit = { if (!oj){ f } } @inline private final def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) } @inline private final def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) } @inline private final def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) } @inline private final def debugDim(m: Array[Array[Long]]): Unit = if (!oj){ REP(m.length) { i => debug(m(i)) } } @inline private final def debugDimFlip(m: Array[Array[Long]]): Unit = if (!oj){ REP(m(0).length) { j => REP(m.length) { i => System.err.print(m(i)(j)) System.err.print(" ") } System.err.println() } } @inline private final def debug(s: => String): Unit = DEBUG { System.err.println(s) } @inline private final def debugL(num: => Long): Unit = DEBUG { System.err.println(num) } private def isDebug[A](debug: => A, online: => A): A = { if (oj) online else debug } class InputReader(val stream: InputStream) { private[this] val reader = new BufferedReader(new InputStreamReader(stream), 32768) private[this] var tokenizer: StringTokenizer = _ @inline private[this] final def next(): String = { while (tokenizer == null || !tokenizer.hasMoreTokens) tokenizer = new StringTokenizer(reader.readLine) tokenizer.nextToken } def nextInt(): Int = Integer.parseInt(next()) def nextLong(): Long = java.lang.Long.parseLong(next()) def nextChar(): Char = next().charAt(0) def ni(): Int = nextInt() def nl(): Long = nextLong() def nc(): Char = nextChar() def ns(): String = next() def ns(n: Int): Array[Char] = ns().toCharArray def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset) def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = { val A1, A2 = Array.ofDim[Int](n) REP(n) { i => A1(i) = ni() + offset A2(i) = ni() + offset } (A1, A2) } def nm(n: Int, m: Int): Array[Array[Int]] = { val A = Array.ofDim[Int](n, m) REP(n) { i => REP(m) { j => A(i)(j) = ni() } } A } def nal(n: Int): Array[Long] = map(n)(_ => nl()) def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m)) } def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = { var i = offset val N = n + offset while(i < N) { f(i); i += 1 } } def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = { var i = n - 1 + offset while(i >= offset) { f(i); i -= 1 } } def TO(from: Int, to: Int)(f: Int => Unit): Unit = { REP(to - from + 1, from)(f) } def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = { val res = Array.ofDim[A](n) REP(n)(i => res(i) = f(i + offset)) res } def sumL(as: Array[Int]): Long = { var s = 0L REP(as.length)(i => s += as(i)) s } def cumSum(as: Array[Int]): Array[Long] = { val cum = Array.ofDim[Long](as.length + 1) REP(as.length) { i => cum(i + 1) = cum(i) + as(i) } cum } } object Workspace { import Main._ } class Main(out: java.io.PrintWriter, sc: Main.InputReader) { import sc._ import Main._ import java.util.Arrays.sort import scala.collection.mutable import math.{abs, max, min} import mutable.ArrayBuffer import Workspace._ // toIntとか+7とかするならvalにしろ final private[this] val MOD = 1000000007 def solve(): Unit = { val N, K = ni() val sum = N.toLong * (N + 1) / 2 val check = N % K ==0 && sum % K == 0 && N != K val ans = Array.fill[ArrayBuffer[Int]](K)(ArrayBuffer()) if (!check) { out.println("No") } else { val G = N / K // 偶数なら簡単 if (G % 2 == 0) { REP(N) { i => val g = i / K val j = i % K if (g % 2 == 0) { ans(j) += i + 1 } else { ans(K - 1 - j) += i + 1 } } // 奇数の場合は最初の2Kで+1増加を作る } else { // 1,3,5 REP(K/2 + 1) { i => ans(i) += 2 * i + 1 } // 2,4 REP(K/2) { j => val i = K/2 + 1 + j ans(i) += 2 * (j+1) } // 8,7,6 REP(K/2 + 1) { j => ans(K/2 - j) += K + j + 1 } // 10,9 REP(K/2) { j => ans(K - 1 - j) += K + K/2 + 1 + j + 1 } REP(N - 2 * K, 2 * K) { i => val g = i / K val j = i % K if (g % 2 == 1) { ans(j) += i + 1 } else { ans(K - 1 - j) += i + 1 } } } // val S = ans.map(_.map(_.toLong).sum) // debug(S) out.println("Yes") REP(K) { k => out.println(ans(k).mkString(" ")) } } } }