oj.uz

답안 #685720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
685720 2023-01-24T22:05:28 Z Summers 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 98 ms 189084 KB 
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
int a[100], b[100], dp[(1<<21)][23], n;

int rec(int mask, int last)
{
    if(mask==((1<<n)-1)) return 1;

    if(last!=-1 && dp[mask][last]!=-1)return dp[mask][last];
    int an=0;
    for(int i=0;i<n;i++)
    {
        if(!(mask&(1<<i)))
        {
            if(last==-1 || a[last]==a[i] || b[last]==b[i])
            {
                an+=rec(mask|(1<<i), i);
            }
        }
    }
    return dp[mask][last]=an;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int i,j,t,p,p1, ans=0;

    cin>>n;

    for(i=0;i<n;i++)
    {
        cin>>p;
        a[i]=__builtin_popcount(p);
        p1=p;
        while(p1>0)
        {
            if(p1%3==1)b[i]++;
            p1/=3;
        }

    }
    memset(dp,-1,sizeof(dp));
    ans+=rec(0,-1);

    cout<<ans<<endl;


}

Compilation message

beauty.cpp: In function 'int main()':
beauty.cpp:31:11: warning: unused variable 'j' [-Wunused-variable]
   31 |     int i,j,t,p,p1, ans=0;
      |           ^
beauty.cpp:31:13: warning: unused variable 't' [-Wunused-variable]
   31 |     int i,j,t,p,p1, ans=0;
      |             ^

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 189004 KB Output is correct
2 Correct 79 ms 189028 KB Output is correct
3 Correct 78 ms 188972 KB Output is correct
4 Correct 75 ms 189052 KB Output is correct
5 Correct 72 ms 189000 KB Output is correct
6 Correct 71 ms 189052 KB Output is correct
7 Correct 70 ms 188968 KB Output is correct
8 Correct 70 ms 189060 KB Output is correct
9 Correct 82 ms 189016 KB Output is correct
10 Correct 85 ms 188984 KB Output is correct
11 Incorrect 98 ms 189084 KB Output isn't correct
12 Halted 0 ms 0 KB -