QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#637253	#3090. Inverse Problem	ohwphil	WA	14ms	10732kb	Python3	471b	2024-10-13 11:42:13	2024-10-13 11:42:14

Judging History

你现在查看的是最新测评结果

[2024-10-13 11:42:14]
评测

测评结果：WA
用时：14ms
内存：10732kb

查看

[2024-10-13 11:42:13]
提交

answer

N,M=map(int,input().split())
*nums,=map(int,input().split())
in_nums=[0]*(N+1)
intervals=[0]*(N+1)
for n in nums:
    in_nums[n]=1
intervals[nums[0]]+=1
for i in range(M-1):
    if nums[i]==1:
        break
    intervals[max(nums[i],nums[i+1])]+=1
for i in range(N):
    intervals[i+1]+=intervals[i]
curr_cnt=0
ans=1
MOD=119<<23|1
for i in range(1,N+1):
    if not in_nums[i]:
        ans=ans*(intervals[i]+curr_cnt)%MOD
        curr_cnt+=1
print(ans)

Source code, Language: Python3

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 9ms

memory: 10572kb

input:

7 2
2 1

output:

result:

ok single line: '720'

Test #2:

score: 0

Accepted

time: 14ms

memory: 10624kb

input:

8 5
2 3 4 5 8

output:

result:

ok single line: '0'

Test #3:

score: 0

Accepted

time: 7ms

memory: 10584kb

input:

498 121
20 35 40 72 79 92 113 117 154 231 243 244 264 268 304 337 362 378 463 477 56 494 495 1 342 395 183 423 291 475 82 422 96 265 83 283 242 34 187 75 74 47 208 380 400 17 202 50 418 73 233 307 181 344 48 149 107 435 365 459 280 55 375 391 403 241 64 374 10 386 322 308 186 136 277 497 332 262 165...

output:

result:

ok single line: '0'

Test #4:

score: -100

Wrong Answer

time: 14ms

memory: 10732kb

input:

499 396
2 3 6 8 11 13 14 15 16 19 22 23 24 32 36 37 40 41 44 51 53 56 57 58 61 62 66 68 74 75 76 79 80 85 86 87 89 90 91 92 96 98 101 102 109 110 111 113 114 115 117 119 122 123 127 129 130 135 140 141 145 149 150 160 163 166 167 171 173 176 177 183 185 195 197 200 204 207 210 216 217 229 230 235 23...

output:

556269190

result:

wrong answer 1st lines differ - expected: '824443602', found: '556269190'