oj.uz

답안 #1011382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011382 2024-06-30T12:49:41 Z AndrijaM 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 6 ms 1344 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=500;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    int x[n+1];
    int b[n+1];
    int t[n+1];
    memset(t,0,sizeof t);
    for(int i=0;i<n;i++)
    {
        cin>>x[i];
        b[i]=__builtin_popcount(x[i]);
        vector<int>v;
        int num=x[i];
        while(num>0)
        {
            int val=num%3;
            num/=3;
            v.push_back(val);
        }
        for(int idx=0;idx<v.size();idx++)
        {
            if(v[idx]==1)
            t[i]++;
        }
    }
    int dp[n][(1<<n)];
    memset(dp,0,sizeof dp);
    for(int i=0;i<n;i++)
    {
        for(int k=0;(1<<k)<(1<<n);k++)
        {
            dp[i][(1<<k)]=1;
        }
    }
    for(int i=1;i<(1<<n);i++)
    {
        for(int prev=0;prev<n;prev++)
        {
            if(i&(1<<prev))
            {
                for(int bit=0;bit<n;bit++)
                {
                    if(i&(1<<bit))
                    {

                    }
                    else
                    {
                        int M=i;
                        M|=(1<<bit);
                        if(b[prev]==b[bit] || t[prev]==t[bit])
                        dp[bit][M]+=dp[prev][i];
                    }
                }
            }
        }
    }
    int ans=0;
    for(int i=0;i<n;i++)
    {
        ans+=dp[i][(1<<n)-1];
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

beauty.cpp: In function 'int main()':
beauty.cpp:32:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for(int idx=0;idx<v.size();idx++)
      |                       ~~~^~~~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 6 ms 1344 KB Output isn't correct
12 Halted 0 ms 0 KB -