# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338327 | beksultan04 | Beautiful row (IZhO12_beauty) | C++14 | 17 ms | 23788 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>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+11,INF=1e9+7;
int tr[30],dv[30],vis[300],ans,n;
vector <int> g[N];
int troich(int x){
int ans=0;
while (x > 0){
if (x%3==1)ans++;
x /=3;
}
ret ans;
}
int dvoich(int x){
int ans=0;
while (x > 0){
if (x%2==1)ans++;
x /=2;
}
ret ans;
}
bool is(int a,int b){
ret (tr[a] == tr[b] || dv[a] == dv[b]);
}
void dfs(int x,int cnt){
if (cnt == n){
ans++;
ret ;
}
for (int i=0;i<g[x].size();++i){
if (vis[g[x][i]]==1)continue;
vis[i]=1;
dfs(g[x][i],cnt+1);
vis[i]=0;
}
}
main(){
int i,j;
scan1(n)
for (i=0;i<n;++i){
int x;
scan1(x)
tr[i]=troich(x);
dv[i]=dvoich(x);
}
for (i=0;i<n;++i){
for (j=i+1;j<n;++j){
if (is(i,j)){
g[i+1].pb(j+1);
g[j+1].pb(i+1);
}
}
}
for (i=1;i<=n;++i){
vis[i]=1;
dfs(i,1);
vis[i]=0;
}
cout <<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |