結果
問題 | No.1560 majority x majority |
ユーザー | ansain |
提出日時 | 2021-06-26 00:43:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 375 ms / 2,000 ms |
コード長 | 1,886 bytes |
コンパイル時間 | 259 ms |
コンパイル使用メモリ | 87,228 KB |
実行使用メモリ | 88,368 KB |
最終ジャッジ日時 | 2023-09-07 15:13:51 |
合計ジャッジ時間 | 9,668 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 375 ms
88,368 KB |
testcase_01 | AC | 367 ms
88,332 KB |
testcase_02 | AC | 205 ms
80,832 KB |
testcase_03 | AC | 305 ms
86,828 KB |
testcase_04 | AC | 247 ms
85,684 KB |
testcase_05 | AC | 346 ms
87,892 KB |
testcase_06 | AC | 251 ms
85,140 KB |
testcase_07 | AC | 227 ms
84,512 KB |
testcase_08 | AC | 291 ms
86,388 KB |
testcase_09 | AC | 259 ms
85,340 KB |
testcase_10 | AC | 219 ms
84,708 KB |
testcase_11 | AC | 235 ms
84,464 KB |
testcase_12 | AC | 224 ms
84,524 KB |
testcase_13 | AC | 232 ms
84,356 KB |
testcase_14 | AC | 224 ms
84,372 KB |
testcase_15 | AC | 256 ms
85,248 KB |
testcase_16 | AC | 228 ms
84,756 KB |
testcase_17 | AC | 293 ms
86,396 KB |
testcase_18 | AC | 250 ms
84,980 KB |
testcase_19 | AC | 222 ms
84,456 KB |
testcase_20 | AC | 224 ms
84,728 KB |
testcase_21 | AC | 228 ms
84,752 KB |
testcase_22 | AC | 263 ms
85,436 KB |
testcase_23 | AC | 217 ms
84,236 KB |
testcase_24 | AC | 221 ms
84,532 KB |
testcase_25 | AC | 261 ms
85,556 KB |
testcase_26 | AC | 210 ms
81,004 KB |
testcase_27 | AC | 203 ms
80,772 KB |
testcase_28 | AC | 201 ms
81,008 KB |
testcase_29 | AC | 204 ms
80,664 KB |
testcase_30 | AC | 216 ms
84,584 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial # from math import isqrt, prod,comb # python3.8用(notpypy) #from bisect import bisect_left,bisect_right #from functools import lru_cache,reduce #from heapq import heappush,heappop,heapify,heappushpop,heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 #from scipy.sparse import csr_matrix from decimal import Decimal #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError # numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) def popcnt1(n): return bin(n).count("1") def main(): mod = 10**9+7 mod2 = 998244353 n, m = map(int, input().split()) S = [list(map(int, input().split())) for i in range(n)] people = [0]*m for i in range(n): for j in range(m): people[j] += S[i][j] << i dp = [0]*2**m check = [0]*2**m check[0] = 2**n-1 pop=[0]*2**m pop[0]=n dp[0] = 1 for bit in range(1, 2**m): for i in range(m): if bit & (1 << i): if not check[bit]: check[bit]=check[bit & ~(1 << i)] & people[i] pop[bit]=popcnt1(check[bit]) if pop[bit]*2 >= pop[bit & ~(1 << i)]: dp[bit]+=dp[bit & ~(1 << i)] print(dp[-1]) if __name__ == '__main__': main()