oj.uz

답안 #338479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338479 2020-12-23T09:08:00 Z beksultan04 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 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 = 1e6+11,INF=1e9+7;
int q[N],dp[N],tr[30],dv[30],vis[N],g[50][50],n;
int troich(int x){
    int ans=0;
    while (x > 0){
        if (x%3==1)ans++;
        x /=3;
    }
    ret ans;
}
int dvoich(int x){
    int ans=0;
    while (x > 0){
        if (x%2==1)ans++;
        x /=2;
    }
    ret ans;
}

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

int rec(int x,int j){
    if (x == (1<<n)-1)ret 1;
    if (vis[x]==1)ret dp[x];
    vis[x]=1;
    int ans=0,i;
    for (i=0;i<n;++i){
        if (i == j || (x&(1<<i)) || g[i][j] == 0)continue;
        ans += rec(x+(1<<i),i);
    }
    ret dp[x]=ans;
}


main(){
    int i,j,s,cnt=1;
    scan1(n)
    for (i=0;i<n;++i){
        scan1(q[i])
        tr[i]=troich(q[i]);
        dv[i]=dvoich(q[i]);
    }
    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;
            }
        }
    }
    int ans=0;
    for (i=0;i<n;++i){
        ans+=rec((1<<i),i);
    }


    cout <<ans;




}

Compilation message

beauty.cpp:55:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main(){
      |      ^
beauty.cpp: In function 'int main()':
beauty.cpp:56:13: warning: unused variable 's' [-Wunused-variable]
   56 |     int i,j,s,cnt=1;
      |             ^
beauty.cpp:56:15: warning: unused variable 'cnt' [-Wunused-variable]
   56 |     int i,j,s,cnt=1;
      |               ^~~
beauty.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
beauty.cpp:57:5: note: in expansion of macro 'scan1'
   57 |     scan1(n)
      |     ^~~~~
beauty.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
beauty.cpp:59:9: note: in expansion of macro 'scan1'
   59 |         scan1(q[i])
      |         ^~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -