Submission #72708199

Source Code Expand

import math

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

relation = [0]*N

for i in range(M):
    A_i, B_i = map(int,input().split())

    relation[A_i-1] += 1
    relation[B_i-1] += 1

ans = []

for i in range(N):
    diff = N - 1 - relation[i]

    if diff < 3:
        ans.append("0")
    else:
        ans.append(str(math.comb(diff,3)))

print(" ".join(ans))

Submission Info

Submission Time
Task C - Peer Review
User tobakaido
Language Python (PyPy 3.11-v7.3.20)
Score 300
Code Size 377 Byte
Status AC
Exec Time 283 ms
Memory 131504 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 25
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt
Case Name Status Exec Time Memory
sample00.txt AC 53 ms 79852 KiB
sample01.txt AC 52 ms 79512 KiB
sample02.txt AC 51 ms 79764 KiB
testcase00.txt AC 51 ms 79696 KiB
testcase01.txt AC 102 ms 129468 KiB
testcase02.txt AC 220 ms 124780 KiB
testcase03.txt AC 182 ms 119396 KiB
testcase04.txt AC 199 ms 113100 KiB
testcase05.txt AC 182 ms 119664 KiB
testcase06.txt AC 129 ms 131504 KiB
testcase07.txt AC 283 ms 130032 KiB
testcase08.txt AC 237 ms 109004 KiB
testcase09.txt AC 238 ms 108796 KiB
testcase10.txt AC 84 ms 108904 KiB
testcase11.txt AC 237 ms 109004 KiB
testcase12.txt AC 180 ms 119464 KiB
testcase13.txt AC 183 ms 119268 KiB
testcase14.txt AC 155 ms 108704 KiB
testcase15.txt AC 236 ms 108768 KiB
testcase16.txt AC 131 ms 108496 KiB
testcase17.txt AC 235 ms 108596 KiB
testcase18.txt AC 192 ms 108780 KiB
testcase19.txt AC 164 ms 108784 KiB
testcase20.txt AC 239 ms 108512 KiB
testcase21.txt AC 271 ms 129908 KiB