QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #660411 | #9353. Interesting Permutation | XG0000# | WA | 64ms | 4044kb | C++14 | 446b | 2024-10-20 11:03:33 | 2024-10-20 11:03:33 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T,n,h[100005];
const int P=1000000007;
#define ll long long
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>T;
while(T --> 0)
{
ll ans=1;
cin>>n;
for(int i=1;i<=n;++i)cin>>h[i],ans&=(h[i]<n)&&(h[i]>=i-1);
for(int i=2;i<=n;++i)
{
if(h[i]>h[i-1])(ans<<=1)%=P;
else if(h[i]==h[i-1])(ans*=h[i]+2-i)%=P;
}
cout<<ans<<endl;
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
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: -100
Wrong Answer
time: 64ms
memory: 4044kb
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:
30720 0 0 15360 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 14...
result:
wrong answer 1st lines differ - expected: '0', found: '30720'