8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents c660607 + 9240756 commit 08c5f1eCopy full SHA for 08c5f1e
Programmers - 고득점 Kit/[그래프] 순위/kyuhyun.py
@@ -0,0 +1,24 @@
1
+def solution(n, results):
2
+ answer = 0
3
+ dict = {}
4
+
5
+ for i in range(1, n + 1):
6
+ dict[i] = {"win": set(), "lose": set()}
7
8
+ for winner, loser in results:
9
+ dict[winner]["lose"].add(loser)
10
+ dict[loser]["win"].add(winner)
11
12
+ for i in range(1, n+1):
13
+ # 나한테 진 사람의 명단을 나에게 이긴 사람의 "lose" 명단에 추가해줘야 함
14
+ for winner in dict[i]["win"]:
15
+ dict[winner]["lose"].update(dict[i]["lose"])
16
+ # 나한테 이긴 사람의 명단을 나에게 진 사람의 "win" 명단에 추가해줘야 함
17
+ for loser in dict[i]["lose"]:
18
+ dict[loser]["win"].update(dict[i]["win"])
19
20
21
+ if len(dict[i]["win"]) + len(dict[i]["lose"]) == n-1:
22
+ answer += 1
23
24
+ return answer
0 commit comments