# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944487 | Zena_Hossam | Beautiful row (IZhO12_beauty) | C++14 | 3036 ms | 600 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 fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll double
#define ll long long
//#define ll1 long long
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
ll c=0,n;vector<vector<ll>>s;
void solve(vector<ll>v,ll k,ll o){vector<ll>e=v;e[k]=1;//cout<<k<<" ";
if(o==n-1){
c++;return;
}
for(ll i=0;i<s[k].sz;i++){
if(e[s[k][i]])continue;
solve(e,s[k][i],o+1);
}return;
}
int main()
{
// freopen("measurement.in","r",stdin);freopen("measurement.out","w",stdout);
ll T=1;
//cin>>T;ll oo=0;
while(T--)
{
cin>>n;
ll arr[n];s.resize(n+5);
for(ll i=0;i<n;i++){
cin>>arr[i];
}map<ll,ll>m,d;
for(ll i=0;i<n;i++){
ll a=arr[i];ll p=0;
while(a!=0){
if(a%2==1)p++;
a/=2;
}
m[i]=p;
ll b=arr[i];ll pp=0;
while(b!=0){
if(b%3==1)pp++;
b/=3;
}
d[i]=pp;
}
for(ll i=0;i<n;i++){
for(ll j=0;j<n;j++){if(i==j)continue;
if(m[i]==m[j]){s[i].push_back(j);//cout<<i<<" "<<j<<"k\n";
}
else if(d[i]==d[j]){s[i].push_back(j);//cout<<i<<" "<<j<<"k\n";
}
}
}vector<ll>r(n+9,0);
for(ll i=0;i<n;i++){
solve(r,i,0);//cout<<"\n";
}cout<<c;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |