Submission #944488

#TimeUsernameProblemLanguageResultExecution timeMemory
944488Zena_HossamBeautiful row (IZhO12_beauty)C++14
0 / 100
3088 ms600 KiB
#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 int //#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;fi //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=i+1;j<n;j++){if(i==j)continue; if(m[i]==m[j]){s[i].push_back(j);//cout<<i<<" "<<j<<"k\n"; s[j].push_back(i);} else if(d[i]==d[j]){s[i].push_back(j);//cout<<i<<" "<<j<<"k\n"; s[j].push_back(i); } } }vector<ll>r(n+9,0); for(ll i=0;i<n;i++){ solve(r,i,0);//cout<<"\n"; }cout<<c; } }

Compilation message (stderr)

beauty.cpp:5: warning: "ll" redefined
    5 | #define ll int
      | 
beauty.cpp:4: note: this is the location of the previous definition
    4 | #define ll double
      | 
beauty.cpp: In function 'void solve(std::vector<int>, int, int)':
beauty.cpp:18:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | for(ll i=0;i<s[k].sz;i++){
      |             ^
#Verdict Execution timeMemoryGrader output
Fetching results...