結果
問題 |
No.451 575
|
ユーザー |
![]() |
提出日時 | 2016-12-02 06:12:41 |
言語 | Nim (2.2.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,670 bytes |
コンパイル時間 | 2,744 ms |
コンパイル使用メモリ | 67,068 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-29 20:48:38 |
合計ジャッジ時間 | 7,163 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 19 WA * 10 |
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 18) Warning: imported and not used: 'sequtils' [UnusedImport]
ソースコード
import strutils, sequtils, math var a = newSeq[int64](100010) proc f(i, n: int, b: seq[int64]): int64 = if i > n: return 0 if i mod 2 == 0: a[i] = a[i-1] - b[i-1] if a[i] <= 0 or 10^18 < a[i]: return abs(a[i]) return f(i+1, n, b) else: a[i] = b[i-1] - a[i-1] if a[i] <= 0 or 10^18 < a[i]: return abs(a[i]) return f(i+1, n, b) when isMainModule: var n = stdin.readLine.parseInt b = newSeq[int64](n) for i in 0..n-1: b[i] = stdin.readLine.parseBiggestInt if n == 1: if b[0] <= 1: echo "-1" else: echo 2 echo 1 echo b[0] - 1 quit() # var p = 1 # while p < b[0]: # a[0] = p # echo f(1, n, b) # p += 1 var l: int64 = -1 r: int64 = b[0] cnt: int = 0 pos: int64 = -1 while r - l > 10 and cnt < 1000: var x = (l + l + r) div 3 y = (l + r + r) div 3 a[0] = x let xf = f(1, n, b) a[0] = y let yf = f(1, n, b) if xf == 0: pos = x break if yf == 0: pos = y break if xf > yf: l = xf else: r = yf cnt += 1 if pos >= 0: for i in max(1, pos-100)..min(b[0]-1, pos+100): a[0] = i # echo f(1, n, b) if f(1, n, b) == 0: echo n+1 for i in 0..n: echo a[i] quit() for i in max(1, l-100)..min(b[0]-1, l+100): a[0] = i # echo f(1, n, b) if f(1, n, b) == 0: echo n+1 for i in 0..n: echo a[i] quit() for i in max(1, r-100)..min(b[0]-1, r+100): a[0] = i # echo f(1, n, b) if f(1, n, b) == 0: echo n+1 for i in 0..n: echo a[i] quit() echo "-1"