結果
問題 | No.2867 NOT FOUND 404 Again |
ユーザー | katonyonko |
提出日時 | 2024-09-10 19:27:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 229 ms / 3,000 ms |
コード長 | 2,785 bytes |
コンパイル時間 | 181 ms |
コンパイル使用メモリ | 82,324 KB |
実行使用メモリ | 131,412 KB |
最終ジャッジ日時 | 2024-09-10 19:27:36 |
合計ジャッジ時間 | 6,110 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
55,236 KB |
testcase_01 | AC | 45 ms
55,320 KB |
testcase_02 | AC | 46 ms
55,928 KB |
testcase_03 | AC | 205 ms
131,164 KB |
testcase_04 | AC | 229 ms
131,156 KB |
testcase_05 | AC | 189 ms
131,412 KB |
testcase_06 | AC | 198 ms
130,944 KB |
testcase_07 | AC | 188 ms
131,236 KB |
testcase_08 | AC | 188 ms
130,608 KB |
testcase_09 | AC | 204 ms
130,536 KB |
testcase_10 | AC | 191 ms
130,892 KB |
testcase_11 | AC | 198 ms
130,980 KB |
testcase_12 | AC | 186 ms
131,060 KB |
testcase_13 | AC | 187 ms
131,172 KB |
testcase_14 | AC | 188 ms
131,296 KB |
testcase_15 | AC | 187 ms
131,012 KB |
testcase_16 | AC | 192 ms
130,876 KB |
testcase_17 | AC | 198 ms
130,992 KB |
testcase_18 | AC | 119 ms
130,700 KB |
testcase_19 | AC | 167 ms
131,100 KB |
ソースコード
import io import sys from collections import defaultdict, deque, Counter from itertools import permutations, combinations, accumulate from heapq import heappush, heappop from bisect import bisect_right, bisect_left from math import gcd import math _INPUT = """\ 6 1000 98765432109876543210 """ def input(): return sys.stdin.readline()[:-1] mod=998244353 def solve(test): N=input() def idx(i,j): return i*6+j dp=[0]*(len(N)+1)*6 dp[idx(0,5)]=1 for i in range(len(N)): dp[idx(i+1,0)]+=dp[idx(i,0)]+dp[idx(i,2)] dp[idx(i+1,0)]%=mod dp[idx(i+1,1)]+=dp[idx(i,0)] dp[idx(i+1,1)]%=mod dp[idx(i+1,2)]+=dp[idx(i,0)]*8+dp[idx(i,1)]*9+dp[idx(i,2)]*9 dp[idx(i+1,2)]%=mod if N[i]=='4': dp[idx(i+1,3)]+=dp[idx(i,3)]+dp[idx(i,5)] dp[idx(i+1,3)]%=mod dp[idx(i+1,2)]+=(dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)])*3 dp[idx(i+1,2)]%=mod dp[idx(i+1,1)]+=dp[idx(i,3)] dp[idx(i+1,1)]%=mod dp[idx(i+1,2)]+=dp[idx(i,4)]+dp[idx(i,5)] dp[idx(i+1,2)]%=mod elif N[i]=='0': dp[idx(i+1,4)]+=dp[idx(i,3)] dp[idx(i+1,4)]%=mod dp[idx(i+1,5)]+=dp[idx(i,4)]+dp[idx(i,5)] dp[idx(i+1,5)]%=mod elif int(N[i])<4: dp[idx(i+1,5)]+=dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)] dp[idx(i+1,5)]%=mod dp[idx(i+1,1)]+=dp[idx(i,3)] dp[idx(i+1,1)]%=mod dp[idx(i+1,2)]+=dp[idx(i,4)]+dp[idx(i,5)] dp[idx(i+1,2)]%=mod dp[idx(i+1,2)]+=(dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)])*(int(N[i])-1) dp[idx(i+1,2)]%=mod else: dp[idx(i+1,5)]+=dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)] dp[idx(i+1,5)]%=mod dp[idx(i+1,1)]+=dp[idx(i,3)] dp[idx(i+1,1)]%=mod dp[idx(i+1,2)]+=dp[idx(i,4)]+dp[idx(i,5)] dp[idx(i+1,2)]%=mod dp[idx(i+1,2)]+=(dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)])*(int(N[i])-2) dp[idx(i+1,2)]%=mod dp[idx(i+1,0)]+=dp[idx(i,3)]+dp[idx(i,5)] dp[idx(i+1,0)]%=mod print((sum([dp[idx(len(N),i)] for i in range(6)])-1)%mod) # for i in range(len(N)+1): # print(dp[i*6:i*6+6]) def random_input(): from random import randint,shuffle N=randint(1,10) M=randint(1,N) A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)] shuffle(A) return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3 def simple_solve(): return [] def main(test): if test==0: solve(0) elif test==1: sys.stdin = io.StringIO(_INPUT) case_no=int(input()) for _ in range(case_no): solve(0) else: for i in range(1000): sys.stdin = io.StringIO(random_input()) x=solve(1) y=simple_solve() if x!=y: print(i,x,y) print(*[line for line in sys.stdin],sep='') break #0:提出用、1:与えられたテスト用、2:ストレステスト用 main(0)