QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#67096	#5099. 朝圣道	xlwang	0	766ms	149172kb	C++14	664b	2022-12-10 08:45:05	2022-12-10 08:45:07

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-12-10 08:45:07]
评测

测评结果：0
用时：766ms
内存：149172kb

查看

[2022-12-10 08:45:05]
提交

answer

#include <bits/stdc++.h>
#include "pilgrimage.h"
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
const int Maxn=3e3+20;
ll f[Maxn][Maxn<<1];
ll c[Maxn][Maxn];
inline ll ksm(ll x,ll y,ll mod){
	ll sum=1;
	while(y){
		if(y&1) sum=sum*x%mod;
		y=y/2;
		x=x*x%mod;
	}
	return sum;
}
int mod;
int ans[Maxn];
void init(int o, int p){
	mod=p;
	f[0][3005]=1;
	int p1,p2,p3;
	p1=p3=ksm(4,p-2,p);
	p2=ksm(2,p-2,p);
	fr(i,1,3000) fr(j,1,6020) f[i][j]=(f[i-1][j]*p2%p+f[i-1][j-1]*p3%p+f[i-1][j+1]*p1%p)%p;
	fr(n,1,3000) fr(i,1,6020) ans[n]+=1ll*abs(i-3005)*f[n][i]%mod,ans[n]%=mod;
}
int ask(long long n){
	return ans[n];
}

源文件, 语言: C++14

详细

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 4

Accepted

time: 766ms

memory: 149024kb

input:

1 910276 554767
6
10
7
4
10
12
9
3
3
5
7
10
5
6
1
6
3
9
6
8
12
11
8
2
12
5
9
3
8
2
12
11
2
3
4
9
2
5
5
11
6
4
8
11
3
9
2
2
8
9
2
8
9
6
2
9
2
10
10
7
5
6
4
4
11
12
8
8
2
2
4
3
3
5
6
6
8
11
6
9
9
3
4
1
2
2
6
9
9
2
3
2
12
6
1
7
2
4
12
11
4
7
6
3
9
4
6
5
3
3
12
6
2
1
1
7
2
6
5
9
11
6
3
4
11
1
2
4
5
4
10...

output:

result:

ok 910276 numbers

Test #2:

score: -4

Wrong Answer

time: 758ms

memory: 149172kb

input:

1 972231 293475
7
1
9
6
5
1
11
5
5
12
2
2
7
3
4
10
10
3
2
10
7
1
10
9
1
3
5
6
7
2
7
4
1
10
1
9
3
10
10
2
6
11
4
10
12
8
5
2
12
4
9
12
7
2
12
4
3
1
2
9
12
1
4
5
6
12
6
5
9
2
5
12
3
4
6
12
12
2
1
6
4
12
10
5
12
7
9
8
3
8
10
5
3
6
12
7
7
10
7
10
8
7
7
2
2
4
8
6
10
8
11
6
11
10
3
9
5
2
5
1
10
2
11
4
4
3...

output:

result:

wrong answer 1st numbers differ - expected: '117936', found: '53907'

Subtask #2:

score: 0

Skipped

Dependency #1:

Subtask #3:

score: 0

Wrong Answer

Test #5:

score: 0

Wrong Answer

time: 745ms

memory: 145076kb

input:

3 1 334547
8234

output:

result:

wrong answer 1st numbers differ - expected: '179079', found: '0'

Subtask #4:

score: 0

Skipped

Dependency #3:

Subtask #5:

score: 0

Skipped

Dependency #4:

Subtask #6:

score: 0

Runtime Error

Test #8:

score: 0

Runtime Error

input:

6 958477 522361
280121915553826833
734266539148641647
72849162479700582
274266741463686096
60278972064195458
828423669427600612
571432949203039978
518511460268700898
486268614705621285
19216283231217074
611458416727512530
175147354285288662
799769622289998997
400123443628688299
145546980862133838
40...

output:

Unauthorized output

result:

Subtask #7:

score: 0

Skipped

Dependency #3:

Subtask #8:

score: 0

Runtime Error

Test #33:

score: 0

Runtime Error

input:

8 9963 251
831797004675585320
494759973681332858
701341496127272302
252910460485222469
250965009655458584
366193481309061299
633134388675839346
791999098066205672
196620805863610860
363773642045280947
466508590762410710
407790578717064135
181590911404670570
570642047249889864
70138464625729452
23634...

output:

Unauthorized output

QOJ.ac

QOJ

Judging History

answer

详细

Subtask #1:

Test #1:

input:

output:

result:

Test #2:

input:

output:

result:

Subtask #2:

Dependency #1:

Subtask #3:

Test #5:

input:

output:

result:

Subtask #4:

Dependency #3:

Subtask #5:

Dependency #4:

Subtask #6:

Test #8:

input:

output:

result:

Subtask #7:

Dependency #3:

Subtask #8:

Test #33:

input:

output:

result:

Subtask #9:

Dependency #2: