QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#67284	#5099. 朝圣道	Schi2oid	12	178ms	35124kb	C++14	473b	2022-12-10 11:25:34	2022-12-10 11:25:35

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 11:25:35]
评测

测评结果：12
用时：178ms
内存：35124kb

查看

[2022-12-10 11:25:34]
提交

answer

#include <bits/stdc++.h>
#include "pilgrimage.h"
using namespace std;
int dp[3005][3005];
int ans[3005];
void init(int o, int mod)
{
	int ny=(mod+1)/2;
	dp[0][0]=1;
	ans[0]=0;
	for(int i=1;i<=3000;i++){
		dp[i][0]=(1ll*dp[i-1][0]*ny+1ll*dp[i-1][1]*ny)%mod;
		for(int j=1;j<=i;j++) dp[i][j]=((1ll*dp[i-1][j-1]+1ll*dp[i-1][j+1])*ny%mod*ny%mod+1ll*dp[i-1][j]*ny%mod)%mod;
		ans[i]=(ans[i-1]+1ll*dp[i-1][0]*ny)%mod;
	}
}

int ask(long long n){return ans[n];}

源文件, 语言: C++14

詳細信息

Subtask #1:

score: 4

Accepted

Test #1:

score: 4

Accepted

time: 178ms

memory: 34928kb

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: 0

Accepted

time: 162ms

memory: 35124kb

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:

ok 972231 numbers

Subtask #2:

score: 8

Accepted

Dependency #1:

100%

Accepted

Test #3:

score: 8

Accepted

time: 165ms

memory: 35052kb

input:

2 957481 386233
816
1256
2812
1370
1469
1439
33
929
1437
2680
1001
1846
1936
1161
1823
1417
2823
1753
2434
577
1671
676
174
2401
1762
123
785
604
1650
117
2344
1365
221
1096
1087
1057
457
2254
647
1827
266
1599
1445
83
2685
1372
1795
2595
1909
2605
1608
2656
1114
581
725
725
2964
1893
2997
2159
2457...

output:

result:

ok 957481 numbers

Test #4:

score: 0

Accepted

time: 169ms

memory: 34972kb

input:

2 912746 991287
2945
439
558
2022
1589
2495
2517
2291
2215
160
319
1671
2800
2008
2885
29
41
580
1156
2553
1876
1137
2129
2338
1046
1818
2691
1454
1229
1965
635
1516
987
1629
140
2320
1715
2644
452
1353
2755
693
956
2518
1154
2441
946
137
496
786
2489
1509
190
2177
1216
1725
480
2572
1774
2465
298
2...

output:

result:

ok 912746 numbers

Subtask #3:

score: 0

Wrong Answer

Test #5:

score: 0

Wrong Answer

time: 154ms

memory: 31076kb

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

result:

Subtask #9:

score: 0

Skipped

Dependency #2:

100%

Accepted

QOJ.ac

QOJ

Judging History

answer

詳細信息

Subtask #1:

Test #1:

input:

output:

result:

Test #2:

input:

output:

result:

Subtask #2:

Dependency #1:

Test #3:

input:

output:

result:

Test #4:

input:

output:

result:

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:

Dependency #5: