oj.uz

답안 #759579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759579 2023-06-16T12:35:44 Z Charizard2021 아름다운 순열 (IZhO12_beauty) C++17
100 / 100
 912 ms 205516 KB 
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
void selfMax(long long& a, long long b){
    a = max(a, b);
}
void selfMin(long long& a, long long b){
    a = min(a, b);
}
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}

template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};

/*

Use DSU dsu(N);

*/
struct DSU {
	vector<long long> e;
	DSU(long long N) { e = vector<long long>(N, -1); }

	// get representive component (uses path compression)
	long long get(long long x) { return e[x] < 0 ? x : e[x] = get(e[x]); }

	bool same_set(long long a, long long b) { return get(a) == get(b); }

	long long size(long long x) { return -e[get(x)]; }

	bool unite(long long x, long long y) {  // union by size
		x = get(x), y = get(y);
		if (x == y) return false;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y]; e[y] = x;
		return true;
	}
};
/*

Run with Bit<long long> BIT

*/
template <class T> class BIT {
    private:
        long long size;
        vector<T> bit;
        vector<T> arr;
    public:
        BIT(long long size) : size(size), bit(size + 1), arr(size) {}
        void set(long long ind, long long val) { add(ind, val - arr[ind]); }
        void add(long long ind, long long val) {
            arr[ind] += val;
            ind++;
            for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
        }
        T pref_sum(long long ind) {
            ind++;
            T total = 0;
            for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
            return total;
        }
};
/*

Change Comb for specific Seg tree probs, but run with Seg<long long> Seg;

*/
template<class T> struct Seg {
	const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
	long long n; vector<T> seg;
	void init(long long _n) { n = _n; seg.assign(2*n,ID); }
	void pull(long long p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
	void upd(long long p, T val) {
		seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
	T query(long long l, long long r) {
		T ra = ID, rb = ID;
		for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
			if (l&1) ra = comb(ra,seg[l++]);
			if (r&1) rb = comb(seg[--r],rb);
		}
		return comb(ra,rb);
	}
};
long long convertToTernary(long long N, long long &count1){
    if (N == 0){
        return count1;
    }
    long long x = N % 3;
    N /= 3;
    if (x < 0){
        N += 1;
    }
    convertToTernary(N, count1);
    if (x < 0){
        if(x + (3 * -1) == 1){
            count1++;
        }
    }
    else{
        if(x == 1){
            count1++;
        }
    }
    return count1;
}
int main(){
    IOS;
    long long n;
    cin >> n;
    vector<long long> v(n);
    cin >> v;
    vector<vector<bool> > nextTo(n, vector<bool>(n, true));
    for(long long i = 0; i < n; i++){
        for(long long j = 0; j < n; j++){
            long long x = 0;
            long long x2 = 0;
            if(convertToTernary(v[i], x) != convertToTernary(v[j], x2) && __builtin_popcount(v[i]) != __builtin_popcount(v[j])){
                nextTo[i][j] = false;
            }
        }
    }
    vector<vector<long long> > dp((1 << n), vector<long long>(n, 0));
    for(long long i = 0; i < n; i++){
        dp[(1 << i)][i] = 1;
    }
    for(long long i = 0; i < (1 << n); i++){
        for(long long j = 0; j < n; j++){
            if(i & (1 << j)){
                for(long long k = 0; k < n; k++){
                    if(!(i & (1 << k)) && nextTo[j][k] && k != j){
                        dp[i ^ (1 << k)][k] += dp[i][j];
                    }
                }
            }
        }
    }
    long long ans = 0;
    for(long long i = 0; i < n; i++){
        ans += dp[(1 << n) - 1][i];
        // cout << dp[(1 << n) - 1][i] << " ";
    }
    // cout << "\n";
    cout << ans << "\n";
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 2772 KB Output is correct
12 Correct 8 ms 2644 KB Output is correct
13 Correct 34 ms 11092 KB Output is correct
14 Correct 182 ms 47512 KB Output is correct
15 Correct 180 ms 47512 KB Output is correct
16 Correct 206 ms 47452 KB Output is correct
17 Correct 187 ms 47508 KB Output is correct
18 Correct 198 ms 47512 KB Output is correct
19 Correct 912 ms 205496 KB Output is correct
20 Correct 808 ms 205516 KB Output is correct