結果

問題 No.326 あみだますたー
ユーザー dot_haraai
提出日時 2021-04-27 21:36:47
言語 Nim
(2.2.0)
結果
AC  
実行時間 5 ms / 2,000 ms
コード長 1,176 bytes
コンパイル時間 5,666 ms
コンパイル使用メモリ 87,924 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-06 16:32:23
合計ジャッジ時間 5,276 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 18) Warning: imported and not used: 'future' [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(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{.discardable.}=
  var
    n = scan()
    k = scan()
    p = newseq[int](n)
    a = newseq[int](n)
  for i in 0..<n:
    p[i] = i+1
  for i in 0..<k:
    var
      (l,r) = (scan()-1,scan()-1)
    (p[l],p[r]) = (p[r],p[l])
  for i in 0..<n:
    var t = scan()-1
    a[t] = i+1
  var ans = newseq[string]()
  #echo p
  #echo a
  
  
  
  for idx in 0..<n:
    var
      val = a[n-1-idx]
      pos = p.find(val)
    #echo val," ",pos
    for s in pos..<n-idx-1:
      ans.add(fmt"{s+1} {s+2}")
      (p[s],p[s+1]) = (p[s+1],p[s])
      #echo p
  #echo p
  #echo a
  echo ans.len
  echo ans.join("\n")


      

solve()
0