結果

問題 No.1115 二つの数列 / Two Sequences
コンテスト
ユーザー dot_haraai
提出日時 2021-06-13 12:36:55
言語 Nim
(2.2.0)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 1,082 bytes
コンパイル時間 5,101 ms
コンパイル使用メモリ 86,400 KB
実行使用メモリ 7,552 KB
最終ジャッジ日時 2024-12-22 21:04:46
合計ジャッジ時間 7,572 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 35
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [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]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
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
    n = scan()
    a = newseqwith(n,scan()-1)
    b = newseqwith(n,scan()-1)
    d = newseqwith(n,0)

  var bittree = newseqwith(n+1,0)

  proc add(a,w:int)=
    var x = a
    while x<=n:
      bittree[x]+=w
      x += x and (-x)

  proc sum(a:int):int=
    var x = a
    while x>0:
      result+=bittree[x]
      x -= x and (-x)

  for i,v in b:
    d[v]=i
  for i,v in a:
    b[d[v]]=i
    a[i]=i
  #echo a
  #echo b
  for i,v in b:
    #echo bittree,sum(v)
    result+=i-sum(v)
    add(v+1,1)
  
echo solve()
0