oj.uz

Submission #857555

# Submission time Handle Problem Language Result Execution time Memory
857555 2023-10-06T11:46:20 Z Mohamed_Kachef06 Beautiful row (IZhO12_beauty) C++17
0 / 100
 3000 ms 164700 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define A first
#define B second

int n ,  a[20] , dp[20][1<<20] , co[20][20]; 

int fact(int i , int b){
    int x = a[i];
    int ans =0 ;
    while(x > 0){
        if (x%b == 1) ans++;
        x/=b;
    }
    return ans;
}

void pre(){
    for (int i = 0 ; i < n ; i++) {
        for (int j = 0 ; j < i ; j++){
            int a = fact(i ,2), b = fact(i , 3) , c = fact(j ,2 ) , d= fact(j , 3);
            if (a == c || b == d)  { co[i][j] = 1; co[j][i] = 1;}
        }
    }
}

int brute(int last , int mask){
    if ( mask == (1<<n) - 1) return 1;
    if (~dp[last][mask]) return dp[last][mask];
    int ans = 0 ;
    for (int i = 0 ; i < n ; i++){
        if (!(mask & (1<<i))){
          if (mask == 0 || co[last][i]) ans += brute(i , (mask | (1<<i)));
        }
    }
    return dp[last][mask] =  ans;
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 0 ; i < n ; i++) cin >> a[i];
    memset(dp , -1 , sizeof dp);
    pre();
    cout << brute(0 , 0); 
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 164444 KB Output is correct
2 Correct 19 ms 164484 KB Output is correct
3 Correct 19 ms 164444 KB Output is correct
4 Correct 19 ms 164444 KB Output is correct
5 Correct 19 ms 164444 KB Output is correct
6 Correct 18 ms 164444 KB Output is correct
7 Correct 18 ms 164444 KB Output is correct
8 Correct 21 ms 164616 KB Output is correct
9 Correct 18 ms 164444 KB Output is correct
10 Correct 20 ms 164440 KB Output is correct
11 Correct 27 ms 164452 KB Output is correct
12 Correct 28 ms 164440 KB Output is correct
13 Correct 62 ms 164700 KB Output is correct
14 Correct 338 ms 164592 KB Output is correct
15 Correct 384 ms 164588 KB Output is correct
16 Correct 247 ms 164696 KB Output is correct
17 Correct 354 ms 164592 KB Output is correct
18 Correct 223 ms 164592 KB Output is correct
19 Correct 2584 ms 164588 KB Output is correct
20 Execution timed out 3046 ms 164440 KB Time limit exceeded
21 Halted 0 ms 0 KB -