結果

問題 No.909 たぴの配置
ユーザー dot_haraaidot_haraai
提出日時 2021-04-04 20:23:56
言語 Nim
(2.0.2)
結果
AC  
実行時間 331 ms / 3,000 ms
コード長 788 bytes
コンパイル時間 6,118 ms
コンパイル使用メモリ 74,204 KB
実行使用メモリ 11,228 KB
最終ジャッジ日時 2023-08-27 22:01:06
合計ジャッジ時間 12,125 ms
ジャッジサーバーID
(参考情報)
judge15 / judge13
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 318 ms
10,660 KB
testcase_06 AC 331 ms
11,228 KB
testcase_07 AC 312 ms
10,588 KB
testcase_08 AC 317 ms
10,628 KB
testcase_09 AC 331 ms
11,224 KB
testcase_10 AC 309 ms
10,572 KB
testcase_11 AC 300 ms
10,500 KB
testcase_12 AC 315 ms
10,560 KB
testcase_13 AC 324 ms
11,064 KB
testcase_14 AC 302 ms
10,528 KB
testcase_15 AC 302 ms
10,508 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff #

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve()=
  var
    n = scan()
    x = newseqwith(n,scan())
    y = newseqwith(n,scan())
    dist = int.high.div(4)
  for i in 0..<n:
    dist.min=y[i]+x[i]
  echo dist
  echo 0
  for i in 0..<n:
    echo min(dist,x[i])
  echo dist
  
  
    
  
solve()
0