結果

問題 No.762 PDCAパス
コンテスト
ユーザー dot_haraai
提出日時 2021-03-20 01:33:54
言語 Nim
(2.2.0)
結果
AC  
実行時間 78 ms / 2,000 ms
コード長 1,306 bytes
コンパイル時間 6,445 ms
コンパイル使用メモリ 88,808 KB
実行使用メモリ 9,472 KB
最終ジャッジ日時 2024-11-19 05:13:28
合計ジャッジ時間 9,431 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 38
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(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(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]
/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
    d = 10^9+7
    n = scan()
    m = scan()
    s = read()
    nxt = newseqwith(n,0)
    memo = newseqwith(n,-1)
    edges = newseqwith(n,newseq[int]())

  for i in 0..<m:
    var (u,v) = (scan()-1,scan()-1)
    edges[u].add(v)
    edges[v].add(u)

  proc search(st:int):int=
    if memo[st] != -1:
      return memo[st]
    else:
      for nxt in edges[st]:

        if s[st]=='P' and s[nxt]=='D':
          result+=search(nxt)
        elif s[st]=='D' and s[nxt]=='C':
          result+=search(nxt)
        elif s[st]=='C' and s[nxt]=='A':
          result+=1
      memo[st] = result.mod(d)
      return result
  #echo s
  for st in 0..<n:
    if s[st]=='P':
      result+=search(st)
      #echo st,",",search(st)
      result.mod=d

  
echo solve()
0