結果

問題 No.771 しおり
ユーザー dot_haraai
提出日時 2021-06-02 16:38:23
言語 Nim
(2.2.0)
結果
TLE  
実行時間 -
コード長 865 bytes
コンパイル時間 6,044 ms
コンパイル使用メモリ 86,456 KB
実行使用メモリ 16,448 KB
最終ジャッジ日時 2024-11-15 10:12:22
合計ジャッジ時間 75,522 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 20 TLE * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(2, 8) Warning: imported and not used: 'critbits' [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]

ソースコード

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 ugriness(ab:var seq[(int,int)]):int=
  result = 0
  for i in 0..<ab.len-1:
    result.max=(ab[i][1]-ab[i][0])+ab[i+1][0]
  return result


proc solve():int=
  var
    n = scan()
    ab = newseqwith(n,(scan(),scan()))
  ab.sort()
  result = ab.ugriness
  while ab.nextPermutation:
    result.min=ab.ugriness

  
  
  
echo solve()
0