Submission #4649436


Source Code Expand

Copy
n, m = map(int,input().split())
if m == 0:
    print(1)
else:
    x = [list(map(int,input().split())) for i in range(m)]
    maxg = 0
    for i in range(2**n):
        group = [0]*(n+1)
        for j in range(n):
            if ((i >> j) & 1):
                group[j+1] = 1
        stack =[]
        for p in range(1, n+1):
            if (p != n) and group[p] == 1:
                for q in range(p+1, n+1):
                    if group[q] == 1:
                        stack.append([p, q])
        cnt = 0
        for t in stack:
            for f in x:
                if (t[0] in f) and (t[1] in f):
                    cnt += 1
                    break
        if len(stack) == cnt:
            if sum(group) > maxg:
                maxg = sum(group)
    print(maxg)

Submission Info

Submission Time
Task D - 派閥
User udonnokimi
Language Python3 (3.4.3)
Score 100
Code Size 799 Byte
Status
Exec Time 374 ms
Memory 3064 KB

Judge Result

Set Name Score / Max Score Test Cases
all 100 / 100 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt
Case Name Status Exec Time Memory
00_sample_01.txt 17 ms 3064 KB
00_sample_02.txt 17 ms 3064 KB
00_sample_03.txt 19 ms 3064 KB
00_sample_04.txt 17 ms 3064 KB
test_01.txt 17 ms 3064 KB
test_02.txt 17 ms 3064 KB
test_03.txt 17 ms 3064 KB
test_04.txt 17 ms 3064 KB
test_05.txt 17 ms 3064 KB
test_06.txt 18 ms 3064 KB
test_07.txt 18 ms 3064 KB
test_08.txt 22 ms 3064 KB
test_09.txt 33 ms 3064 KB
test_10.txt 68 ms 3064 KB
test_11.txt 71 ms 3064 KB
test_12.txt 352 ms 3064 KB
test_13.txt 17 ms 3064 KB
test_14.txt 17 ms 3064 KB
test_15.txt 22 ms 3064 KB
test_16.txt 35 ms 3064 KB
test_17.txt 61 ms 3064 KB
test_18.txt 98 ms 3064 KB
test_19.txt 305 ms 3064 KB
test_20.txt 316 ms 3064 KB
test_21.txt 33 ms 3064 KB
test_22.txt 146 ms 3064 KB
test_23.txt 139 ms 3064 KB
test_24.txt 303 ms 3064 KB
test_25.txt 17 ms 3064 KB
test_26.txt 282 ms 3064 KB
test_27.txt 48 ms 3064 KB
test_28.txt 17 ms 3064 KB
test_29.txt 23 ms 3064 KB
test_30.txt 56 ms 3064 KB
test_31.txt 326 ms 3064 KB
test_32.txt 135 ms 3064 KB
test_33.txt 305 ms 3064 KB
test_34.txt 62 ms 3064 KB
test_35.txt 316 ms 3064 KB
test_36.txt 307 ms 3064 KB
test_37.txt 150 ms 3064 KB
test_38.txt 355 ms 3064 KB
test_39.txt 305 ms 3064 KB
test_40.txt 193 ms 3064 KB
test_41.txt 342 ms 3064 KB
test_42.txt 319 ms 3064 KB
test_43.txt 206 ms 3064 KB
test_44.txt 316 ms 3064 KB
test_45.txt 330 ms 3064 KB
test_46.txt 334 ms 3064 KB
test_47.txt 308 ms 3064 KB
test_48.txt 319 ms 3064 KB
test_49.txt 238 ms 3064 KB
test_50.txt 213 ms 3064 KB
test_51.txt 256 ms 3064 KB
test_52.txt 264 ms 3064 KB
test_53.txt 277 ms 3064 KB
test_54.txt 345 ms 3064 KB
test_55.txt 305 ms 3064 KB
test_56.txt 274 ms 3064 KB
test_57.txt 333 ms 3064 KB
test_58.txt 302 ms 3064 KB
test_59.txt 327 ms 3064 KB
test_60.txt 323 ms 3064 KB
test_61.txt 345 ms 3064 KB
test_62.txt 17 ms 3064 KB
test_63.txt 287 ms 3064 KB
test_64.txt 335 ms 3064 KB
test_65.txt 374 ms 3064 KB
test_66.txt 284 ms 3064 KB
test_67.txt 256 ms 3064 KB
test_68.txt 260 ms 3064 KB
test_69.txt 242 ms 3064 KB
test_70.txt 272 ms 3064 KB