113차 2번 문제풀이

Author: hangyeol

live11/test113/문제2/백한결.py

@@ -1,25 +1,29 @@
 import sys
 from collections import defaultdict
 
-
 def main():
     input = sys.stdin.readline
     N = int(input())
 
-    graph = defaultdict(list)
+    graph = defaultdict(dict)
 
     for _ in range(N):
-        food = list(map(str, input().strip().split()))
+        food = input().strip().split()
         K = int(food[0])
         foods = food[1:]
 
         current_node = graph
-
         for f in foods:
             if f not in current_node:
-                current_node[f] = defaultdict(list)
+                current_node[f] = defaultdict(dict)
             current_node = current_node[f]
 
+    dfs(graph, 0)
+
+def dfs(node, depth):
+    for key in sorted(node.keys()):
+        print('--' * depth + key)
+        dfs(node[key], depth + 1)
 
 if __name__ == '__main__':
     main()