QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#624851 | #9353. Interesting Permutation | NENULZY | AC ✓ | 98ms | 4512kb | C++17 | 1.2kb | 2024-10-09 16:44:34 | 2024-10-09 16:44:34 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long ,long long >
ll mod=1e9+7;
ll a[200005];
int checkill(int n){
if(a[1]!=0) return 0;
if(a[n]!=n-1) return 0;
for(int i=1;i<=n-1;i++){
if(a[i+1]<a[i]||a[i]<i-1) return 0;
}
return 1;
}
ll A(ll sumx,ll sumy){
ll res=1;
for (ll i=1;i<=sumx;i++){
res*=sumy;
res%=mod;
sumy--;
}
return res;
}
void solve() {
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
if (!checkill(n)){
cout<<0<<"\n";
return;
}
// ll ans=(n-a[2])*2;
//cout<<"ans "<<ans<<"\n";
ll ans=2;
for (int i=3;i<=n;i++){
if (a[i]==a[i-1]){
int j=i;
while(a[j+1]==a[j]);
ll sumx=j-i+1;
ll sumy=a[i]-(i-1)+1;
//cout<<sumx<<sumy<<"\n";
ans*=A(sumx,sumy);
ans%=mod;
i=j;
}
else{
//cout<<"fun\n";
ans*=2;
ans%=mod;
}
}
cout<<ans%mod<<"\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
//cout << "Case #" << i << ":";
// cout<<"n: ";
// cout<<i<<" \n";
solve();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3672kb
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: 62ms
memory: 4512kb
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: 98ms
memory: 4380kb
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: 0ms
memory: 3664kb
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: 0ms
memory: 3592kb
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: 3652kb
input:
1 1 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3672kb
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