Submission #3813792


Source Code Expand

import strutils
import sequtils
import algorithm
import math
import queues
import tables
import sets
import future

const INF* = int(1e18 + 373)

proc readLine*(): string =
  stdin.readLine()
proc readSeq*(): seq[string] =
  readLine().strip().split()
proc readSeq*(n: Natural): seq[string] =
  result = newSeq[string](n)
  for i in 0..<n:
    result[i] = readLine().strip()
proc readInt1*(): int =
  readSeq().map(parseInt)[0]
proc readInt2*(): (int, int) =
  let a = readSeq().map(parseInt)
  return (a[0], a[1])
proc readInt3*(): (int, int, int) =
  let a = readSeq().map(parseInt)
  return (a[0], a[1], a[2])
proc readInt4*(): (int, int, int, int) =
  let a = readSeq().map(parseInt)
  return (a[0], a[1], a[2], a[3])
proc newSeqWith*[T](n: Natural; e: T): seq[T] =
  result = newSeq[T](n)
  for i in 0..<n:
    result[i] = e
type seq2*[T] = seq[seq[T]]
proc newSeq2*[T](n1, n2: Natural): seq2[T] =
  newSeqWith(n1, newSeq[T](n2))
type seq3*[T] = seq[seq[seq[T]]]
proc newSeq3*[T](n1, n2, n3: Natural): seq3[T] =
  newSeqWith(n1, newSeqWith(n2, newSeq[T](n3)))

#------------------------------------------------------------------------------#

proc main() =
  let (n, q) = readInt2()

  if n == 1:
    for _ in 0..<q:
      let (u, v) = readInt2()
      echo min(u, v)
    return

  for _ in 0..<q:
    var (u, v) = readInt2()

    while u != v:
      if u > v:
        swap(u, v)
      v = (v + n - 2) div n

    echo v

main()

Submission Info

Submission Time
Task B - Evergrowing Tree
User somq14
Language Nim (0.13.0)
Score 100
Code Size 1498 Byte
Status AC
Exec Time 330 ms
Memory 1404 KB

Compile Error

Hint: system [Processing]
Hint: Main [Processing]
Hint: strutils [Processing]
Hint: parseutils [Processing]
Hint: sequtils [Processing]
Hint: algorithm [Processing]
Hint: math [Processing]
Hint: times [Processing]
Hint: queues [Processing]
Hint: tables [Processing]
Hint: hashes [Processing]
Hint: etcpriv [Processing]
Hint: sets [Processing]
Hint: os [Processing]
Hint: posix [Processing]
Hint: future [Processing]
Hint: macros [Processing]
Hint:  [Link]
Hint: operation successful (24545 lines compiled; 2.155 sec total; 23.235MB; Release Build) [SuccessX]

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 20
Set Name Test Cases
Sample a01, a02
All a01, a02, b03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20
Case Name Status Exec Time Memory
a01 AC 1 ms 256 KB
a02 AC 1 ms 256 KB
b03 AC 1 ms 256 KB
b04 AC 237 ms 508 KB
b05 AC 241 ms 1276 KB
b06 AC 330 ms 508 KB
b07 AC 328 ms 508 KB
b08 AC 240 ms 1404 KB
b09 AC 322 ms 764 KB
b10 AC 303 ms 764 KB
b11 AC 282 ms 764 KB
b12 AC 270 ms 636 KB
b13 AC 264 ms 636 KB
b14 AC 248 ms 636 KB
b15 AC 246 ms 764 KB
b16 AC 243 ms 636 KB
b17 AC 242 ms 636 KB
b18 AC 239 ms 636 KB
b19 AC 241 ms 636 KB
b20 AC 239 ms 636 KB