QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #624456 | #9353. Interesting Permutation | ucup-team4352# | WA | 60ms | 3984kb | C++23 | 678b | 2024-10-09 15:53:19 | 2024-10-09 15:53:20 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define lowbit(x) (x&-x)
#define log(x) (31^__builtin_clz(x))
using namespace std;
const int p=1e9+7;
int a[100005];
void solve(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
if(a[i]>=n){
cout<<"0\n";
return;
}
}
for(int i=1;i<n;i++){
if(a[i]>a[i+1]){
cout<<"0\n";
return;
}
}
ll ans=n-a[n];
for(int i=n-1;i>0;i--){
if(a[i]<a[i+1]){
ans=ans*2%p;
}
}
cout<<ans<<"\n";
}
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t=1;
cin>>t;
while(t--)solve();
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 3984kb
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 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 ...
result:
wrong answer 1st lines differ - expected: '0', found: '256'