結果

問題 No.2732 Similar Permutations
ユーザー pitP
提出日時 2024-04-20 00:03:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 2,974 bytes
コンパイル時間 4,495 ms
コンパイル使用メモリ 260,456 KB
最終ジャッジ日時 2025-02-21 05:52:16
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 101
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 
typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N; cin >> N;
    vector<int> A(N);
    rep(i,N) cin >> A[i];
    map<int, vector<int>> mp;
    if(N <= 9){
        vector<int> p(N);
        iota(all(p), 1);
        do{
            int x = 0;
            rep(i,N) x ^= (A[i] + p[i]);
            if(mp.find(x)!=mp.end()){
                rep(i,N) cout << mp[x][i] << (i == N - 1 ? "\n" : " ");
                rep(i,N) cout << p[i] << (i == N - 1 ? "\n" : " ");
                return 0;
            }
            mp[x] = p;
        } while (next_permutation(all(p)));
        cout << -1 << endl;
    }
    else{
        vector<int> p(10);
        iota(all(p), 1);
        do{
            int x = 0;
            rep(i,N) {
                if(i < 10) x ^= (A[i] + p[i]);
                else x ^= (A[i] + i + 1);
            }
            if(mp.find(x)!=mp.end()){
                rep(i,N) {
                    if(i < 10) cout << mp[x][i] << (i == N - 1 ? "\n" : " ");
                    else cout << i + 1 << (i == N - 1 ? "\n" : " ");
                }
                rep(i,N) {
                    if(i < 10) cout << p[i] << (i == N - 1 ? "\n" : " ");
                    else cout << i + 1 << (i == N - 1 ? "\n" : " ");
                }
                return 0;
            }
            mp[x] = p;
        } while (next_permutation(all(p)));
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0