QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #627109 | #9353. Interesting Permutation | guodong# | AC ✓ | 110ms | 4204kb | C++14 | 626b | 2024-10-10 14:47:00 | 2024-10-10 14:47:02 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(x, l, r) for(int x = l; x <= r; x++)
using namespace std;
const int MAXN = 1e5 + 5;
const int mod = 1e9 + 7;
int a[MAXN];
int main(){
int t;
scanf("%d", &t);
while(t--){
int n;
scanf("%d", &n);
rep(i, 1, n) scanf("%d", &a[i]);
int cnt = 0, ans = 1;
if(a[n] != n - 1) ans = 0;
rep(i, 2, n){
if(a[i] < a[i - 1]){
ans = 0;
break;
}
if(a[i] == a[i - 1]){
ans = 1ll * ans * cnt % mod;
cnt--;
}
else{
ans = 1ll * ans * 2 % mod;
cnt += a[i] - a[i - 1] - 1;
}
}
printf("%d\n", ans);
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3756kb
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: 83ms
memory: 4204kb
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: 110ms
memory: 4204kb
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: 3876kb
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: 3804kb
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: 3824kb
input:
1 1 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3756kb
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