結果
問題 | No.1515 Making Many Multiples |
ユーザー | ansain |
提出日時 | 2021-05-21 22:47:02 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 926 ms / 2,000 ms |
コード長 | 2,250 bytes |
コンパイル時間 | 2,533 ms |
コンパイル使用メモリ | 87,096 KB |
実行使用メモリ | 109,888 KB |
最終ジャッジ日時 | 2023-07-31 16:11:51 |
合計ジャッジ時間 | 14,862 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,844 KB |
testcase_01 | AC | 106 ms
77,868 KB |
testcase_02 | AC | 926 ms
109,564 KB |
testcase_03 | AC | 880 ms
109,664 KB |
testcase_04 | AC | 883 ms
109,308 KB |
testcase_05 | AC | 879 ms
109,888 KB |
testcase_06 | AC | 426 ms
99,336 KB |
testcase_07 | AC | 497 ms
99,440 KB |
testcase_08 | AC | 375 ms
85,080 KB |
testcase_09 | AC | 539 ms
93,580 KB |
testcase_10 | AC | 572 ms
94,252 KB |
testcase_11 | AC | 687 ms
99,664 KB |
testcase_12 | AC | 511 ms
91,452 KB |
testcase_13 | AC | 138 ms
78,576 KB |
testcase_14 | AC | 756 ms
99,880 KB |
testcase_15 | AC | 136 ms
78,528 KB |
testcase_16 | AC | 867 ms
107,656 KB |
testcase_17 | AC | 248 ms
93,512 KB |
testcase_18 | AC | 200 ms
98,716 KB |
testcase_19 | AC | 121 ms
78,096 KB |
testcase_20 | AC | 252 ms
78,128 KB |
testcase_21 | AC | 561 ms
99,340 KB |
testcase_22 | AC | 126 ms
78,148 KB |
testcase_23 | AC | 606 ms
99,464 KB |
testcase_24 | AC | 89 ms
71,772 KB |
testcase_25 | AC | 95 ms
76,116 KB |
testcase_26 | AC | 88 ms
71,760 KB |
testcase_27 | AC | 660 ms
99,512 KB |
testcase_28 | AC | 418 ms
99,576 KB |
testcase_29 | AC | 122 ms
78,160 KB |
testcase_30 | AC | 138 ms
77,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 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 main(): mod = 10**9+7 mod2 = 998244353 n, k, x, y = map(int, input().split()) A = list(map(int, input().split())) dp = [[-1]*k for i in range(k)] dp[x % k][y % k] = 0 dp[y % k][x % k] = 0 max1 = [-1]*k max2 = [-1]*k max1[x % k] = 0 max1[y % k] = 0 max2[y % k] = 0 max2[x % k] = 0 for AA in A: A2 = AA % k for a in range(k): b = (0-A2-a) % k if dp[a][b] != -1: dp[a][b] += 1 max1[a] = max(max1[a], dp[a][b]) max2[b] = max(max2[b], dp[a][b]) """ if a != b and dp[b][a] != -1: dp[b][a] += 1 max2[a] = max(max2[a], dp[b][a]) max1[b] = max(max1[b], dp[b][a]) """ for c in range(k): dp[c][A2] = max(dp[c][A2], max2[c], max1[c]) dp[A2][c] = max(dp[A2][c], max2[c], max1[c]) for c in range(k): max1[c] = max(max1[c], dp[c][A2]) max2[A2] = max(max2[A2], dp[c][A2]) max2[c] = max(max2[c], dp[A2][c]) max1[A2]=max(max1[A2], dp[A2][c]) # print(dp,max1,max2) print(max(max(b) for b in dp)) if __name__ == '__main__': main()