oj.uz

답안 #502130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502130 2022-01-05T10:47:36 Z khangal 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 3000 ms 234368 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long, long long > pl;
const int N = 1e6 + 1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
//typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
template< typename T>
using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n, m, ans, mid, mn, mx, cnt, sum, h1, h2, arr[3234567],arr1[1234567], sz, k, i, j, h, a, w, x, y, z,par[1234567];
bool used[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
vector<ll> edge[1234567];
ll jump[22][223456];
ll lvl[1234567];
//ll bit[1234567];
//ll timer;
//ll st[1234567],endd[1234567];
//ll dp[5005][5005];
ll power(ll base, ll val, ll mod) {
    ll res = 1;
    while (val) {
        if (val % 2 == 1) {
            res = res * base;
        }
        base = base * base;
        base %= mod;
        res %= mod;
        val /= 2;
    }
    return res;
}
bool comp(pl x,pl y){
    if(x.ff>y.ff)return true;
    return false;
}
ll find(ll x){
    if(x==par[x])return x;
    else return par[x]=find(par[x]);
}
void process_LCA(){
    for(int i=1;(1<<i)<=n;i++){
        for(int j=1;j<=n;j++){
            jump[i][j] = jump[i-1][jump[i-1][j]];
        }
    }
}
ll LCA(ll x,ll y){
    if(lvl[x] < lvl[y])swap(x,y);
    ll diss = lvl[x] - lvl[y];
    for(int i=21;i>=0;i--){
        if((1<<i)&diss){
            x = jump[i][x];
        }
    }
    if(x==y)return x;
    for(int i=21;i>=0;i--){
        if(jump[i][x] != jump[i][y]){
            x = jump[i][x];
            y = jump[i][y];
        }
    }
    return jump[0][x];
}
bool check(ll x,ll y){
    //cout<<x<<" "<<y<<'\n';
    ll res1=0,res2=0;
    if(__builtin_popcount(x) == __builtin_popcount(y))return true;
    while(x){
        if(x%3==1)res1++;
        x/=3;
    }
    while(y){
        if(y%3==1)res2++;
        y/=3;
    }
    if(res1==res2)return true;
    else return false;
}
ll dp[1<<20][25];
class A {
public:
    static void funcA() {
        cin>>n;
        for(int i=0;i<n;i++){
            cin>>arr[i];
            dp[(1<<i)][i]=1;
        }
        for(int i=0;i<(1<<n);i++){
            for(int j=0;j<n;j++){
                for(int k=0;k<n;k++){
                    if(!((1<<j)&i) && check(arr[j],arr[k])==true){
                        dp[(1<<j)|i][j] += dp[i][k];
                    }
                }
            }
        }
        for(int i=0;i<n;i++)ans+=dp[(1<<n)-1][i];
        cout<<ans;
    }
}lol;
void solve() {
    A::funcA();
}
int main() {
    ll T = 1;
    //cin>>T;
    boost;
    while (T--) {
        solve();
    }
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 29260 KB Output is correct
2 Correct 14 ms 29304 KB Output is correct
3 Correct 16 ms 29312 KB Output is correct
4 Correct 13 ms 29260 KB Output is correct
5 Correct 14 ms 29260 KB Output is correct
6 Correct 14 ms 29388 KB Output is correct
7 Correct 15 ms 29516 KB Output is correct
8 Correct 15 ms 29512 KB Output is correct
9 Correct 15 ms 29496 KB Output is correct
10 Correct 15 ms 29388 KB Output is correct
11 Correct 41 ms 32416 KB Output is correct
12 Correct 43 ms 32452 KB Output is correct
13 Correct 158 ms 41996 KB Output is correct
14 Correct 925 ms 80516 KB Output is correct
15 Correct 409 ms 80664 KB Output is correct
16 Correct 1199 ms 80612 KB Output is correct
17 Correct 1111 ms 80668 KB Output is correct
18 Correct 1426 ms 80664 KB Output is correct
19 Execution timed out 3088 ms 234368 KB Time limit exceeded
20 Halted 0 ms 0 KB -