Submission #27132188
Source Code Expand
N = int(input())
lists = []
for i in range(N):
lst = input().split()
lst = list(map(int, lst))
lists.append(lst)
lists.sort()
ans = []
for i in range(N - 1):
if lists[i][0] != lists[i+1][0]:
ans.append(lists[i])
else:
b = False
for j in range(lists[i][0] + 1):
if lists[i][j] != lists[i+1][j]:
b = True
break
if b:
ans.append(lists[i])
print(len(ans) + 1)
Submission Info
| Submission Time | |
|---|---|
| Task | B - Counting Arrays |
| User | daira4000 |
| Language | Python (3.8.2) |
| Score | 200 |
| Code Size | 494 Byte |
| Status | AC |
| Exec Time | 911 ms |
| Memory | 41128 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_l_all_1_00.txt, 01_l_all_1_01.txt, 02_n_eq_1_00.txt, 03_a_all_max_00.txt, 04_random_a_small_00.txt, 04_random_a_small_01.txt, 05_random_00.txt, 05_random_01.txt, 05_random_02.txt, 06_sqrt_00.txt, 07_corner_00.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 17 ms | 9168 KiB |
| 00_sample_01.txt | AC | 23 ms | 8992 KiB |
| 00_sample_02.txt | AC | 20 ms | 9168 KiB |
| 01_l_all_1_00.txt | AC | 844 ms | 39616 KiB |
| 01_l_all_1_01.txt | AC | 911 ms | 41128 KiB |
| 02_n_eq_1_00.txt | AC | 67 ms | 30640 KiB |
| 03_a_all_max_00.txt | AC | 574 ms | 39020 KiB |
| 04_random_a_small_00.txt | AC | 381 ms | 21672 KiB |
| 04_random_a_small_01.txt | AC | 181 ms | 14468 KiB |
| 05_random_00.txt | AC | 459 ms | 28808 KiB |
| 05_random_01.txt | AC | 190 ms | 20876 KiB |
| 05_random_02.txt | AC | 78 ms | 17352 KiB |
| 06_sqrt_00.txt | AC | 110 ms | 16908 KiB |
| 07_corner_00.txt | AC | 19 ms | 9048 KiB |