Submission #826238

#	Time	Username	Problem	Language	Result	Execution time	Memory
826238		beaconmc	Railway (BOI17_railway)	Pypy 3	0 / 100	366 ms	42724 KiB

railway

n,m,k = map(int, input().split())

d = dict()

num = dict()

for i in range(n-1):
    a,b = map(int, input().split())
    num[a,b] = i+1
    d[a,b] = 0

for i in range(m):
    lis = list(map(int, input().split()))
    if (lis[1],lis[2]) in d:
        d[lis[1],lis[2]] += 1
    elif (lis[2],lis[1]) in d:
        d[lis[2],lis[1]] += 1
ans = []
for i in d:
    if d[i] >= k:
        ans.append(num[i])
print(len(ans))
print(*ans)

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 7
• Subtask 4: 0 / 29
• Subtask 5: 0 / 16
• Subtask 6: 0 / 25