QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#651796 | #8340. 3 Sum | UESTC_DECAYALI# | AC ✓ | 265ms | 4328kb | C++20 | 2.2kb | 2024-10-18 18:02:22 | 2024-10-18 18:02:27 |
Judging History
answer
#include<cstdio>
#include<iostream>
#include<cstring>
#define RI register int
#define CI const int&
using namespace std;
const int N=20005;
const int mod1=998244353,mod2=1e9+7,mod3=1e9+9;
struct Hasher
{
int x,y,z;
inline Hasher(CI X=0,CI Y=0,CI Z=0)
{
x=X; y=Y; z=Z;
}
friend inline bool operator == (const Hasher& A,const Hasher& B)
{
return A.x==B.x&&A.y==B.y&&A.z==B.z;
}
friend inline Hasher operator + (const Hasher& A,const Hasher& B)
{
return Hasher((A.x+B.x)%mod1,(A.y+B.y)%mod2,(A.z+B.z)%mod3);
}
friend inline Hasher operator - (const Hasher& A,const Hasher& B)
{
return Hasher((A.x-B.x+mod1)%mod1,(A.y-B.y+mod2)%mod2,(A.z-B.z+mod3)%mod3);
}
friend inline Hasher operator * (const Hasher& A,const Hasher& B)
{
return Hasher(1LL*A.x*B.x%mod1,1LL*A.y*B.y%mod2,1LL*A.z*B.z%mod3);
}
}h[N],tar1,tar2,tar3,tar4;
const Hasher seed=Hasher(10,10,10);
int n,k,num[N*2]; char s[N];
int main()
{
scanf("%d%d",&n,&k);
for (RI l=1;l<=n;++l)
{
scanf("%s",s+1); int m=strlen(s+1);
for (RI i=1;i<=m;++i) num[i]=s[m-i+1]-'0';
int rm=(m+k-1)/k*k;
for (RI i=m+1;i<=rm;++i) num[i]=0;
for (RI i=rm/k-1;i>=1;--i)
{
int carry=0;
for (RI j=(i-1)*k+1;j<=i*k;++j)
{
num[j]+=num[j+k];
if (j+1<=i*k) num[j+1]+=num[j]/10; else carry=num[j]/10;
num[j]%=10;
}
num[(i-1)*k+1]+=carry;
for (RI j=(i-1)*k+1;j<=i*k;++j)
{
if (j+1<=i*k) num[j+1]+=num[j]/10;
num[j]%=10;
}
}
for (RI i=k;i>=1;--i)
h[l]=h[l]*seed+Hasher(num[i],num[i],num[i]);
// printf("h[%d] = %d\n",l,h[l].x);
}
for (RI i=1;i<=k;++i) tar2=tar2*seed+Hasher(9,9,9);
tar3=tar2*Hasher(2,2,2); tar4=tar2*Hasher(3,3,3);
tar1=Hasher(0,0,0); int ans=0;
for (RI a=1;a<=n;++a)
for (RI b=a;b<=n;++b)
for (RI c=b;c<=n;++c)
{
Hasher tmp=h[a]+h[b]+h[c];
ans+=(tmp==tar1||tmp==tar2||tmp==tar3||tmp==tar4);
}
return printf("%d",ans),0;
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 4176kb
input:
4 1 0 1 10 17
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 119ms
memory: 4084kb
input:
500 859 7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 265ms
memory: 4180kb
input:
500 17336 11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...
output:
0
result:
ok 1 number(s): "0"
Test #4:
score: 0
Accepted
time: 226ms
memory: 4176kb
input:
500 1 751324443898124078584847834484321089092662321556147445230263526014359393841194947303407593948729802551881289193716611867931891257925091769456350249725997883453296895094445731130479434019358742162771547784250401546380268386074363779242500860317042151185119666027858022664683818314351285215150806...
output:
2327631
result:
ok 1 number(s): "2327631"
Test #5:
score: 0
Accepted
time: 197ms
memory: 4176kb
input:
500 2 408542968136435277974575411503179002415404345446801430469044749372949272333801248935236224652806667129749035002588943020176263162139056819871274824302889304493205266143688886696157147111754418731401856424401766968832165255416237731963027205324149660112574729610391396555581935236134531799950318...
output:
212002
result:
ok 1 number(s): "212002"
Test #6:
score: 0
Accepted
time: 226ms
memory: 4140kb
input:
500 11500 75411775796562109942642493394321873284995260953010112281856775261847503626737348402159485133662757032091519863427156582689971229143089317472838196453888261138079171290535429921921548971897026706656838415620603757605079012541561774699628665865662183868374645956694140356716037674688084770628...
output:
7675
result:
ok 1 number(s): "7675"
Test #7:
score: 0
Accepted
time: 222ms
memory: 4328kb
input:
500 11500 85355036663164764459816544518601485185320972076300982726542821424439713703229669576802138231401047471351087455159512255765325323540671792953715169122669767368905391325060775725733157611188832204902997772518104188947349204726490597030311894441123834099315122116302203972018409854605418988681...
output:
1070
result:
ok 1 number(s): "1070"
Test #8:
score: 0
Accepted
time: 1ms
memory: 4232kb
input:
1 11500 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999...
output:
1
result:
ok 1 number(s): "1"
Extra Test:
score: 0
Extra Test Passed