結果
問題 | No.437 cwwゲーム |
ユーザー | McGregorsh |
提出日時 | 2022-06-23 21:05:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 207 ms / 2,000 ms |
コード長 | 2,139 bytes |
コンパイル時間 | 351 ms |
コンパイル使用メモリ | 82,192 KB |
実行使用メモリ | 90,368 KB |
最終ジャッジ日時 | 2024-04-25 04:27:22 |
合計ジャッジ時間 | 8,576 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 139 ms
83,568 KB |
testcase_01 | AC | 148 ms
83,584 KB |
testcase_02 | AC | 170 ms
89,600 KB |
testcase_03 | AC | 144 ms
83,584 KB |
testcase_04 | AC | 134 ms
83,404 KB |
testcase_05 | AC | 168 ms
89,728 KB |
testcase_06 | AC | 172 ms
89,916 KB |
testcase_07 | AC | 205 ms
90,240 KB |
testcase_08 | AC | 183 ms
89,920 KB |
testcase_09 | AC | 204 ms
90,112 KB |
testcase_10 | AC | 194 ms
89,984 KB |
testcase_11 | AC | 139 ms
83,584 KB |
testcase_12 | AC | 149 ms
89,728 KB |
testcase_13 | AC | 172 ms
89,856 KB |
testcase_14 | AC | 156 ms
89,472 KB |
testcase_15 | AC | 207 ms
90,368 KB |
testcase_16 | AC | 145 ms
89,600 KB |
testcase_17 | AC | 163 ms
89,216 KB |
testcase_18 | AC | 151 ms
89,644 KB |
testcase_19 | AC | 142 ms
83,584 KB |
testcase_20 | AC | 126 ms
83,584 KB |
testcase_21 | AC | 141 ms
83,200 KB |
testcase_22 | AC | 123 ms
83,328 KB |
testcase_23 | AC | 140 ms
83,712 KB |
testcase_24 | AC | 126 ms
83,704 KB |
testcase_25 | AC | 162 ms
89,216 KB |
testcase_26 | AC | 150 ms
89,728 KB |
testcase_27 | AC | 138 ms
83,328 KB |
testcase_28 | AC | 127 ms
83,456 KB |
testcase_29 | AC | 139 ms
83,456 KB |
testcase_30 | AC | 125 ms
83,392 KB |
testcase_31 | AC | 139 ms
83,840 KB |
testcase_32 | AC | 124 ms
83,676 KB |
testcase_33 | AC | 161 ms
89,088 KB |
testcase_34 | AC | 125 ms
83,200 KB |
testcase_35 | AC | 141 ms
83,456 KB |
testcase_36 | AC | 126 ms
83,328 KB |
testcase_37 | AC | 137 ms
83,584 KB |
testcase_38 | AC | 127 ms
83,504 KB |
testcase_39 | AC | 139 ms
83,456 KB |
testcase_40 | AC | 124 ms
83,484 KB |
testcase_41 | AC | 162 ms
90,112 KB |
testcase_42 | AC | 143 ms
89,600 KB |
testcase_43 | AC | 160 ms
89,344 KB |
ソースコード
import sys, re from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n = list(input()) juge = [True] * len(n) def dfs(s, score): if sum(s) < 3: return for i in range(len(s)-2): if s[i] == False: continue for j in range(i+1, len(s)-1): if s[j] == False: continue for k in range(j+1, len(s)): if s[k] == False: continue if n[i] != '0' and n[i] != n[j] and n[j] == n[k]: cou = int(n[i]) * 100 + int(n[j]) * 11 ans.append(score + cou) s[i] = False s[j] = False s[k] = False dfs(s, score + cou) s[i] = True s[j] = True s[k] = True ans = [] dfs(juge, 0) if len(ans) == 0: print(0) else: print(max(ans)) if __name__ == '__main__': main()