oj.uz

답안 #338355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338355 2020-12-23T03:50:30 Z talant117408 아름다운 순열 (IZhO12_beauty) C++17
0 / 100
 3000 ms 384 KB 
/*
    Code written by Talant I.D.
*/
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int used[23], n;
ll ans;
vector <set <int>> graph(23);
set <int> st;

void dfs(int v){
    used[v] = 1;
    for(auto to : graph[v]){
        if(!used[to]){
            dfs(to);
        }
    }
    used[v] = 2;
}

void dfs2(int v){
    st.insert(v);
    if(sz(st) == n) ans++;
    for(auto to : graph[v]){
        if(!binary_search(all(st), to)){
            dfs2(to);
        }
    }
    st.erase(st.find(v));
}

int main(){
    do_not_disturb
    
    cin >> n;
    vector <ll> v(n), bin(n), tern(n);
    for(auto &to : v) cin >> to;
    clock_t start = clock();
    
    for(int i = 0; i < n; i++){
        int to = v[i];
        for(int bit = 30; bit >= 0; bit--)
            if(to&(1<<bit)) bin[i]++;
        for(int bit = 30; bit >= 0; bit--){
            if(to/(ll)pow(3ll, bit) == 1) tern[i]++;
            to %= (ll)pow(3ll, bit);
        }
    }
    
    for(int i = 0; i < n; i++){
        for(int j = i+1; j < n; j++){
            if(bin[i] == bin[j] || tern[i] == tern[j]){
                graph[i].insert(j);
                graph[j].insert(i);
            }
        }
    }
    
    dfs(0);
    for(int i = 0; i < n; i++){
        if(!used[i]){
            cout << 0;
            return 0;
        }
        used[i] = 0;
    }
    
    vector <int> leaves;
    for(int i = 0; i < n; i++){
        if(sz(graph[i]) == 1){
            leaves.pb(i);
        }
    }
    
    
    for(int i = 0; i < n; i++){
        dfs2(i);
    }
    
    cout << ans << endl;
    
    return 0;
}

Compilation message

beauty.cpp: In function 'int main()':
beauty.cpp:133:13: warning: unused variable 'start' [-Wunused-variable]
  133 |     clock_t start = clock();
      |             ^~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 38 ms 364 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Execution timed out 3063 ms 364 KB Time limit exceeded
9 Halted 0 ms 0 KB -