結果
問題 | No.1225 I hate I hate Matrix Construction |
ユーザー | tonnnura172 |
提出日時 | 2020-10-22 20:05:06 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 160 ms / 2,000 ms |
コード長 | 1,139 bytes |
コンパイル時間 | 124 ms |
コンパイル使用メモリ | 10,976 KB |
実行使用メモリ | 31,468 KB |
最終ジャッジ日時 | 2023-09-28 14:49:00 |
合計ジャッジ時間 | 7,078 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 149 ms
29,920 KB |
testcase_01 | AC | 141 ms
29,984 KB |
testcase_02 | AC | 145 ms
29,884 KB |
testcase_03 | AC | 143 ms
29,944 KB |
testcase_04 | AC | 160 ms
29,648 KB |
testcase_05 | AC | 146 ms
29,684 KB |
testcase_06 | AC | 148 ms
29,844 KB |
testcase_07 | AC | 140 ms
29,836 KB |
testcase_08 | AC | 143 ms
29,828 KB |
testcase_09 | AC | 145 ms
29,668 KB |
testcase_10 | AC | 148 ms
29,704 KB |
testcase_11 | AC | 160 ms
29,848 KB |
testcase_12 | AC | 149 ms
29,696 KB |
testcase_13 | AC | 140 ms
29,624 KB |
testcase_14 | AC | 139 ms
29,672 KB |
testcase_15 | AC | 140 ms
30,348 KB |
testcase_16 | AC | 145 ms
30,304 KB |
testcase_17 | AC | 143 ms
30,784 KB |
testcase_18 | AC | 148 ms
31,468 KB |
testcase_19 | AC | 142 ms
30,284 KB |
testcase_20 | AC | 143 ms
29,980 KB |
testcase_21 | AC | 146 ms
30,252 KB |
testcase_22 | AC | 142 ms
30,252 KB |
testcase_23 | AC | 145 ms
30,092 KB |
testcase_24 | AC | 143 ms
30,272 KB |
testcase_25 | AC | 145 ms
30,780 KB |
testcase_26 | AC | 143 ms
29,960 KB |
testcase_27 | AC | 142 ms
29,932 KB |
testcase_28 | AC | 140 ms
30,684 KB |
testcase_29 | AC | 150 ms
30,048 KB |
testcase_30 | AC | 145 ms
29,880 KB |
testcase_31 | AC | 146 ms
30,968 KB |
testcase_32 | AC | 153 ms
30,120 KB |
testcase_33 | AC | 146 ms
30,220 KB |
testcase_34 | AC | 148 ms
31,080 KB |
testcase_35 | AC | 147 ms
30,984 KB |
testcase_36 | AC | 145 ms
30,204 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 tate = 0 yoko = 0 for i in range(N): if S[i] == 1 and not any(arr[i, :]): yoko += 1 if T[i] == 1 and not any(arr[:, i]): tate += 1 print(arr.sum()+min(yoko, tate)+abs(yoko-tate))