QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#673330 | #9353. Interesting Permutation | ShirasuAzusa | WA | 60ms | 4032kb | C++20 | 856b | 2024-10-24 21:46:20 | 2024-10-24 21:46:21 |
Judging History
answer
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef pair<int,int> PII;
const int N = 2e5 + 5, MOD = 1e9 + 7;
int n;
int a[N];
int ksm(int a,int b){
int r = 1;
while (b){
if (b & 1) r = r * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return r;
}
void solve(){
cin >> n;
bool f = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
if(i != 1 && a[i] == 0) f = 1;
}
if(a[0] != 0 || a[n] != n - 1 || f){
cout << 0 << endl;
return;
}
int cnt = 0;
for(int i = 2; i <= n; i++){
if(a[i] != a[i - 1]) cnt++;
}
cout << ksm(2, cnt) << endl;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int _ = 1;
cin >> _;
while(_--){
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3700kb
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: 60ms
memory: 4032kb
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:
256 0 0 256 67108864 65536 2048 1024 0 16777216 65536 524288 73741817 -147483634 8388608 4 0 512 2 1048576 524288 33554432 -147483634 2 0 1048576 4194304 0 2048 0 65536 8192 16 536870912 128 0 134217728 4 536870912 1048576 2 32768 1024 0 0 2 0 2 0 0 0 0 0 4 32768 -147483634 0 524288 268435456 262144...
result:
wrong answer 1st lines differ - expected: '0', found: '256'