Submission #39261710

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
from collections import defaultdict, deque
import sys
 
 
sys.setrecursionlimit(2 * 10 ** 6)
N, M = map(int, input().split())
edge = defaultdict(list)
larger = set()
for _ in range(M):
  X, Y = map(int, input().split())
  larger.add(Y)
  edge[X].append(Y)
route = []
def dfs(n):
  route.append(n)
  if len(route) == N:
    _, ans = zip(*sorted(zip(route, range(1, N + 1))))
    print("Yes")
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

from collections import defaultdict, deque
import sys
 
 
sys.setrecursionlimit(2 * 10 ** 6)

N, M = map(int, input().split())

edge = defaultdict(list)
larger = set()
for _ in range(M):
  X, Y = map(int, input().split())
  larger.add(Y)
  edge[X].append(Y)

route = []
def dfs(n):
  route.append(n)
  if len(route) == N:
    _, ans = zip(*sorted(zip(route, range(1, N + 1))))
    print("Yes")
    print(*ans)
    exit()
  for nxt in edge[n]:
    dfs(nxt)
  route.pop()

first = set(range(1, N + 1)) - larger
if len(first) > 1:
  print("No")
  exit()
  
dfs(first.pop())
print("No")

Submission Info

Judge Result