QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#424024#8340. 3 Sumushg8877WA 174ms82084kbC++141.4kb2024-05-28 20:54:222024-05-28 20:54:26

Judging History

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

  • [2024-09-20 10:20:30]
  • hack成功,自动添加数据
  • (/hack/848)
  • [2024-05-28 20:54:26]
  • 评测
  • 测评结果:WA
  • 用时:174ms
  • 内存:82084kb
  • [2024-05-28 20:54:22]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
const int MOD1=998244353;
const int MOD2=1e9+7;
const int MOD3=1004535809;
int n,k;
ll a[505][20005];char c[20005];
ll hs1[505],hs2[505],hs3[505];
ll r1,r2,r3;
ll ksm(ll a,ll b,ll MOD){ll r=1;while(b){if(b&1)r=r*a%MOD;a=a*a%MOD,b>>=1;}return r;}
void read(ll *a){
	cin>>c;int len=strlen(c);
	for(int i=0;i<len;i++) a[i]=c[len-1-i]-'0';
	for(int i=len-1;i>=k;i--){
		while(a[i]){
			a[i-k]+=a[i];a[i]=0;
			int p=i-k;
			while(a[p]>=10){
				a[p]-=10;a[++p]++;
			}
		}
	}
	bool flag=true;
	for(int i=0;i<k;i++) if(a[i]!=9) flag=false;
	if(flag) memset(a,0,sizeof(a));
	return;
}
int main(){
	ios::sync_with_stdio(false);
	// freopen("Otomachi_Una.in","r",stdin);
	// freopen("Otomachi_Una.out","w",stdout);
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		read(a[i]);
		for(int j=k;j>=0;j--){
			hs1[i]=(hs1[i]*10+a[i][j])%MOD1;
			hs2[i]=(hs2[i]*10+a[i][j])%MOD2;
			hs3[i]=(hs3[i]*10+a[i][j])%MOD3;
		}
	}
	r1=ksm(10,k,MOD1)-1,r2=ksm(10,k,MOD2)-1,r3=ksm(10,k,MOD3)-1;
	int ans=0;
	for(int i=1;i<=n;i++) for(int j=i;j<=n;j++) for(int k=j;k<=n;k++)
		for(int o=0;o<=2;o++) if((hs1[i]+hs1[j]+hs1[k])%MOD1==o*r1%MOD1
			&&(hs2[i]+hs2[j]+hs2[k])%MOD2==o*r2%MOD2&&
			(hs3[i]+hs3[j]+hs3[k])%MOD3==o*r3%MOD3){
				ans++;
			}
	cout<<ans<<'\n';
	cerr<<"Running time: "<<1.*clock()/CLOCKS_PER_SEC<<'\n';
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 6008kb

input:

4 1
0
1
10
17

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 87ms
memory: 79900kb

input:

500 859
7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...

output:

0

result:

ok 1 number(s): "0"

Test #3:

score: 0
Accepted
time: 158ms
memory: 82084kb

input:

500 17336
11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...

output:

0

result:

ok 1 number(s): "0"

Test #4:

score: 0
Accepted
time: 174ms
memory: 82032kb

input:

500 1
751324443898124078584847834484321089092662321556147445230263526014359393841194947303407593948729802551881289193716611867931891257925091769456350249725997883453296895094445731130479434019358742162771547784250401546380268386074363779242500860317042151185119666027858022664683818314351285215150806...

output:

2327631

result:

ok 1 number(s): "2327631"

Test #5:

score: -100
Wrong Answer
time: 153ms
memory: 82032kb

input:

500 2
408542968136435277974575411503179002415404345446801430469044749372949272333801248935236224652806667129749035002588943020176263162139056819871274824302889304493205266143688886696157147111754418731401856424401766968832165255416237731963027205324149660112574729610391396555581935236134531799950318...

output:

212256

result:

wrong answer 1st numbers differ - expected: '212002', found: '212256'