結果
問題 | No.1382 Travel in Mitaru city |
ユーザー | dot_haraai |
提出日時 | 2021-06-13 20:31:15 |
言語 | Nim (2.0.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,403 bytes |
コンパイル時間 | 5,222 ms |
コンパイル使用メモリ | 74,900 KB |
実行使用メモリ | 19,500 KB |
最終ジャッジ日時 | 2023-08-24 23:39:04 |
合計ジャッジ時間 | 15,030 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | WA | - |
testcase_07 | AC | 49 ms
5,992 KB |
testcase_08 | WA | - |
testcase_09 | AC | 69 ms
6,968 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 153 ms
17,984 KB |
testcase_28 | AC | 154 ms
18,060 KB |
testcase_29 | AC | 154 ms
17,952 KB |
testcase_30 | AC | 155 ms
17,900 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 90 ms
15,004 KB |
testcase_37 | AC | 15 ms
4,984 KB |
testcase_38 | AC | 105 ms
16,668 KB |
testcase_39 | AC | 26 ms
6,168 KB |
testcase_40 | AC | 76 ms
13,104 KB |
testcase_41 | AC | 83 ms
13,924 KB |
testcase_42 | AC | 105 ms
14,860 KB |
testcase_43 | AC | 88 ms
14,360 KB |
testcase_44 | AC | 35 ms
6,648 KB |
testcase_45 | AC | 80 ms
13,684 KB |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | AC | 81 ms
12,696 KB |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | AC | 5 ms
4,376 KB |
testcase_62 | AC | 2 ms
4,380 KB |
testcase_63 | AC | 19 ms
4,380 KB |
testcase_64 | AC | 7 ms
4,380 KB |
testcase_65 | AC | 2 ms
4,380 KB |
testcase_66 | AC | 4 ms
4,380 KB |
testcase_67 | AC | 5 ms
4,380 KB |
testcase_68 | AC | 8 ms
4,380 KB |
testcase_69 | AC | 4 ms
4,380 KB |
testcase_70 | AC | 10 ms
4,376 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(2, 18) Warning: imported and not used: 'future' [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]
ソースコード
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()= var n = scan() m = scan() s = scan()-1 t = scan()-1 p = newseq[(int,int)]() popularity = newseqwith(n,0) es = newseqwith(n,newseq[int]()) rts = newseqwith(n,0) for i in 0..<n: var v = scan() p.add((v,i)) popularity[i]=v rts[i]=i p.sort(SortOrder.Descending) for i in 0..<m: var u = scan()-1 v = scan()-1 es[u].add(v) es[v].add(u) proc find(x:int):int= if rts[x]==x: return x else: rts[x]=find(rts[x]) return rts[x] proc unite(x,y:int)= var rtx = find(x) rty = find(y) if rtx!=rty: rts[rty]=rtx var point = popularity[s] y = 0 for (pv,v) in p: for nxt in es[v]: if popularity[nxt] >= pv: unite(nxt,v) if point > pv: y+=1 point = pv echo y solve()