QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #818119 | #8340. 3 Sum | KowerKoint# | TL | 128ms | 25952kb | Python3 | 490b | 2024-12-17 16:34:00 | 2024-12-17 16:34:01 |
Judging History
answer
import sys
sys.set_int_max_str_digits(10**9)
from collections import defaultdict
N,K=map(int,input().split())
M=10**K-1
A=[int(input()) for a in range(N)]
B=[a%M for a in A]
mod0=(1<<61)-1
ans=0
for D in (M,2*M):
B0=[a%mod0 for a in B]
D0=D%mod0
dct=defaultdict(int)
for j in range(N):
dct[B0[j]]+=1
for k in range(j,N):
a0=B0[j]+B0[k]
ans+=dct[(D0-a0)%mod0]
cnt=B.count(0)
ans+=cnt*(cnt+1)*(cnt+2)//6
print(ans)
詳細信息
Test #1:
score: 100
Accepted
time: 15ms
memory: 10644kb
input:
4 1 0 1 10 17
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 128ms
memory: 25952kb
input:
500 859 7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: -100
Time Limit Exceeded
input:
500 17336 11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...