oj.uz

답안 #338491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338491 2020-12-23T09:33:24 Z beksultan04 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 3000 ms 172908 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[N],tr[30],dv[30],g[50][50],n;
ll dp[N][21];
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]);
}
 
ll rec(int x,int j){
    if (x == (1<<n)-1)ret 1;
    if (dp[x][j]!=-1)ret dp[x][j];
    ll ans=0;
    int 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][j]=ans;
}
 
 
main(){
  memset(dp,-1,sizeof dp);
    int i,j,s,cnt=1;
  cin>>n;
    for (i=0;i<n;++i){
      cin>>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;
            }
        }
    }
    ll ans=0;
    for (i=0;i<n;++i){
        ans+=rec((1<<i),i);
    }
 
 
    cout <<ans;
 
 
 
 
}

Compilation message

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

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 172780 KB Output is correct
2 Correct 82 ms 172800 KB Output is correct
3 Correct 83 ms 172644 KB Output is correct
4 Correct 85 ms 172780 KB Output is correct
5 Correct 84 ms 172652 KB Output is correct
6 Correct 85 ms 172652 KB Output is correct
7 Correct 82 ms 172652 KB Output is correct
8 Correct 83 ms 172652 KB Output is correct
9 Correct 83 ms 172652 KB Output is correct
10 Correct 85 ms 172652 KB Output is correct
11 Correct 97 ms 172780 KB Output is correct
12 Correct 91 ms 172652 KB Output is correct
13 Correct 156 ms 172652 KB Output is correct
14 Correct 517 ms 172780 KB Output is correct
15 Correct 592 ms 172800 KB Output is correct
16 Correct 422 ms 172780 KB Output is correct
17 Correct 537 ms 172756 KB Output is correct
18 Correct 359 ms 172652 KB Output is correct
19 Execution timed out 3028 ms 172908 KB Time limit exceeded
20 Halted 0 ms 0 KB -