結果

問題 No.1359 [Zelkova 3rd Tune] 四人セゾン
コンテスト
ユーザー dot_haraai
提出日時 2021-03-21 01:43:55
言語 Nim
(2.2.0)
結果
AC  
実行時間 648 ms / 2,000 ms
コード長 1,115 bytes
コンパイル時間 5,838 ms
コンパイル使用メモリ 86,528 KB
実行使用メモリ 23,424 KB
最終ジャッジ日時 2024-11-21 15:38:25
合計ジャッジ時間 40,979 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 75
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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 cPow(x,n,m:int):int=
  var
    n = n
    x = x
  result=1
  while n>0:
    if (n and 1)>0:
      result = (result*x).mod(m)
    x = (x*x).mod(m)
    n = n  shr 1

proc solve():int=
  var
    (n,k,m)=(scan(),scan(),scan())
    p = newseqwith(n,scan()).sorted()
    e = newseqwith(n,scan()).sorted()
    a = newseqwith(n,scan()).sorted()
    h = newseqwith(n,scan()).sorted()
  for i in 0..<n:
    var dif = max(@[p[i],e[i],a[i],h[i]])-min(@[p[i],e[i],a[i],h[i]])
    #echo dif,", ", k,", ",cPow(dif,k,m)
    result+=cPow(dif,k,m)
    result.mod=m
  
  
      

  

  
echo solve()
0