Submission #685714

#TimeUsernameProblemLanguageResultExecution timeMemory
685714SummersBeautiful row (IZhO12_beauty)C++14
0 / 100
3080 ms3200 KiB
#include<bits/stdc++.h> #include<vector> #define endl '\n' using namespace std; long long a[1000000], b[1000000], dp[(1<<21)][23], n; long long rec(long long mask, long long last) { if(mask==((1<<n)-1)) return 1; if(dp[mask][last]!=0)return dp[mask][last]; long long an=0; for(int i=0;i<n;i++) { if((mask&(1<<i))==0) { if(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); long long i,j,t,p,p1, ans=0; cin>>n; for(i=0;i<n;i++) { cin>>p; p1=p; while(p>0) { a[i]+=p%2; p/=2; } while(p1>0) { if(p1%3==1)b[i]++; p1/=3; } } for(i=0;i<n;i++)ans+=rec((1<<i),i); cout<<ans<<endl; }

Compilation message (stderr)

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