結果
問題 | No.22 括弧の対応 |
ユーザー | yakamoto |
提出日時 | 2019-01-05 22:05:52 |
言語 | Scala(Beta) (3.3.1) |
結果 |
AC
|
実行時間 | 977 ms / 5,000 ms |
コード長 | 2,728 bytes |
コンパイル時間 | 13,639 ms |
コンパイル使用メモリ | 265,324 KB |
実行使用メモリ | 62,588 KB |
最終ジャッジ日時 | 2023-09-27 13:35:06 |
合計ジャッジ時間 | 31,774 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 945 ms
62,284 KB |
testcase_01 | AC | 950 ms
61,924 KB |
testcase_02 | AC | 958 ms
62,008 KB |
testcase_03 | AC | 969 ms
62,128 KB |
testcase_04 | AC | 957 ms
61,928 KB |
testcase_05 | AC | 963 ms
62,076 KB |
testcase_06 | AC | 960 ms
62,040 KB |
testcase_07 | AC | 957 ms
62,120 KB |
testcase_08 | AC | 966 ms
62,088 KB |
testcase_09 | AC | 956 ms
62,148 KB |
testcase_10 | AC | 962 ms
62,052 KB |
testcase_11 | AC | 963 ms
62,156 KB |
testcase_12 | AC | 968 ms
62,588 KB |
testcase_13 | AC | 961 ms
62,144 KB |
testcase_14 | AC | 961 ms
62,080 KB |
testcase_15 | AC | 977 ms
62,288 KB |
testcase_16 | AC | 966 ms
62,220 KB |
testcase_17 | AC | 954 ms
62,108 KB |
testcase_18 | AC | 954 ms
62,148 KB |
ソースコード
object Main { def main(args: Array[String]): Unit = { val s = new Main() s.solve() s.out.flush() } } class Main { import java.io._ import java.util.StringTokenizer import scala.collection.mutable import scala.util.Sorting import math.{abs, max, min} import mutable.{ArrayBuffer, ListBuffer} import scala.reflect.ClassTag val MOD = 1000000007 val out = new PrintWriter(System.out) def solve(): Unit = { val N, K = ni() val S = ns(N) val stack = mutable.Stack[Int]() val pair = Array.ofDim[Int](N) REP(N) { i => if (S(i) == '(') { stack.push(i) } else { val open = stack.pop() pair(i) = open pair(open) = i } } out.println(pair(K - 1) + 1) } class InputReader(val stream: InputStream) { private val reader = new BufferedReader(new InputStreamReader(stream), 32768) private var tokenizer: StringTokenizer = _ def next(): String = { while (tokenizer == null || !tokenizer.hasMoreTokens) tokenizer = new StringTokenizer(reader.readLine) tokenizer.nextToken } def nextInt(): Int = next().toInt def nextLong(): Long = next().toLong def nextChar(): Char = next().charAt(0) } val sc = new InputReader(System.in) def ni(): Int = sc.nextInt() def nl(): Long = sc.nextLong() def nc(): Char = sc.nextChar() def ns(): String = sc.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 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]) = { val cum = Array.ofDim[Int](as.length + 1) REP(as.length) { i => cum(i + 1) = cum(i) + as(i) } cum } }