QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#571785 | #9353. Interesting Permutation | huaxiamengjin | AC ✓ | 322ms | 5980kb | C++14 | 779b | 2024-09-18 08:37:42 | 2024-09-18 08:37:43 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int NN=1e9+7;
int p[100100],ni[100100];
int n,a[100100];
int mi(int x,int y){
int sum=1;
for (;y;y>>=1,x=x*x%NN)
if(y&1)sum=sum*x%NN;
return sum;
}
int c(int x,int y){
if(x<0||y<0||x<y)return 0;
return p[x]*ni[x-y]%NN;
}
void solve(){
cin>>n;
for (int i=1;i<=n;i++)
cin>>a[i];
int pre=n-1;
int ans=1;
for (int i=n;i>=1;i--){
if(a[i]!=pre){
ans=ans*2%NN*c(pre-i,pre-a[i]-1)%NN;
if(ans==0)break;
pre=a[i];
}
}
if(pre!=0)cout<<0<<"\n";
else cout<<ans<<"\n";
}
signed main(){
int N=1e5;
p[0]=1;
for (int i=1;i<=N;i++)
p[i]=p[i-1]*i%NN;
ni[N]=mi(p[N],NN-2);
for (int i=N;i;i--)
ni[i-1]=ni[i]*i%NN;
int T;cin>>T;
while(T--)solve();
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 5200kb
input:
3 3 0 2 2 3 0 1 2 3 0 2 3
output:
2 4 0
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 217ms
memory: 5976kb
input:
10039 14 5 6 7 8 9 10 11 12 13 13 13 13 13 13 14 0 5 6 7 8 9 10 11 12 13 14 14 14 14 1 1 14 0 5 4 8 9 10 11 12 13 13 13 13 13 13 45 0 1 1 2 2 3 5 5 6 6 8 9 11 13 15 17 18 18 20 22 22 24 26 26 26 26 27 27 27 28 30 32 32 33 34 34 34 36 36 38 38 38 39 39 44 24 0 2 3 5 7 9 9 10 11 12 13 14 14 14 14 15 1...
output:
0 0 0 0 0 0 24576 0 0 0 0 0 658159182 0 805306368 8 572589350 12288 2 0 981283070 0 0 2 0 0 0 0 4423680 0 0 14155776 16 0 768 0 0 0 855189487 0 2 0 0 0 0 2 0 2 797370259 0 0 0 0 4 0 0 0 301989888 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 192 0 0 12288 0 0 2 8 0 0 495514526 0 0 955131071 768 0 0 147456 0 0...
result:
ok 10039 lines
Test #3:
score: 0
Accepted
time: 322ms
memory: 5980kb
input:
20 100000 0 1 2 3 5 6 7 9 10 10 12 12 12 13 14 15 17 17 18 19 21 22 24 26 28 28 28 28 29 31 32 34 35 36 38 39 39 39 41 41 42 44 45 47 48 49 51 53 54 56 58 58 58 60 62 62 64 64 64 66 66 66 66 68 70 70 71 72 72 74 74 75 76 77 77 78 80 80 82 82 84 85 86 86 88 88 89 90 91 91 93 93 95 97 98 100 101 103 1...
output:
202795881 940225306 406525679 536765675 729062616 366047380 66289678 199278830 570456350 993317415 17778389 674797620 787821942 841428534 632185280 579006079 822641126 664256526 482813708 821188194
result:
ok 20 lines
Test #4:
score: 0
Accepted
time: 2ms
memory: 5140kb
input:
1 14 5 6 7 8 9 10 11 12 13 13 13 13 13 13
output:
0
result:
ok single line: '0'
Test #5:
score: 0
Accepted
time: 2ms
memory: 5208kb
input:
1 14 0 5 6 7 8 9 10 11 12 13 14 14 14 14
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 0ms
memory: 5144kb
input:
1 1 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 2ms
memory: 5204kb
input:
1 14 0 5 4 8 9 10 11 12 13 13 13 13 13 13
output:
0
result:
ok single line: '0'
Extra Test:
score: 0
Extra Test Passed