QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#67402	#5099. 朝圣道	Scapegoat_Dawn	0	0ms	0kb	C++14	961b	2022-12-10 12:29:20	2022-12-10 12:30:17

Judging History

This is the latest submission verdict.

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

[2022-12-10 12:30:17]
Judged

Verdict: 0
Time: 0ms
Memory: 0kb

Show

[2022-12-10 12:29:20]
Submitted

answer

#include "pilgrimage.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 3000 + 5;
int mod;
int f[maxn][maxn << 1], Answer[maxn], Inv2, Inv4;
inline int Ksm(int x, int y) {
    int res = 1;
    while(y) {
        if(y & 1) res = 1ll * res * x % mod;
        x = 1ll * x * x % mod;
    }
    return res;
}
inline int Calc(int x) { return Ksm(x, mod - 2); }
void init(int o, int p) {
    mod = p;
    f[0][3000] = 1, Inv2 = Calc(2), Inv4 = Calc(4);
    for(register int i = 1; i <= 3000; ++i)
        for(register int j = 3000 - i; j <= 3000 + i; ++j)
            f[i][j] = (1ll * f[i - 1][j - 1] * Inv4 % mod + 1ll * f[i - 1][j] * Inv2 % mod + 1ll * f[i - 1][j + 1] * Inv4 % mod) % mod;
    for(register int i = 1; i <= 3000; ++i) {
        for(register int j = 3000 - i; j <= 3000 + i; ++j) Answer[i] = (1ll * Answer[i] + 1ll * f[i][i - j] * abs(j - 3000) % mod) % mod;
    }
}
int ask(long long  n) { return Answer[n]; }

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0

Time Limit Exceeded

Test #1:

score: 0

Time Limit Exceeded

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:

Unauthorized output

result:

Subtask #2:

score: 0

Skipped

Dependency #1:

Subtask #3:

score: 0

Time Limit Exceeded

Test #5:

score: 0

Time Limit Exceeded

input:

3 1 334547
8234

output:

Unauthorized output

result:

Subtask #4:

score: 0

Skipped

Dependency #3:

Subtask #5:

score: 0

Skipped

Dependency #4:

Subtask #6:

score: 0

Time Limit Exceeded

Test #8:

score: 0

Time Limit Exceeded

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

Time Limit Exceeded

Test #33:

score: 0

Time Limit Exceeded

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

Details

Subtask #1:

Test #1:

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: