oj.uz

답안 #338531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338531 2020-12-23T10:26:47 Z beksultan04 아름다운 순열 (IZhO12_beauty) C++14
100 / 100
 2848 ms 172780 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define ll long long
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1048579,INF=1e9+7;
int q[50],tr[30],dv[30],g[50][50],n,asd;
ll dp[N][21];
inline void troich(int x,int &ans){
    while (x > 0){
        if (x%3==1)ans++;
        x /=3;
    }
}
inline void dvoich(int x,int &ans){
    while (x > 0){
        if (x%2==1)ans++;
        x = (x>>1);
    }
}

bool is(int &a,int &b){
    ret (tr[a] == tr[b] || dv[a] == dv[b]);
}

ll rec(int x,int j){
    if (x == asd)ret 1;
  	ll &res=dp[x][j];
    if (~res)
      ret res;res=0;
    int i;
    for (i=0;i<n;++i)
        if(!(x>>i&1) and g[i][j])
            res += rec(x|(1<<i),i);
    ret res;
}


main(){
  memset(dp,-1,sizeof dp);
    int i,j,s,cnt=1;
  cin>>n;
    for (i=0;i<n;++i){
      cin>>q[i];
        troich(q[i],tr[i]);
        dvoich(q[i],dv[i]);
    }
    asd=(1<<n)-1;
    for (i=0;i<n;++i){
        for (j=i+1;j<n;++j){
            if (is(i,j)){
                g[i][j]=1;
                g[j][i]=1;
            }
        }
    }
    ll ans=0;
    for (i=0;i<n;++i){
        ans+=rec((1<<i),i);
    }


    cout <<ans;




}

Compilation message

beauty.cpp:52:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main(){
      |      ^
beauty.cpp: In function 'int main()':
beauty.cpp:54:13: warning: unused variable 's' [-Wunused-variable]
   54 |     int i,j,s,cnt=1;
      |             ^
beauty.cpp:54:15: warning: unused variable 'cnt' [-Wunused-variable]
   54 |     int i,j,s,cnt=1;
      |               ^~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 172652 KB Output is correct
2 Correct 77 ms 172652 KB Output is correct
3 Correct 103 ms 172652 KB Output is correct
4 Correct 112 ms 172652 KB Output is correct
5 Correct 78 ms 172652 KB Output is correct
6 Correct 76 ms 172652 KB Output is correct
7 Correct 78 ms 172652 KB Output is correct
8 Correct 78 ms 172652 KB Output is correct
9 Correct 75 ms 172652 KB Output is correct
10 Correct 87 ms 172652 KB Output is correct
11 Correct 93 ms 172652 KB Output is correct
12 Correct 91 ms 172652 KB Output is correct
13 Correct 138 ms 172764 KB Output is correct
14 Correct 470 ms 172652 KB Output is correct
15 Correct 574 ms 172652 KB Output is correct
16 Correct 361 ms 172652 KB Output is correct
17 Correct 469 ms 172780 KB Output is correct
18 Correct 315 ms 172780 KB Output is correct
19 Correct 2614 ms 172748 KB Output is correct
20 Correct 2848 ms 172780 KB Output is correct