QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#603406 | #9353. Interesting Permutation | Saton | WA | 61ms | 4352kb | C++20 | 1.2kb | 2024-10-01 16:25:15 | 2024-10-01 16:25:16 |
Judging History
answer
///by Saton.
#include<bits/stdc++.h>
#define PI acos(-1)
#define fi first
#define se second
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define LL long long
#define ll __int128
#define DD double double
#define LD long double
#define rep(i,a,b) for(LL i = (a);i <= (b);i ++)
#define lep(i,a,b) for(LL i = (a);i >= (b);i --)
#define FLUSH fflush(stdout)
using namespace std;
const int N = 2e5 + 10,mod = 1e9+7,P = 131;
const LL inf = 1e9+10,INF = 1e18+10;
typedef pair<int,int> PII;
typedef pair<LL,int> PLI;
typedef pair<LL,LL> PLL;
LL n,m,k;
void solve() {
cin >> n;
vector<LL> a(n+1);
rep(i,1,n) cin >> a[i];
if(a[1]!=0 || a[n]!=n-1) {
cout << 0 << '\n';
return;
}
rep(i,1,n-1) if(a[i]>n-1 || a[i]>a[i+1]) {
cout << 0 << '\n';
return;
}
LL ans = 1;
rep(i,1,n-1) if(a[i]!=a[i+1]) ans = ans*2%mod;
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int T;
cin >> T;
while(T --) {
solve();
}
// solve();
return 0;
}
/* /\_/\
* (= ._.)
* / > \>
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3556kb
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: 61ms
memory: 4352kb
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 67108864 65536 2048 1024 589934536 16777216 65536 524288 73741817 147483634 8388608 4 294967268 512 2 1048576 524288 33554432 147483634 2 33554432 1048576 4194304 8 2048 536870912 65536 8192 16 536870912 128 8192 134217728 4 536870912 1048576 2 32768 1024 2097152 64 2 33554432 2 294967268 83...
result:
wrong answer 5th lines differ - expected: '0', found: '67108864'