結果
問題 | No.1225 I hate I hate Matrix Construction |
ユーザー | tonnnura172 |
提出日時 | 2020-10-22 19:57:34 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,109 bytes |
コンパイル時間 | 513 ms |
コンパイル使用メモリ | 10,840 KB |
実行使用メモリ | 31,672 KB |
最終ジャッジ日時 | 2023-09-28 14:47:26 |
合計ジャッジ時間 | 9,750 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 134 ms
29,888 KB |
testcase_01 | AC | 133 ms
29,688 KB |
testcase_02 | AC | 132 ms
29,684 KB |
testcase_03 | WA | - |
testcase_04 | AC | 152 ms
29,876 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 140 ms
29,656 KB |
testcase_11 | AC | 153 ms
29,920 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 132 ms
30,528 KB |
testcase_16 | AC | 132 ms
30,384 KB |
testcase_17 | AC | 133 ms
30,572 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 132 ms
30,324 KB |
testcase_25 | AC | 134 ms
30,704 KB |
testcase_26 | AC | 130 ms
29,828 KB |
testcase_27 | AC | 131 ms
29,672 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 135 ms
31,060 KB |
testcase_35 | AC | 134 ms
31,096 KB |
testcase_36 | AC | 134 ms
30,016 KB |
ソースコード
import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd, log2 from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul, add from copy import deepcopy from string import ascii_lowercase, ascii_uppercase, digits from bisect import bisect, bisect_left from heapq import heappush, heappop from functools import reduce, lru_cache import numpy as np def input(): return sys.stdin.buffer.readline()[:-1] def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(): return list(map(int, input().split())) def ZIP(n): return zip(*(MAP() for _ in range(n))) sys.setrecursionlimit(10 ** 9) INF = float('inf') mod = 10 ** 9 + 7 N = INT() S = LIST() T = LIST() arr = np.zeros((N, N), dtype=np.int64) for i in range(N): if S[i] == 2: arr[i, :] = 1 for i in range(N): if T[i] == 2: arr[:, i] = 1 cnt = 0 for i in range(N): if S[i] == 1 and not any(arr[i, :]): cnt += 1 if T[i] == 1 and not any(arr[:, i]): cnt += 1 print(arr.sum()+(-(-cnt//2)))