# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90110 | Aydarov03 | Beautiful row (IZhO12_beauty) | C++14 | 3032 ms | 620 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.
//16272
#include <bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
int a[30];
int st[30];
bool used[30];
int n , ans;
map <int,int> bin;
map <int,int> ter;
void rec( int k )
{
if( k == n + 1 )
{
ans++;
return;
}
for(int i = 1; i <= n; i++)
{
if( k == 1 || ( !used[i] && ( ter[a[i]] == ter[st[k-1]] || bin[a[i]] == bin[st[k-1]] ) ) )
{
st[k] = a[i];
used[ i ] = true;
rec( k + 1 );
used[ i ] = false;
}
}
}
void to_bin( int a )
{
int one = 0;
int A = a;
while( a > 0 )
{
one += ( a % 2 == 1);
a /= 2;
}
bin[ A ] = one;
}
void to_ter( int a )
{
int one = 0;
int A = a;
while( a > 0 )
{
one += ( a % 3 == 1);
a /= 3;
}
ter[ A ] = one;
}
main()
{
cin >> n;
for(int i = 1; i <= n; i++)cin >> a[i];
for(int i = 1; i <= n; i++)
{
to_bin( a[i] );
to_ter( a[i] );
}
rec(1);
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |