# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337968 | Kerim | Beautiful row (IZhO12_beauty) | C++17 | 2708 ms | 164716 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int n,all,two[22],three[22];
ll dp[1<<20][20];
ll rec(int mask,int last){
if(mask==all)return 1;
ll &ret=dp[mask][last];
if(~ret)
return ret;ret=0;
for(int i=0;i<n;i++)
if(!(mask>>i&1) and (two[i]==two[last] or three[i]==three[last]))
ret+=rec(mask|(1<<i),i);
return ret;
}
int main(){
// freopen("file.in", "r", stdin);
memset(dp,-1,sizeof dp);
scanf("%d",&n);all=(1<<n)-1;
for(int i=0;i<n;i++){
int x,xx;
scanf("%d",&x);xx=x;
while(x>=1){
if(x%2==1)
two[i]++;
x/=2;
}x=xx;
while(x>=1){
if(x%3==1)
three[i]++;
x/=3;
}
}
ll ans=0;
for(int i=0;i<n;i++)
ans+=rec(1<<i,i);
printf("%lld\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |