题目描述
输入描述:
输出描述:
示例1
输入 | 输出 |
| |
|
思路:
通过深度优先/广度优先 算法,获取图上v能到达的所有点集合Sv,然后循环遍历得到Tv;
代码:
from queue import Queue
n, m = [int(x) for x in input().split()]
from_v = [[] for _ in range(n)]
to_v = [[] for _ in range(n)]
vers = [[] for _ in range(n)]
ls=[]
for i in range(m):
line=[int(x) - 1 for x in input().split()]
if line not in ls and line[0]!=line[1]:
ls.append(line)
for item in ls:
vers[item[0]].append(item[1])
n_count = 0
def bfsvisit(k):
#提示运行超时:您的程序未能在规定时间内运行结束,请检查是否循环有错或算法复杂度过大。
visted = [0 for i in range(n)]
visted[k] = 1
visit_queue = Queue()
visit_queue.put(k)
while not visit_queue.empty() :
v=visit_queue.get()
for i in vers[v]:
if visted[i]==0:
visit_queue.put(i)
visted[i] = 1
return visted
def bfs(k):
#可以通过所有示例
visted = [0 for i in range(n)]
visted[k] = 1
visit_queue=[]
visit_queue.append(k)
while len(visit_queue)>0 :
v=visit_queue.pop(0)
for i in vers[v]:
if visted[i]==0:
visit_queue.append(i)
visted[i] = 1
return visted
for k in range(n):
visted = bfsvisit(k)
for i,v in enumerate(visted):
if v==1 and i!=k:
from_v[k].append(i)
for k in range(n):
for j in from_v[k]:
to_v[j].append(k)
n_count=0
for k in range(n):
if len(to_v[k])>len(from_v[k]):
n_count+=1
print(n_count)
问题点:使用队列,运行时间却比使用列表的运行时间长