提出 #12752283
ソースコード 拡げる
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
""" 道は一本! """
N, M = map(int, readline().split())
H = [0] + list(map(int, readline().split()))
A = [0] * (N + 1)
m = map(int, read().split())
for a, b in zip(m, m):
for _ in range(2):
A[a] = max(A[a], H[b])
a, b = b, a
print(sum(x > y for x, y in zip(H, A)))
提出情報
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 300 / 300 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | Sample_01.txt, Sample_02.txt |
| All | Sample_01.txt, Sample_02.txt, maxrand_01.txt, maxrand_02.txt, maxrand_03.txt, ni_01.txt, ni_02.txt, rand_01.txt, rand_02.txt, rand_03.txt, same_01.txt, same_02.txt, same_03.txt, small_01.txt, small_02.txt, small_03.txt, uni_01.txt, uni_02.txt, uni_03.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| Sample_01.txt | AC | 17 ms | 9096 KiB |
| Sample_02.txt | AC | 18 ms | 8880 KiB |
| maxrand_01.txt | AC | 192 ms | 25548 KiB |
| maxrand_02.txt | AC | 192 ms | 25716 KiB |
| maxrand_03.txt | AC | 193 ms | 25544 KiB |
| ni_01.txt | AC | 17 ms | 9096 KiB |
| ni_02.txt | AC | 20 ms | 8876 KiB |
| rand_01.txt | AC | 196 ms | 25616 KiB |
| rand_02.txt | AC | 193 ms | 25604 KiB |
| rand_03.txt | AC | 195 ms | 25664 KiB |
| same_01.txt | AC | 179 ms | 24788 KiB |
| same_02.txt | AC | 185 ms | 24620 KiB |
| same_03.txt | AC | 185 ms | 24832 KiB |
| small_01.txt | AC | 18 ms | 9120 KiB |
| small_02.txt | AC | 19 ms | 9092 KiB |
| small_03.txt | AC | 22 ms | 9024 KiB |
| uni_01.txt | AC | 182 ms | 25728 KiB |
| uni_02.txt | AC | 181 ms | 25548 KiB |
| uni_03.txt | AC | 189 ms | 25480 KiB |