QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#67304 | #5099. 朝圣道 | Fy5Fengye | 12 | 4189ms | 7384kb | C++14 | 571b | 2022-12-10 11:39:29 | 2022-12-10 11:39:31 |
Judging History
answer
#include<bits/stdc++.h>
// #define int long long
// #include "pilgrimage.h"
using namespace std;
int mo;
int nss,nsr;
int qpow(int x,int y){int ret=1;while(y){if(y&1)ret=1ll*ret*x%mo;y>>=1;x=1ll*x*x%mo;}return ret;}
void init(int o,int p)
{
mo=p;
nss=qpow(2,mo-2);
}
int ask(long long n)
{
n*=2;
int cs=1;
nsr=qpow(nss,n);
int ret=1ll*nsr*cs*(n/2)%mo;
for(int i=1;i<=n;++i)
{
cs=1ll*cs*(n-i+1)%mo;
cs=1ll*cs*qpow(i,mo-2)%mo;
ret=(ret+1ll*cs*nsr%mo*abs(n/2-i)%mo)%mo;
}
return ret;
}
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 4
Accepted
time: 4116ms
memory: 7344kb
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:
5419 364275 514407 329394 364275 229662 53120 520095 520095 509260 514407 364275 509260 5419 277384 5419 520095 53120 5419 115262 229662 243797 115262 416076 229662 509260 53120 520095 115262 416076 229662 243797 416076 520095 329394 53120 416076 509260 509260 243797 5419 329394 115262 243797 520095...
result:
ok 910276 numbers
Test #2:
score: -4
Wrong Answer
time: 4189ms
memory: 7384kb
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:
189735 72365 286872 5037 197790 72365 260463 197790 197790 226785 177807 177807 189735 93360 199353 44220 44220 93360 177807 44220 189735 72365 44220 286872 72365 93360 197790 5037 189735 177807 189735 199353 72365 44220 72365 286872 93360 44220 44220 177807 5037 260463 199353 44220 226785 59655 197...
result:
wrong answer 1st numbers differ - expected: '117936', found: '189735'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 12
Accepted
Test #5:
score: 12
Accepted
time: 5ms
memory: 5372kb
input:
3 1 334547 8234
output:
179079
result:
ok 1 number(s): "179079"
Subtask #4:
score: 0
Time Limit Exceeded
Dependency #3:
100%
Accepted
Test #6:
score: 0
Time Limit Exceeded
input:
4 1000000 581873 49881 62491 206405 26106 129239 174098 141494 61402 149825 241992 8109 243567 71918 203927 278575 263516 143582 32237 195508 269119 9111 105700 80919 229859 150334 171917 78447 62500 190063 138903 6395 222902 118653 136505 242467 64984 170330 287622 27089 35823 107672 273459 188857 ...
output:
Unauthorized output
result:
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
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
Time Limit Exceeded
Dependency #3:
100%
Accepted
Test #13:
score: 0
Time Limit Exceeded
input:
7 1 731039 314313205082038759
output:
Unauthorized output
result:
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
result:
Subtask #9:
score: 0
Skipped
Dependency #2:
0%