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

• 問題: No.2732 Similar Permutations
• ユーザー: ATM
• 提出日時: 2024-04-19 22:37:00
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 102 ms / 2,000 ms
• コード長: 2,795 bytes
• コンパイル時間: 2,063 ms
• コンパイル使用メモリ: 178,728 KB
• 実行使用メモリ: 10,112 KB
• 最終ジャッジ日時: 2024-04-19 22:37:29
• 合計ジャッジ時間: 18,210 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	29 ms; 5,376 KB
testcase_03	AC	53 ms; 5,888 KB
testcase_04	AC	16 ms; 5,376 KB
testcase_05	AC	13 ms; 5,376 KB
testcase_06	AC	6 ms; 5,376 KB
testcase_07	AC	40 ms; 6,016 KB
testcase_08	AC	20 ms; 5,376 KB
testcase_09	AC	10 ms; 5,376 KB
testcase_10	AC	96 ms; 10,112 KB
testcase_11	AC	8 ms; 5,376 KB
testcase_12	AC	92 ms; 7,168 KB
testcase_13	AC	94 ms; 7,168 KB
testcase_14	AC	96 ms; 7,168 KB
testcase_15	AC	95 ms; 7,296 KB
testcase_16	AC	69 ms; 6,656 KB
testcase_17	AC	69 ms; 6,656 KB
testcase_18	AC	95 ms; 7,680 KB
testcase_19	AC	97 ms; 7,040 KB
testcase_20	AC	96 ms; 7,808 KB
testcase_21	AC	97 ms; 7,296 KB
testcase_22	AC	54 ms; 5,504 KB
testcase_23	AC	98 ms; 7,936 KB
testcase_24	AC	55 ms; 5,504 KB
testcase_25	AC	97 ms; 7,936 KB
testcase_26	AC	81 ms; 6,400 KB
testcase_27	AC	96 ms; 7,936 KB
testcase_28	AC	78 ms; 6,272 KB
testcase_29	AC	102 ms; 7,936 KB
testcase_30	AC	71 ms; 6,144 KB
testcase_31	AC	96 ms; 7,296 KB
testcase_32	AC	87 ms; 6,784 KB
testcase_33	AC	97 ms; 7,040 KB
testcase_34	AC	64 ms; 5,888 KB
testcase_35	AC	97 ms; 7,168 KB
testcase_36	AC	89 ms; 6,784 KB
testcase_37	AC	94 ms; 7,168 KB
testcase_38	AC	82 ms; 6,784 KB
testcase_39	AC	96 ms; 7,296 KB
testcase_40	AC	79 ms; 6,528 KB
testcase_41	AC	96 ms; 7,168 KB
testcase_42	AC	74 ms; 6,144 KB
testcase_43	AC	95 ms; 7,296 KB
testcase_44	AC	52 ms; 5,376 KB
testcase_45	AC	94 ms; 7,168 KB
testcase_46	AC	85 ms; 6,656 KB
testcase_47	AC	94 ms; 7,168 KB
testcase_48	AC	58 ms; 5,632 KB
testcase_49	AC	93 ms; 7,168 KB
testcase_50	AC	55 ms; 5,632 KB
testcase_51	AC	87 ms; 7,168 KB
testcase_52	AC	76 ms; 6,528 KB
testcase_53	AC	99 ms; 8,704 KB
testcase_54	AC	95 ms; 8,064 KB
testcase_55	AC	97 ms; 7,168 KB
testcase_56	AC	96 ms; 7,168 KB
testcase_57	AC	52 ms; 6,528 KB
testcase_58	AC	69 ms; 7,680 KB
testcase_59	AC	69 ms; 6,940 KB
testcase_60	AC	57 ms; 6,272 KB
testcase_61	AC	48 ms; 5,376 KB
testcase_62	AC	81 ms; 7,808 KB
testcase_63	AC	2 ms; 5,376 KB
testcase_64	AC	1 ms; 5,376 KB
testcase_65	AC	2 ms; 5,376 KB
testcase_66	AC	1 ms; 5,376 KB
testcase_67	AC	1 ms; 5,376 KB
testcase_68	AC	1 ms; 5,376 KB
testcase_69	AC	1 ms; 5,376 KB
testcase_70	AC	2 ms; 5,376 KB
testcase_71	AC	2 ms; 5,376 KB
testcase_72	AC	1 ms; 5,376 KB
testcase_73	AC	1 ms; 5,376 KB
testcase_74	AC	1 ms; 5,376 KB
testcase_75	AC	2 ms; 5,376 KB
testcase_76	AC	2 ms; 5,376 KB
testcase_77	AC	1 ms; 5,376 KB
testcase_78	AC	2 ms; 5,376 KB
testcase_79	AC	2 ms; 5,376 KB
testcase_80	AC	2 ms; 5,376 KB
testcase_81	AC	1 ms; 5,376 KB
testcase_82	AC	2 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	3 ms; 5,376 KB
testcase_87	AC	1 ms; 5,376 KB
testcase_88	AC	1 ms; 5,376 KB
testcase_89	AC	2 ms; 5,376 KB
testcase_90	AC	1 ms; 5,376 KB
testcase_91	AC	1 ms; 5,376 KB
testcase_92	AC	1 ms; 5,376 KB
testcase_93	AC	2 ms; 5,376 KB
testcase_94	AC	1 ms; 5,376 KB
testcase_95	AC	2 ms; 5,376 KB
testcase_96	AC	1 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>
using namespace std;

#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y

#define ASSERT(expr...) assert((expr))

using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;

using f32 = float;
using f64 = double;
// }}}

constexpr i64 INF = 1'010'000'000'000'000'017LL;

constexpr i64 MOD = 998244353LL;

constexpr f64 EPS = 1e-12;

constexpr f64 PI = 3.14159265358979323846;

#define M5 100007
#define M9 1000000000

#define F first
#define S second

// util {{{
#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)

#define all(x) (x).begin(), (x).end()
#define ll long long int
#define VI vector<ll>
#define VVI vector<VI>

#define ISD true
#define debug(x) \
    if (ISD)     \
    cout << #x << ": " << x << endl

template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {})
{
    if (comp(xmax, x))
    {
        xmax = x;
        return true;
    }
    return false;
}

template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {})
{
    if (comp(x, xmin))
    {
        xmin = x;
        return true;
    }
    return false;
}

vector<int> permutation;
vector<bool> used; // 追加した
bool isF;
vector<ll> A;
int c = 0;
map<int, int> M;

void dfs(int depth, int size, int min, int max, int ans)
{
    if (isF)
    {
        return;
    }
    if (depth == size)
    {
    }
    else
    {
        for (int i = min; i <= max; i++)
        {
            // i が使用済みの値かどうかを判定
            if (!used[i])
            {
                permutation[depth] = i;
                used[i] = true;
                dfs(depth + 1, size, min, max, ans ^ (A[i] + depth + 1));
                used[i] = false;
            }
        }
    }
}

int main()
{
    int N;
    cin >> N;
    A.resize(N);
    vector<int> P(N);
    REP(i, N)
    {
        cin >> A[i];
        P[i] = i;
    }

    map<int, vector<int>> M;
    do
    {
        ll c = 0;
        REP(i, N)
        {
            c ^= (A[i] + P[i] + 1);
        }
        if (M.count(c) == 1)
        {
            auto ans = M[c];
            for (auto ans0 : ans)
            {
                cout << ans0 + 1 << " ";
            }
            cout << endl;
            for (auto p0 : P)
            {
                cout << p0 + 1 << " ";
            }
            cout << endl;
            return 0;
        }
        M[c] = P;
    } while (next_permutation(all(P)));
    cout << -1 << endl;
    // dfs(0, N, 0, N - 1);
}