結果
問題 | No.1694 ZerOne |
ユーザー | ophhdn |
提出日時 | 2021-10-01 22:18:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 488 ms / 2,000 ms |
コード長 | 1,506 bytes |
コンパイル時間 | 303 ms |
コンパイル使用メモリ | 87,008 KB |
実行使用メモリ | 102,788 KB |
最終ジャッジ日時 | 2023-09-26 17:50:56 |
合計ジャッジ時間 | 12,121 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 212 ms
80,952 KB |
testcase_01 | AC | 211 ms
81,360 KB |
testcase_02 | AC | 207 ms
81,224 KB |
testcase_03 | AC | 436 ms
90,836 KB |
testcase_04 | AC | 212 ms
81,204 KB |
testcase_05 | AC | 237 ms
83,696 KB |
testcase_06 | AC | 204 ms
80,920 KB |
testcase_07 | AC | 231 ms
83,448 KB |
testcase_08 | AC | 249 ms
83,676 KB |
testcase_09 | AC | 336 ms
91,048 KB |
testcase_10 | AC | 227 ms
83,464 KB |
testcase_11 | AC | 204 ms
80,880 KB |
testcase_12 | AC | 201 ms
81,216 KB |
testcase_13 | AC | 257 ms
85,336 KB |
testcase_14 | AC | 335 ms
91,164 KB |
testcase_15 | AC | 237 ms
83,652 KB |
testcase_16 | AC | 238 ms
83,484 KB |
testcase_17 | AC | 201 ms
81,272 KB |
testcase_18 | AC | 208 ms
81,176 KB |
testcase_19 | AC | 204 ms
81,240 KB |
testcase_20 | AC | 208 ms
81,052 KB |
testcase_21 | AC | 488 ms
102,700 KB |
testcase_22 | AC | 219 ms
82,692 KB |
testcase_23 | AC | 487 ms
102,788 KB |
testcase_24 | AC | 437 ms
95,948 KB |
testcase_25 | AC | 427 ms
95,796 KB |
testcase_26 | AC | 213 ms
83,060 KB |
testcase_27 | AC | 431 ms
100,288 KB |
testcase_28 | AC | 319 ms
88,092 KB |
testcase_29 | AC | 304 ms
87,892 KB |
testcase_30 | AC | 332 ms
90,560 KB |
testcase_31 | AC | 378 ms
93,572 KB |
testcase_32 | AC | 381 ms
93,452 KB |
testcase_33 | AC | 396 ms
96,976 KB |
ソースコード
from collections import defaultdict, deque, Counter from heapq import heappush, heappop, heapify from copy import deepcopy import bisect import random from itertools import permutations, accumulate, combinations, product import sys import string from bisect import bisect_left, bisect_right from math import factorial, ceil, floor from operator import mul from functools import reduce from pprint import pprint from copy import deepcopy from math import gcd, log2,atan2,atan,sin,cos,pi import functools import typing def LI(): return list(map(int, sys.stdin.readline().split())) def I(): return int(sys.stdin.readline()) def LS(): return sys.stdin.readline().split() def S(): return sys.stdin.readline().strip() def IR(n): return [I() for i in range(n)] def LIR(n): return [LI() for i in range(n)] def SR(n): return [S() for i in range(n)] def LSR(n): return [LS() for i in range(n)] def SRL(n): return [list(S()) for i in range(n)] def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)] mod=10**9+7 INF=10**30 s=S() n=len(s) idx_list=[] c=s.count("1") for d in range(n): if s[d]=="1": idx_list+=[d] dp=[[defaultdict(int) for _ in range(n)] for _ in range(c+1)] dp[0][0][0]=1 for i in range(c): idx=idx_list[i] for pre in range(n): dd=dp[i][pre] for j in range(pre+1 if i else 0,n): diff=idx-j for k,v in dd.items(): dp[i+1][j][k+diff]+=v ans=0 for f in range(n): ans+=dp[c][f][0] print(ans)