結果
| 問題 |
No.975 ミスターマックスバリュ
|
| ユーザー |
nadeshino
|
| 提出日時 | 2020-01-31 21:22:09 |
| 言語 | Nim (2.2.0) |
| 結果 |
AC
|
| 実行時間 | 12 ms / 2,000 ms |
| コード長 | 1,800 bytes |
| コンパイル時間 | 2,826 ms |
| コンパイル使用メモリ | 74,580 KB |
| 実行使用メモリ | 7,424 KB |
| 最終ジャッジ日時 | 2024-09-17 07:00:29 |
| 合計ジャッジ時間 | 3,304 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge6 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 9 |
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'algorithm' [UnusedImport] /home/judge/data/code/Main.nim(1, 19) Warning: imported and not used: 'complex' [UnusedImport] /home/judge/data/code/Main.nim(1, 58) Warning: imported and not used: 'strformat' [UnusedImport] /home/judge/data/code/Main.nim(1, 36) Warning: imported and not used: 'math' [UnusedImport] /home/judge/data/code/Main.nim(1, 79) Warning: imported and not used: 'sugar' [UnusedImport]
ソースコード
import algorithm, complex, macros, math, sequtils, sets, strformat, strutils, sugar, tables
macro unpack*(rhs: seq, cnt: static[int]): auto =
let v = genSym(); result = quote do:(let `v` = `rhs`;())
for i in 0 ..< cnt: result[1].add(quote do:`v`[`i`])
template input*(T: typedesc, cnt: Natural = 1): untyped =
let line = stdin.readLine.split(" ")
when T is int: line.map(parseInt).unpack(cnt)
elif T is float: line.map(parseFloat).unpack(cnt)
elif T is string: line.unpack(cnt)
elif T is char: line.mapIt(it[0]).unpack(cnt)
elif T is seq[int]: line.map(parseint)
elif T is seq[float]: line.map(parseFloat)
elif T is seq[string]: line
elif T is seq[char]: line.mapIt(it[0])
proc `|=`*(n: var int, m: int) = n = n or m
proc `|=`*(n: var bool, m: bool) = n = n or m
proc `&=`*(n: var int, m: int) = n = n and m
proc `&=`*(n: var bool, m: bool) = n = n and m
proc `^=`*(n: var int, m: int) = n = n xor m
proc `^=`*(n: var bool, m: bool) = n = n xor m
proc `%=`*(n: var int, m: int) = n = n mod m
proc `/=`*(n: var int, m: int) = n = n div m
proc `<<=`*(n: var int, m: int) = n = n shl m
proc `>>=`*(n: var int, m: int) = n = n shr m
proc `<?=`*(n: var SomeNumber, m: SomeNumber) = n = min(n, m)
proc `>?=`*(n: var SomeNumber, m: SomeNumber) = n = max(n, m)
proc newSeq2*[T](n1, n2: Natural): seq[seq[T]] = newSeqWith(n1, newSeq[T](n2))
proc newSeq3*[T](n1, n2, n3: Natural): seq[seq[seq[T]]] = newSeqWith(n1, newSeqWith(n2, newSeq[T](n3)))
# -------------------------------------------------- #
let (X, N, M) = input(int, 3)
let A, B = input(seq[int])
var f, g = false
if A.count(X) >= 1:
f = true
if B.count(X) >= 1:
g = true
if f:
if g:
echo "MrMaxValu"
else:
echo "MrMax"
else:
if g:
echo "MaxValu"
else:
echo "-1"
nadeshino