QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #878362 | #8478. Count the Orders | kangkunma | WA | 214ms | 48256kb | Python3 | 303b | 2025-02-01 14:57:52 | 2025-02-01 14:57:52 |
Judging History
answer
f=[1];M=10**9+7;n=int(input());A=0
for i in range(1000001):f+=[f[-1]*(i+1)%M]
c=f[n]*pow(f[n-1-(n%2)],-1,M)*f[n//2-1]*f[n//2]%M
l=[*map(int,input().split())];l.sort()
r=[[i//2+1,n-i//2][i%2] for i in range(n)]
for i in range(n):A+=(l[r[i]-1]-l[r[(i+1)%n]-1])*[-1,1][i%2]
print(A+l[r[-1]-1]-l[0],c)
详细
Test #1:
score: 0
Wrong Answer
time: 214ms
memory: 48256kb
input:
3 1 2 3
output:
3 6
result:
wrong answer 1st numbers differ - expected: '4', found: '3'