๐Ÿ—๏ธ Algorithm/๐ŸŸฉ ๋ฐฑ์ค€

[๋ฐฑ์ค€] [Python] Class2_10816๋ฒˆ_์ˆซ์ž ์นด๋“œ2

Dbswnstjd 2022. 10. 27. 19:06

๋ฌธ์ œ

https://www.acmicpc.net/problem/10816

 

10816๋ฒˆ: ์ˆซ์ž ์นด๋“œ 2

์ฒซ์งธ ์ค„์— ์ƒ๊ทผ์ด๊ฐ€ ๊ฐ€์ง€๊ณ  ์žˆ๋Š” ์ˆซ์ž ์นด๋“œ์˜ ๊ฐœ์ˆ˜ N(1 ≤ N ≤ 500,000)์ด ์ฃผ์–ด์ง„๋‹ค. ๋‘˜์งธ ์ค„์—๋Š” ์ˆซ์ž ์นด๋“œ์— ์ ํ˜€์žˆ๋Š” ์ •์ˆ˜๊ฐ€ ์ฃผ์–ด์ง„๋‹ค. ์ˆซ์ž ์นด๋“œ์— ์ ํ˜€์žˆ๋Š” ์ˆ˜๋Š” -10,000,000๋ณด๋‹ค ํฌ๊ฑฐ๋‚˜ ๊ฐ™๊ณ , 10,

www.acmicpc.net

ํ’€์ด

# ๋ฐฑ์ค€ 10816๋ฒˆ ๋ฌธ์ œ - ์ˆซ์ž ์นด๋“œ2
from collections import Counter
n = int(input())
card_n = list(map(int, input().split()))
m = int(input())
card_m = list(map(int, input().split()))

card_n = Counter(card_n)
for i in card_m:
    print(card_n[i], end=' ')