| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 209535 | model_code | Island (NOI18_island) | Cpython 2 | 928 ms | 14152 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
N, M = map(int, raw_input().split())
cnt = [0]*(N+M+1)
for i in range(N+M-1):
u, v = map(int, raw_input().split())
cnt[u] = cnt[u] + 1
cnt[v] = cnt[v] + 1
fac = [0]*(N+M+1)
for i in range(1, N+M+1):
fac[cnt[i]-1] += 1
for k in range(N+M, 1, -1):
if fac[k] > 0:
fac[k-1] += fac[k]
print ("%d %d" % (k, fac[k]))
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
