結果

問題 No.1292 パタパタ三角形
ユーザー dot_haraai
提出日時 2021-05-30 14:16:03
言語 Nim
(2.2.0)
結果
WA  
実行時間 -
コード長 1,809 bytes
コンパイル時間 6,459 ms
コンパイル使用メモリ 86,784 KB
実行使用メモリ 61,312 KB
最終ジャッジ日時 2024-11-08 20:48:22
合計ジャッジ時間 5,060 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 7 WA * 7
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(1, 25) Warning: imported and not used: 'sequtils' [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(2, 18) Warning: imported and not used: 'future' [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():int=
var
s = read()
a = (0,1)
b = (1,0)
c = (0,0)
fp = initHashSet[((int,int),(int,int),(int,int))]()
fp.incl((a,b,c))
for ch in s:
if ch == 'a':
if a[0] == c[0] and a[1] == c[1]+1:
a[1] = c[1]-1
elif a[0] == c[0] and a[1] == c[1]-1:
a[1] = c[1]+1
elif a[1] == c[1] and a[0] == c[0]+1:
a[0] = c[0]-1
elif a[1] == c[1] and a[0] == c[0]-1:
a[0] = c[0]+1
elif ch == 'b':
if b[0] == c[0] and b[1] == c[1]+1:
b[1] = c[1]-1
elif b[0] == c[0] and b[1] == c[1]-1:
b[1] = c[1]+1
elif b[1] == c[1] and b[0] == c[0]+1:
b[0] = c[0]-1
elif b[1] == c[1] and b[0] == c[0]-1:
b[0] = c[0]+1
elif ch == 'c':
if (a[0]+1==c[0] and b[1]+1==c[1]) or (b[0]+1==c[0] and a[1]+1==c[1]):
c[0]-=1
c[1]-=1
elif (a[1]-1==c[1] and b[0]-1==c[0]) or (b[1]-1==c[1] and a[0]-1==c[0]):
c[0]+=1
c[1]+=1
elif (a[1]+1==c[1] and b[0]-1==c[0]) or (b[1]+1==c[1] and a[0]-1==c[0]):
c[0]+=1
c[1]-=1
if (a[0]+1==c[0] and b[1]-1==c[1]) or (b[0]+1==c[0] and a[1]-1==c[1]):
c[0]-=1
c[1]+=1
#echo (a,b,c)
fp.incl((a,b,c))
return fp.len
echo solve()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0