제출 #758873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
758873		Charizard2021	아름다운 순열 (IZhO12_beauty)	C++17	0 / 100	277 ms	262144 KiB

beauty

#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;
}
void backtrack(vector<long long>& nums, vector<long long>& curr, vector<vector<long long> >& ans, vector<bool>& visited){
    if ((long long)curr.size() == (long long)nums.size()) {
        ans.push_back(curr);
    }
    for (long long i = 0; i < (long long)nums.size(); i++) {
        if (visited[i]){
            continue;
        }
        if (i > 0 and nums[i] == nums[i - 1] && !visited[i - 1]){
            continue;
        }
        visited[i] = true;
        curr.push_back(nums[i]);
        backtrack(nums, curr, ans, visited);
        visited[i] = false;
        curr.pop_back();
    }
}
vector<vector<long long> > permuteDuplicates(vector<long long>& nums){
    sort(nums.begin(), nums.end());
    vector<vector<long long> > ans;
    vector<bool> visited((long long)nums.size(), false);
    vector<long long> curr;
    backtrack(nums, curr, ans, visited);
    return ans;
}
int main(){
	IOS;
    long long n;
    cin >> n;
    vector<long long> v(n);
    cin >> v;
    sort(v.begin(), v.end());
    vector<vector<long long> > ans = permuteDuplicates(v);
    // cout << ans << "\n";
    long long ans2 = 0;
    for(int i = 0; i < (int)ans.size(); i++){
        bool works = true;
        if(i == 0){
            for(long long j = 0; j < n - 1; j++){
                if(__builtin_popcount(ans[i][j]) != __builtin_popcount(ans[i][j + 1])){
                    long long x3 = 0;
                    long long x4 = 0;
                    if(convertToTernary(ans[i][j], x3) != convertToTernary(ans[i][j + 1], x4)){
                        works = false;
                        break;
                    }
                }
            }
        }
        else{
            for(long long j = 0; j < (int)ans[i].size() - 1; j++){
                if(__builtin_popcount(ans[i][j]) != __builtin_popcount(ans[i][j + 1])){
                    long long x3 = 0;
                    long long x4 = 0;
                    if(convertToTernary(ans[i][j], x3) != convertToTernary(ans[i][j + 1], x4)){
                        works = false;
                        break;
                    }
                }
            }
        }
        if(works){
            ans2++;
        }
    }
    cout << ans2 << "\n";
}

• Subtask 1: 0 / 100