Problem p03166 (python)

Fixed submission:
from collections import deque


def main():
    N, M = map(int, input().split())
    xy = [list(map(int, input().split())) for _ in range(M)]

    G = [[] for _ in range(N)]
    ins = [0] * N
    for i in range(M):
        G[xy[i][0] - 1].append(xy[i][1] - 1)
        ins[xy[i][1] - 1] += 1

    DP = [0] * N
    queue = deque()
    for i in range(N):
        if ins[i] == 0:
            queue.append(i)

    while queue:
        v = queue.popleft()
        for i in G[v]:
            ins[i] -= 1
            if ins[i] == 0:
                DP[i] = max(DP[i], DP[v] + 1)
                queue.append(i)

    print(max(DP))


if __name__ == '__main__':
    main()

exit()

Buggy submission (verdict: Runtime Error):
def main():
    def DFS(v):
        if DP[v] == -1:
            res = 0
            for i in G[v]:
                res = max(res, DFS(i) + 1)

            DP[v] = res

        return DP[v]


    N, M = map(int, input().split())
    xy = [list(map(int, input().split())) for _ in range(M)]

    G = [[] for _ in range(N + 1)]
    for x, y in xy:
        G[x - 1].append(y - 1)

    DP = [-1] * (N + 1)
    for v in range(N):
        DFS(v)

    print(max(DP))


if __name__ == '__main__':
    main()

exit()

Buggy submission (verdict: Runtime Error):
def main():
    def DFS(v):
        if DP[v] == -1:
            res = 0
            for i in G[v]:
                res = max(res, DFS(i) + 1)

            DP[v] = res
            
        return DP[v]


    N, M = map(int, input().split())
    xy = [list(map(int, input().split())) for _ in range(M)]

    G = [[] for _ in range(N)]
    for x, y in xy:
        G[x - 1].append(y - 1)

    DP = [-1] * N
    for v in range(N):
        DFS(v)

    print(max(DP))


if __name__ == '__main__':
    main()

exit()

Buggy submission (verdict: Runtime Error):
def main():
    def DFS(v):
        if DP[v] != -1: return DP[v]

        res = 0
        for i in G[v]:
            res = max(res, DFS(i) + 1)

        DP[v] = res
        return res


    N, M = map(int, input().split())
    xy = [list(map(int, input().split())) for _ in range(M)]

    G = [[] for _ in range(N)]
    for x, y in xy:
        G[x - 1].append(y - 1)

    DP = [-1] * N
    for v in range(N):
        DFS(v)

    print(max(DP))


if __name__ == '__main__':
    main()

exit()

Buggy submission (verdict: Runtime Error):
def main():
    def DFS(v):
        if DP[v] != -1: return DP[v]

        res = 0
        for i in G[v]:
            res = max(res, DFS(i) + 1)

        DP[v] = res
        return res


    N, M = map(int, input().split())
    xy = [list(map(int, input().split())) for _ in range(M)]

    G = [[] for _ in range(N)]
    for i in range(M):
        G[xy[i][0] - 1].append(xy[i][1] - 1)

    DP = [-1] * N

    ans = 0
    for v in range(N):
        ans = max(ans, DFS(v))

    print(ans)


if __name__ == '__main__':
    main()

exit()

Buggy submission (verdict: Runtime Error):
def main():
    def DFS(v):
        if DP[v] != -1: return DP[v]

        res = 0
        for i in G[v]:
            res = max(res, DFS(i) + 1)

        DP[v] = res
        return res


    N, M = map(int, input().split())
    xy = [list(map(int, input().split())) for _ in range(M)]

    G = [[] for _ in range(N)]
    for i in range(M):
        G[xy[i][0] - 1].append(xy[i][1] - 1)

    DP = [-1] * N

    for v in range(N):
        DFS(v)

    print(max(DP))


if __name__ == '__main__':
    main()

exit()