結果

問題 No.2236 Lights Out On Simple Graph
ユーザー ShirotsumeShirotsume
提出日時 2023-03-03 22:44:17
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 5,701 bytes
コンパイル時間 479 ms
コンパイル使用メモリ 82,424 KB
実行使用メモリ 78,372 KB
最終ジャッジ日時 2024-09-17 23:47:46
合計ジャッジ時間 62,659 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,246 ms
77,368 KB
testcase_01 AC 42 ms
55,248 KB
testcase_02 AC 1,247 ms
77,588 KB
testcase_03 AC 72 ms
76,680 KB
testcase_04 AC 72 ms
76,504 KB
testcase_05 AC 48 ms
64,064 KB
testcase_06 AC 1,276 ms
77,600 KB
testcase_07 AC 1,275 ms
77,680 KB
testcase_08 AC 43 ms
55,392 KB
testcase_09 AC 1,247 ms
77,492 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 1,266 ms
77,784 KB
testcase_13 WA -
testcase_14 AC 1,266 ms
77,576 KB
testcase_15 AC 1,262 ms
77,572 KB
testcase_16 AC 1,264 ms
77,496 KB
testcase_17 WA -
testcase_18 AC 1,259 ms
77,356 KB
testcase_19 AC 1,263 ms
77,768 KB
testcase_20 AC 64 ms
73,728 KB
testcase_21 AC 70 ms
76,500 KB
testcase_22 AC 1,277 ms
77,808 KB
testcase_23 AC 1,275 ms
78,372 KB
testcase_24 WA -
testcase_25 AC 1,269 ms
77,480 KB
testcase_26 AC 1,274 ms
77,956 KB
testcase_27 AC 1,267 ms
77,820 KB
testcase_28 AC 1,277 ms
77,872 KB
testcase_29 AC 69 ms
76,208 KB
testcase_30 AC 1,276 ms
77,864 KB
testcase_31 AC 1,275 ms
77,556 KB
testcase_32 AC 1,274 ms
77,476 KB
testcase_33 AC 1,277 ms
78,244 KB
testcase_34 AC 1,277 ms
77,620 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 1,272 ms
77,772 KB
testcase_38 AC 1,261 ms
77,516 KB
testcase_39 WA -
testcase_40 AC 61 ms
72,968 KB
testcase_41 AC 58 ms
73,032 KB
testcase_42 AC 1,268 ms
77,876 KB
testcase_43 WA -
testcase_44 AC 1,265 ms
77,748 KB
testcase_45 AC 1,273 ms
77,640 KB
testcase_46 AC 71 ms
76,408 KB
testcase_47 AC 1,275 ms
77,584 KB
testcase_48 AC 74 ms
76,548 KB
testcase_49 AC 70 ms
76,668 KB
testcase_50 AC 1,258 ms
77,516 KB
testcase_51 AC 1,272 ms
77,572 KB
testcase_52 WA -
testcase_53 AC 55 ms
68,504 KB
testcase_54 AC 1,263 ms
77,720 KB
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 AC 1,261 ms
77,428 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 2
class matrix():
    r = 1
    c = 1
    A = None
    mod = 2
    def __init__(self, r, c, mod = 2):
        self.r = r
        self.c = c
        self.A = [[0] * self.c for _ in range(self.r)]
        if mod is not None:
            self.mod = mod
    
    def makeone(r = 1):
        A = matrix(r, r, mod)
        for i in range(r):
            A[i, i] = 1
        return A
    def __getitem__(self, key):
        rnow, cnow = key
        return self.A[rnow][cnow]
    
    def __setitem__(self, key, value):
        rnow, cnow = key
        self.A[rnow][cnow] = value
    
    def __add__(self, other):
        assert self.r == other.r and self.c == other.c
        ret = matrix(self.r, self.c)
        for i in range(self.r):
            for j in range(self.c):
                ret[i, j] = self[i, j] + other[i, j]
                ret[i, j] %= self.mod
        return ret

    def __sub__(self, other):
        
        assert self.r == other.r and self.c == other.c
        ret = matrix(self.r, self.c)
        for i in range(self.r):
            for j in range(self.c):
                ret[i, j] = self[i, j] - other[i, j]
                ret[i, j] %= self.mod
        return ret

    def __mul__(self, other):

        assert self.c == other.r
        ret = matrix(self.r, other.c)
        for i in range(self.r):
            for j in range(self.c):
                for k in range(other.c):
                    ret[i, k] += self[i, j] * other[j, k]
                    ret[i, k] %= self.mod
        return ret

    def augment(self, other):

        assert self.r == other.r

        X = matrix(self.r, self.c + other.c, mod = self.mod)

        for i in range(self.r):
            for j in range(self.c):
                X[i, j] = self[i, j]
            for j in range(other.c):
                X[i, j + self.c] = other[i, j]
        
        return X
    
    def diminish(self, c):

        X = []

        for i in range(self.r):
            X.append((self.A[i][:c]))
        
        return matrix(self.r, c, mod = self.mod, A = X)
        
    def hakidashi(self):
        for i in range(self.c):
            for j in range(i + 1, self.r):
                if self.A[j][i] != 0:
                    for k in range(self.c):
                        self.A[j][k], self.A[i][k] = self.A[i][k], self.A[j][k]
                    break

        for i in range(self.r):
            for j in range(self.c):
                if self[i, j] != 0:
                    break
            else:
                continue
            K = pow(self[i, j], self.mod - 2, self.mod)

            for to in range(self.c):
                self[i, to] *= K
                self[i, to] %= self.mod

            for i2 in range(self.r):
                if i == i2:
                    continue
                time = self[i2, j]
                for j2 in range(self.c):
                    self[i2, j2] -= time * self[i, j2]
                    self[i2, j2] %= self.mod

            

        return self




    def inv(self):
        assert self.c == self.r

        one = matrix.makeone(r = self.r)
        new = self.augment(one)
        new.hakidashi()
        for i in range(self.r):
            for j in range(self.c):
                if i == j:
                    if new[i, j] != 1:
                        return 0, new
                else:
                    if new[i, j] != 0:
                        return 0, new
        
        X = matrix(self.r, self.c)

        for i in range(self.r):
            for j in range(self.c):
                X[i, j] = new[i, j + self.c]

        return 1, X     




    def lineareq(self, b):
        assert self.r == b.r
        assert b.c == 1
        Y = self.augment(b)
        Y = Y.hakidashi()
        B = [[0] * self.c for _ in range(self.c)]
        ans = [0] * self.c

        flag = [0] * self.c
        for i in range(self.r):
            j = 0
            while j < self.c and Y[i, j] == 0:
                j += 1
            if j == self.c:
                if Y[i, -1] != 0:
                    return None, None
                continue
            flag[j] = 1
            ans[j] = Y[i, -1]
            for k in range(j + 1, self.c):
                if Y[i, k] % self.mod != 0:
                    B[k][j] = (-Y[i, k])% self.mod
                    flag[k] = -1
        for i in range(self.c):
            if  flag[i] != 1:
                B[i][i] = 1
        B=[B[i] for i in range(self.c) if flag[i] != 1]
        return ans,B

    def print(self):
        for v in self.A:
            print(*v)


import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2 ** 63 - 1
mod = 2

n, m = mi()

EDGE = [[v - 1 for v in li()] for _ in range(m)]
graph = [[] for _ in range(n)]
for u, v in EDGE:
    graph[u].append(v)
    graph[v].append(u)

c = li()

A = matrix(n, m)
B = matrix(n, 1)

for i, V in enumerate(EDGE):
    u, v = V
    A[u, i] = 1
    A[v, i] = 1

for i in range(n):
    if c[i] == 1:
        B[i, 0] = 1
X, Y = A.lineareq(B)

if X is None:
    print(-1)
    exit()

ans = X.count(1)
if Y:
    import random
    import time
    t1 = time.time()
    while time.time() - t1 < 1.2:
        p = random.randint(0, len(Y) - 1)
        for i in range(m):
            X[i] ^= Y[p][i]
        if ans > X.count(1):
            ans = min(ans, X.count(1))
        else:
            for i in range(m):
                X[i] ^= Y[p][i]




print(ans)
0