結果

問題 No.1115 二つの数列 / Two Sequences
ユーザー dot_haraaidot_haraai
提出日時 2021-06-13 12:36:55
言語 Nim
(2.0.2)
結果
AC  
実行時間 41 ms / 2,000 ms
コード長 1,082 bytes
コンパイル時間 4,740 ms
コンパイル使用メモリ 73,932 KB
実行使用メモリ 8,180 KB
最終ジャッジ日時 2023-08-24 13:45:43
合計ジャッジ時間 10,095 ms
ジャッジサーバーID
(参考情報)
judge14 / judge13
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
4,384 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 35 ms
7,208 KB
testcase_04 AC 40 ms
7,992 KB
testcase_05 AC 35 ms
7,152 KB
testcase_06 AC 33 ms
7,000 KB
testcase_07 AC 41 ms
8,056 KB
testcase_08 AC 4 ms
4,376 KB
testcase_09 AC 24 ms
5,824 KB
testcase_10 AC 40 ms
8,036 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 41 ms
8,180 KB
testcase_13 AC 41 ms
8,032 KB
testcase_14 AC 41 ms
8,120 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 2 ms
4,380 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 2 ms
4,376 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 2 ms
4,380 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 2 ms
4,376 KB
testcase_23 AC 5 ms
4,380 KB
testcase_24 AC 16 ms
5,252 KB
testcase_25 AC 30 ms
6,920 KB
testcase_26 AC 8 ms
4,376 KB
testcase_27 AC 19 ms
5,284 KB
testcase_28 AC 25 ms
5,928 KB
testcase_29 AC 33 ms
6,980 KB
testcase_30 AC 40 ms
7,952 KB
testcase_31 AC 11 ms
4,380 KB
testcase_32 AC 8 ms
4,380 KB
testcase_33 AC 34 ms
7,192 KB
testcase_34 AC 2 ms
4,376 KB
testcase_35 AC 2 ms
4,380 KB
testcase_36 AC 1 ms
4,376 KB
testcase_37 AC 2 ms
4,380 KB
testcase_38 AC 1 ms
4,380 KB
testcase_39 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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