Submission #685723

#TimeUsernameProblemLanguageResultExecution timeMemory
685723SummersBeautiful row (IZhO12_beauty)C++14
0 / 100
3017 ms1748 KiB
#include<bits/stdc++.h> #include<vector> #define endl '\n' using namespace std; int a[1000000], b[1000000], dp[(1<<22)][23], n; int rec(int mask, int last) { if(mask==((1<<n)-1)) return 1; if(last!=-1 && dp[mask][last]!=0)return dp[mask][last]; int an=0; for(int i=0;i<n;i++) { if(!(mask&(1<<i))) { if(last==-1 || (a[last]==a[i] || b[last]==b[i])) { an+=rec(mask|(1<<i), i); } } } return dp[mask][last]=an; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int i,j,t,p,p1, ans=0; cin>>n; for(i=0;i<n;i++) { cin>>p; a[i]=__builtin_popcount(p); p1=p; while(p1>0) { if(p1%3==1)b[i]++; p1/=3; } } ans+=rec(0,-1); cout<<ans<<endl; }

Compilation message (stderr)

beauty.cpp: In function 'int main()':
beauty.cpp:32:11: warning: unused variable 'j' [-Wunused-variable]
   32 |     int i,j,t,p,p1, ans=0;
      |           ^
beauty.cpp:32:13: warning: unused variable 't' [-Wunused-variable]
   32 |     int i,j,t,p,p1, ans=0;
      |             ^
#Verdict Execution timeMemoryGrader output
Fetching results...