結果
問題 | No.945 YKC饅頭 |
ユーザー | yakamoto |
提出日時 | 2019-12-21 14:39:00 |
言語 | Scala(Beta) (3.4.0) |
結果 |
AC
|
実行時間 | 1,561 ms / 2,000 ms |
コード長 | 5,302 bytes |
コンパイル時間 | 15,666 ms |
コンパイル使用メモリ | 253,568 KB |
実行使用メモリ | 79,732 KB |
最終ジャッジ日時 | 2023-09-26 14:52:36 |
合計ジャッジ時間 | 103,251 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 895 ms
62,564 KB |
testcase_01 | AC | 896 ms
62,104 KB |
testcase_02 | AC | 906 ms
62,328 KB |
testcase_03 | AC | 919 ms
62,160 KB |
testcase_04 | AC | 896 ms
62,128 KB |
testcase_05 | AC | 925 ms
62,464 KB |
testcase_06 | AC | 925 ms
62,348 KB |
testcase_07 | AC | 926 ms
62,412 KB |
testcase_08 | AC | 899 ms
62,116 KB |
testcase_09 | AC | 930 ms
62,348 KB |
testcase_10 | AC | 935 ms
62,704 KB |
testcase_11 | AC | 932 ms
62,280 KB |
testcase_12 | AC | 927 ms
62,356 KB |
testcase_13 | AC | 925 ms
62,292 KB |
testcase_14 | AC | 932 ms
62,436 KB |
testcase_15 | AC | 922 ms
62,368 KB |
testcase_16 | AC | 960 ms
62,348 KB |
testcase_17 | AC | 1,009 ms
62,356 KB |
testcase_18 | AC | 926 ms
62,332 KB |
testcase_19 | AC | 906 ms
62,228 KB |
testcase_20 | AC | 911 ms
62,380 KB |
testcase_21 | AC | 922 ms
62,564 KB |
testcase_22 | AC | 922 ms
62,296 KB |
testcase_23 | AC | 931 ms
62,352 KB |
testcase_24 | AC | 936 ms
62,508 KB |
testcase_25 | AC | 920 ms
62,196 KB |
testcase_26 | AC | 941 ms
62,256 KB |
testcase_27 | AC | 897 ms
62,232 KB |
testcase_28 | AC | 903 ms
62,236 KB |
testcase_29 | AC | 896 ms
62,104 KB |
testcase_30 | AC | 900 ms
62,356 KB |
testcase_31 | AC | 1,180 ms
72,776 KB |
testcase_32 | AC | 966 ms
62,416 KB |
testcase_33 | AC | 1,149 ms
64,968 KB |
testcase_34 | AC | 1,213 ms
64,912 KB |
testcase_35 | AC | 1,264 ms
70,980 KB |
testcase_36 | AC | 1,223 ms
66,956 KB |
testcase_37 | AC | 1,203 ms
66,996 KB |
testcase_38 | AC | 1,195 ms
64,936 KB |
testcase_39 | AC | 1,137 ms
62,800 KB |
testcase_40 | AC | 1,148 ms
64,792 KB |
testcase_41 | AC | 1,086 ms
62,744 KB |
testcase_42 | AC | 1,552 ms
79,256 KB |
testcase_43 | AC | 1,177 ms
66,908 KB |
testcase_44 | AC | 1,218 ms
66,924 KB |
testcase_45 | AC | 1,278 ms
67,608 KB |
testcase_46 | AC | 951 ms
62,436 KB |
testcase_47 | AC | 1,186 ms
64,784 KB |
testcase_48 | AC | 1,115 ms
62,776 KB |
testcase_49 | AC | 1,146 ms
64,840 KB |
testcase_50 | AC | 1,263 ms
67,488 KB |
testcase_51 | AC | 1,284 ms
71,792 KB |
testcase_52 | AC | 1,293 ms
71,820 KB |
testcase_53 | AC | 1,315 ms
71,804 KB |
testcase_54 | AC | 1,285 ms
71,788 KB |
testcase_55 | AC | 1,298 ms
71,784 KB |
testcase_56 | AC | 938 ms
64,708 KB |
testcase_57 | AC | 936 ms
64,304 KB |
testcase_58 | AC | 1,488 ms
79,108 KB |
testcase_59 | AC | 1,237 ms
71,380 KB |
testcase_60 | AC | 1,178 ms
65,316 KB |
testcase_61 | AC | 1,214 ms
67,148 KB |
testcase_62 | AC | 1,194 ms
66,928 KB |
testcase_63 | AC | 992 ms
64,396 KB |
testcase_64 | AC | 1,180 ms
64,936 KB |
testcase_65 | AC | 1,175 ms
64,976 KB |
testcase_66 | AC | 1,154 ms
64,712 KB |
testcase_67 | AC | 1,191 ms
66,972 KB |
testcase_68 | AC | 1,184 ms
64,852 KB |
testcase_69 | AC | 1,139 ms
65,052 KB |
testcase_70 | AC | 1,212 ms
64,944 KB |
testcase_71 | AC | 1,125 ms
65,148 KB |
testcase_72 | AC | 1,194 ms
66,984 KB |
testcase_73 | AC | 1,561 ms
79,732 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("MY_DEBUG") == null def DEBUG(f: => Unit): Unit = { if (!oj){ f } } def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) } def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) } def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) } def debugDim(m: Array[Array[Int]]): Unit = if (!oj){ REP(m.length) { i => debug(m(i)) } } 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() } } def debug(s: => String): Unit = { if (!oj){ System.err.println(s) } } 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 = _ private[this] 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._ import java.util.Arrays.sort import scala.collection.mutable import math.{abs, max, min} import mutable.ArrayBuffer class RangeUpdateTree(n: Int, zero: Int)(f: (Int, Int) => Int) { private val N = { val a = Integer.highestOneBit(n) if (a == n) a else a << 1 } private val dat: Array[Int] = if (zero != 0){ Array.fill(2 * N)(zero) } else { Array.ofDim(2 * N) } /** * [l, r) */ def add(l: Int, r: Int, a: Int): Unit = { assert(l < n && r <= n) var left = l + N var right = r - 1 + N while(left <= right) { if ((left & 1) == 1) dat(left) = f(dat(left), a) if ((right & 1) == 0) dat(right) = f(dat(right), a) left = (left + 1) >> 1 // 右の子供なら右の親に移動 right = (right - 1) >> 1 // 左の子供なら左の親に移動 } } def query(i: Int): Int = { assert(i < n) var ix = N + i var res: Int = zero while(ix >= 1) { res = f(res, dat(ix)) ix >>= 1 } res } } def toTpe(c: Char) = c match { case 'Y' => 0 case 'K' => 1 case 'C' => 2 } case class Query(l: Int, r: Int, t: Int) } 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, M = ni() val inf = 1e9.toInt val t = new RangeUpdateTree(N, inf)(min) val Q = map(M) { _ => val l, r = ni() - 1 Query(l, r, toTpe(nc())) } REP(M) { i => t.add(Q(i).l, Q(i).r + 1, i) } val cnt = Array.ofDim[Int](3) REP(N) { i => val id = t.query(i) if (id != inf) cnt(Q(id).t) += 1 } out.println(cnt.mkString(" ")) } }