#include<bits/stdc++.h>
using namespace std;
const int maxn=200000+10,mod=1e9+7;
long long mypow(long long m,long long y){
if(y==0){
return 1;
}
long long p=mypow(m,(y>>1));
p*=p;
p%=mod;
if(y&1){
p*=m;
p%=mod;
}
return p;
}
long long n,all[maxn],res,ted;
void vorod(){
cin>>n;
for(long long i=0;i<n;i++){
cin>>all[i];
}
if(n>20){
exit(0);
}
}
void solve(){
for(long long i=1;i<(1<<n);i++){
long long sz=__builtin_popcount(i);
if(sz<res){
continue;
}
long long f=1,mx=-1,mn=1e9+5;
for(long long j=0;j<n;j++){
if((i>>j)&1){
if(all[j]<=mx&&all[j]>=mn){
f=0;
break;
}
mn=min(mn,all[j]);
mx=max(mn,all[j]);
}
}
if(f){
if(sz==res){
ted++;
}else{
res=sz;
ted=1;
}
}
}
}
void khor(){
ted=1ll*ted*mypow(2,n-res)%mod;
cout<<res<<" "<<ted<<endl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("inp.txt","r",stdin);
vorod();
solve();
khor();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
344 KB |
Output isn't correct |
2 |
Incorrect |
11 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
4 ms |
348 KB |
Output isn't correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
3 ms |
348 KB |
Output is correct |
6 |
Correct |
9 ms |
348 KB |
Output is correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
11 |
Incorrect |
10 ms |
1628 KB |
Output isn't correct |
12 |
Incorrect |
10 ms |
1452 KB |
Output isn't correct |
13 |
Incorrect |
8 ms |
1368 KB |
Output isn't correct |
14 |
Incorrect |
11 ms |
1372 KB |
Output isn't correct |
15 |
Incorrect |
13 ms |
1628 KB |
Output isn't correct |
16 |
Incorrect |
16 ms |
1880 KB |
Output isn't correct |
17 |
Incorrect |
12 ms |
1884 KB |
Output isn't correct |
18 |
Incorrect |
12 ms |
1884 KB |
Output isn't correct |
19 |
Incorrect |
13 ms |
1884 KB |
Output isn't correct |
20 |
Incorrect |
15 ms |
1880 KB |
Output isn't correct |