제출 #946227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
946227		Zena_Hossam	Beautiful row (IZhO12_beauty)	C++14	0 / 100	0 ms	348 KiB

beauty

#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 int
#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,vis[100005];vector<vector<ll>>s;map<vector<ll>,map<ll,ll>>r;
ll solve(vector<ll>v,ll k,ll o){v[k]=1;//cout<<k<<" ";
if(r[v][o])return r[v][o];
if(o==n-1){
   return r[v][o]=1;;

}
for(ll i=0;i<s[k].sz;i++){

    if(v[s[k][i]])continue;
    r[v][o]+=solve(v,s[k][i],o+1);
}return r





[v][o];
}
int main()
{
    //freopen("stdin.in","r",stdin);freopen("stdout.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];
       }ll m[n+5]={};ll d[n+5]={};
       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++){
       c+=solve(r,i,0);//cout<<"\n";
       }cout<<c;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

beauty.cpp: In function 'long long int solve(std::vector<long long int>, long long int, long long int)':
beauty.cpp:19:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 | for(ll i=0;i<s[k].sz;i++){
      |             ^

• Subtask 1: 0 / 100