#979427 (C++14) No.2732 Similar Permutations

• 問題: No.2732 Similar Permutations
• ユーザー: au7777
• 提出日時: 2024-05-07 00:16:21
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 124 ms / 2,000 ms
• コード長: 4,982 bytes
• コンパイル時間: 4,931 ms
• コンパイル使用メモリ: 250,324 KB
• 実行使用メモリ: 6,000 KB
• 最終ジャッジ日時: 2024-05-07 00:16:46
• 合計ジャッジ時間: 23,898 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	32 ms; 5,376 KB
testcase_03	AC	81 ms; 5,376 KB
testcase_04	AC	20 ms; 5,376 KB
testcase_05	AC	16 ms; 5,376 KB
testcase_06	AC	10 ms; 5,376 KB
testcase_07	AC	44 ms; 5,376 KB
testcase_08	AC	23 ms; 5,376 KB
testcase_09	AC	13 ms; 5,376 KB
testcase_10	AC	102 ms; 5,700 KB
testcase_11	AC	9 ms; 5,376 KB
testcase_12	AC	104 ms; 5,736 KB
testcase_13	AC	103 ms; 5,868 KB
testcase_14	AC	104 ms; 5,872 KB
testcase_15	AC	106 ms; 5,996 KB
testcase_16	AC	74 ms; 5,376 KB
testcase_17	AC	74 ms; 5,376 KB
testcase_18	AC	96 ms; 5,612 KB
testcase_19	AC	103 ms; 5,788 KB
testcase_20	AC	101 ms; 5,844 KB
testcase_21	AC	105 ms; 6,000 KB
testcase_22	AC	60 ms; 5,376 KB
testcase_23	AC	103 ms; 5,872 KB
testcase_24	AC	62 ms; 5,376 KB
testcase_25	AC	103 ms; 5,996 KB
testcase_26	AC	85 ms; 5,376 KB
testcase_27	AC	103 ms; 5,908 KB
testcase_28	AC	80 ms; 5,392 KB
testcase_29	AC	103 ms; 5,996 KB
testcase_30	AC	75 ms; 5,376 KB
testcase_31	AC	124 ms; 5,872 KB
testcase_32	AC	95 ms; 5,752 KB
testcase_33	AC	102 ms; 6,000 KB
testcase_34	AC	68 ms; 5,376 KB
testcase_35	AC	103 ms; 5,868 KB
testcase_36	AC	95 ms; 5,624 KB
testcase_37	AC	102 ms; 5,996 KB
testcase_38	AC	89 ms; 5,532 KB
testcase_39	AC	102 ms; 5,996 KB
testcase_40	AC	84 ms; 5,476 KB
testcase_41	AC	102 ms; 5,740 KB
testcase_42	AC	77 ms; 5,376 KB
testcase_43	AC	102 ms; 5,996 KB
testcase_44	AC	54 ms; 5,376 KB
testcase_45	AC	98 ms; 6,000 KB
testcase_46	AC	92 ms; 5,588 KB
testcase_47	AC	100 ms; 5,868 KB
testcase_48	AC	64 ms; 5,376 KB
testcase_49	AC	99 ms; 5,868 KB
testcase_50	AC	60 ms; 5,376 KB
testcase_51	AC	92 ms; 5,848 KB
testcase_52	AC	78 ms; 5,636 KB
testcase_53	AC	102 ms; 5,816 KB
testcase_54	AC	124 ms; 5,996 KB
testcase_55	AC	103 ms; 5,852 KB
testcase_56	AC	104 ms; 5,996 KB
testcase_57	AC	54 ms; 5,376 KB
testcase_58	AC	72 ms; 5,376 KB
testcase_59	AC	68 ms; 5,376 KB
testcase_60	AC	58 ms; 5,376 KB
testcase_61	AC	53 ms; 5,376 KB
testcase_62	AC	84 ms; 5,464 KB
testcase_63	AC	2 ms; 5,376 KB
testcase_64	AC	2 ms; 5,376 KB
testcase_65	AC	2 ms; 5,376 KB
testcase_66	AC	2 ms; 5,376 KB
testcase_67	AC	2 ms; 5,376 KB
testcase_68	AC	2 ms; 5,376 KB
testcase_69	AC	2 ms; 5,376 KB
testcase_70	AC	2 ms; 5,376 KB
testcase_71	AC	2 ms; 5,376 KB
testcase_72	AC	2 ms; 5,376 KB
testcase_73	AC	2 ms; 5,376 KB
testcase_74	AC	2 ms; 5,376 KB
testcase_75	AC	2 ms; 5,376 KB
testcase_76	AC	2 ms; 5,376 KB
testcase_77	AC	2 ms; 5,376 KB
testcase_78	AC	1 ms; 5,376 KB
testcase_79	AC	2 ms; 5,376 KB
testcase_80	AC	2 ms; 5,376 KB
testcase_81	AC	2 ms; 5,376 KB
testcase_82	AC	1 ms; 5,376 KB
testcase_83	AC	2 ms; 5,376 KB
testcase_84	AC	1 ms; 5,376 KB
testcase_85	AC	2 ms; 5,376 KB
testcase_86	AC	2 ms; 5,376 KB
testcase_87	AC	2 ms; 5,376 KB
testcase_88	AC	2 ms; 5,376 KB
testcase_89	AC	2 ms; 5,376 KB
testcase_90	AC	2 ms; 5,376 KB
testcase_91	AC	2 ms; 5,376 KB
testcase_92	AC	2 ms; 5,376 KB
testcase_93	AC	2 ms; 5,376 KB
testcase_94	AC	2 ms; 5,376 KB
testcase_95	AC	2 ms; 5,376 KB
testcase_96	AC	2 ms; 5,376 KB
testcase_97	AC	2 ms; 5,376 KB
testcase_98	AC	2 ms; 5,376 KB
testcase_99	AC	2 ms; 5,376 KB
testcase_100	AC	2 ms; 5,376 KB
testcase_101	AC	1 ms; 5,376 KB
testcase_102	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif

#pragma region //使いがち
const int MAX = 2000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    // 
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll num, ll arity) {
    ll ret = 0;
    while (num) {
        num /= arity;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
void compress(vector<ll>& v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
}

// N以下の素数を全て返す
vector<ll> Eratosthenes( const ll N )
{
    vector<bool> is_prime( N + 1 );
    for( ll i = 0; i <= N; i++ )
    {
        is_prime[ i ] = true;
    }
    vector<ll> P;
    for( ll i = 2; i <= N; i++ )
    {
        if( is_prime[ i ] )
        {
            for( ll j = 2 * i; j <= N; j += i )
            {
                is_prime[ j ] = false;
            }
            P.emplace_back( i );
        }
    }
    return P;
}

vector<pair<ll, ll> > prime_factorize(ll N) {
    vector<pair<ll, ll> > res;
    for (ll a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        ll ex = 0; // 指数

        // 割れる限り割り続ける
        while (N % a == 0) {
            ++ex;
            N /= a;
        }

        // その結果を push
        res.push_back({a, ex});
    }

    // 最後に残った数について
    if (N != 1) res.push_back({N, 1});
    return res;
}
#pragma endregion


int xor_sum = 0;

// next_permutationを求める
// ついでにaとのxorも更新
void next_permutation(vector<int>& v, vector<int>& a) {
    int n = v.size();
    int i = n - 1;
    while (i > 0 && v[i - 1] >= v[i]) {
        i--;
    }
    if (i == 0) {
        for (int j = 0; j < n; j++) {
            v[j] = j + 1;
        }
        return ;
    }
    int j = n - 1;
    while (v[j] <= v[i - 1]) {
        j--;
    }
    xor_sum ^= (a[i - 1] + v[i - 1]);
    xor_sum ^= (a[j] + v[j]);
    xor_sum ^= (a[i - 1] + v[j]);
    xor_sum ^= (a[j] + v[i - 1]);
    swap(v[i - 1], v[j]);
    j = n - 1;
    while (i < j) {
        xor_sum ^= (a[i] + v[i]);
        xor_sum ^= (a[j] + v[j]);
        xor_sum ^= (a[i] + v[j]);
        xor_sum ^= (a[j] + v[i]);
        swap(v[i], v[j]);
        i++;
        j--;
    }
}


// i番目のpermutationを出力
void output(int i, int n, vector<int>& a) {
    vector<int> v(n);
    for (int j = 0; j < n; j++) {
        v[j] = j + 1;
    }
    for (int j = 0; j < i; j++) {
        next_permutation(v, a);
    }
    for (int j = 0; j < n; j++) {
        cout << v[j] << " ";
    }
    cout << '\n';
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        v[i] = i + 1;
        xor_sum ^= (a[i] + v[i]);
    }
    map<int, int> mp;
    int M = 800000;
    int xx = 1;
    for (int i = 1; i <= n; i++) {
        if (xx * i >= M) break;
        xx *= i;
    }
    M = min(M, xx);
    for (int i = 0; i < xx; i++) {
        if (mp.find(xor_sum) != mp.end()) {
            int id1 = i;
            int id2 = mp[xor_sum];
            cerr << id1 << " " << id2 << '\n';
            output(id1, n, a);
            output(id2, n, a);
            exit(0);
        }
        mp[xor_sum] = i;
        next_permutation(v, a);
    }
    cout << -1 << '\n';
    return 0;
}