#947895 (PyPy3) No.1078 I love Matrix Construction

• 問題: No.1078 I love Matrix Construction
• ユーザー: rlangevin
• 提出日時: 2024-02-04 14:52:59
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 1,151 ms / 2,000 ms
• コード長: 4,205 bytes
• コンパイル時間: 208 ms
• コンパイル使用メモリ: 82,044 KB
• 実行使用メモリ: 230,156 KB
• 最終ジャッジ日時: 2024-09-28 11:17:38
• 合計ジャッジ時間: 14,249 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
class DirectedGraph():
    def __init__(self, N):
        self.N = N
        self.G = [[] for i in range(N)]
        self.rG = [[] for i in range(N)]
        self.order = []
        self.used1 = [0] * N
        self.used2 = [0] * N
        self.group = [-1] * N
        self.label = 0
        self.seen = [0] * N
        self.Edge = set()
    def add_edge(self, u, v):
        #多重辺は排除する
        if (u, v) not in self.Edge:
            self.G[u].append(v)
            self.rG[v].append(u)
            self.Edge.add((u, v))
    def dfs(self, s):
        stack = [~s, s]
        while stack:
            u = stack.pop()
            if u >= 0:
                if self.used1[u]:
                    continue
                self.used1[u] = 1
                for v in self.G[u]:
                    if self.used1[v]:
                        continue
                    stack.append(~v)
                    stack.append(v)
            else:
                u = ~u
                if self.seen[u]:
                    continue
                self.seen[u]= 1
                self.order.append(u)
    def rdfs(self, s, num):
        stack = [s]
        while stack:
            u = stack.pop()
            if u >= 0:
                self.used2[u] = 1
                self.group[u] = num
                for v in self.rG[u]:
                    if self.used2[v]:
                        continue
                    stack.append(v)
    def scc(self):
        for i in range(self.N):
            if self.used1[i]:
                continue
            self.dfs(i)
        for s in reversed(self.order):
            if self.used2[s]:
                continue
            self.rdfs(s, self.label)
            self.label += 1
        return self.label, self.group
    def construct(self):
        nG = [set() for _ in range(self.label)]
        mem = [[] for i in range(self.label)]
        for s in range(self.N):
            now = self.group[s]
            for u in self.G[s]:
                if now == self.group[u]:
                    continue
                nG[now].add(self.group[u])
            mem[now].append(s)
        return nG, mem
class TwoSAT():
    def __init__(self, N):
        self.N = N
        self.G = DirectedGraph(2 * N)
        
    def add(self, x1, x2, f1, f2):
        if f1 == True and f2 == True:
            # ￢x1∪￢x2
            # (x1⇒￢x2)∩(x2⇒￢x1)
            self.G.add_edge(x1, x2 + self.N)
            self.G.add_edge(x2, x1 + self.N)
            
        if f1 == True and f2 == False:
            # ￢x1∪x2
            # (x1⇒x2)∩(￢x2⇒￢x1)
            self.G.add_edge(x1, x2)
            self.G.add_edge(x2 + self.N, x1 + self.N)
        
        if f1 == False and f2 == True:
            # x1∪￢x2
            # (￢x1⇒￢x2)∩(x2⇒x1)
            self.G.add_edge(x1 + self.N, x2 + self.N)
            self.G.add_edge(x2, x1)
            
        if f1 == False and f2 == False:
            # x1∪x2
            # (￢x1⇒x2)∩(￢x2⇒x1)
            self.G.add_edge(x1 + self.N, x2)
            self.G.add_edge(x2 + self.N, x1)
            
    def check(self):
        _, group = self.G.scc()
        ans = []
        for i in range(self.N):
            if group[i] == group[i + self.N]:
                print("-1")
                exit()
            if group[i] > group[i + self.N]:
                ans.append(1)
            else:
                ans.append(0)
        return ans
    
    
N = int(input())
S = list(map(int, input().split()))
T = list(map(int, input().split()))
U = list(map(int, input().split()))
for i in range(N):
    S[i], T[i] = S[i] - 1, T[i] - 1
TS = TwoSAT(N*N)
for i in range(N):
    for j in range(N):
        if U[i] == 3:
            TS.add(S[i]*N+j, j*N+T[i], True, True)
        elif U[i] == 2:
            TS.add(S[i]*N+j, j*N+T[i], False, True)
        elif U[i] == 1:
            TS.add(S[i]*N+j, j*N+T[i], True, False)
        else:
            TS.add(S[i]*N+j, j*N+T[i], False, False)
            
flag = TS.check()
for i in range(N):
    ans = []
    for j in range(N):
        if flag[i*N+j]:
            ans.append(1)
        else:
            ans.append(0)
    print(*ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX