結果

問題 No.2732 Similar Permutations
ユーザー apricityapricity
提出日時 2024-04-25 22:24:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 63 ms / 2,000 ms
コード長 4,280 bytes
コンパイル時間 1,412 ms
コンパイル使用メモリ 135,236 KB
実行使用メモリ 18,048 KB
最終ジャッジ日時 2024-11-08 10:30:32
合計ジャッジ時間 19,201 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
15,488 KB
testcase_01 AC 11 ms
15,488 KB
testcase_02 AC 27 ms
16,384 KB
testcase_03 AC 40 ms
16,896 KB
testcase_04 AC 21 ms
16,000 KB
testcase_05 AC 18 ms
15,872 KB
testcase_06 AC 14 ms
15,616 KB
testcase_07 AC 31 ms
16,512 KB
testcase_08 AC 22 ms
16,000 KB
testcase_09 AC 16 ms
15,744 KB
testcase_10 AC 60 ms
17,792 KB
testcase_11 AC 15 ms
15,744 KB
testcase_12 AC 60 ms
17,920 KB
testcase_13 AC 61 ms
17,792 KB
testcase_14 AC 61 ms
17,920 KB
testcase_15 AC 61 ms
17,792 KB
testcase_16 AC 47 ms
17,280 KB
testcase_17 AC 46 ms
17,152 KB
testcase_18 AC 57 ms
17,664 KB
testcase_19 AC 61 ms
17,920 KB
testcase_20 AC 60 ms
17,792 KB
testcase_21 AC 61 ms
17,920 KB
testcase_22 AC 40 ms
16,896 KB
testcase_23 AC 62 ms
17,920 KB
testcase_24 AC 40 ms
16,896 KB
testcase_25 AC 62 ms
17,920 KB
testcase_26 AC 53 ms
17,408 KB
testcase_27 AC 62 ms
17,792 KB
testcase_28 AC 51 ms
17,408 KB
testcase_29 AC 62 ms
17,792 KB
testcase_30 AC 46 ms
17,152 KB
testcase_31 AC 62 ms
17,920 KB
testcase_32 AC 58 ms
17,664 KB
testcase_33 AC 61 ms
17,920 KB
testcase_34 AC 44 ms
17,024 KB
testcase_35 AC 61 ms
17,920 KB
testcase_36 AC 58 ms
17,792 KB
testcase_37 AC 61 ms
17,920 KB
testcase_38 AC 54 ms
17,536 KB
testcase_39 AC 61 ms
17,920 KB
testcase_40 AC 53 ms
17,536 KB
testcase_41 AC 60 ms
17,920 KB
testcase_42 AC 47 ms
17,280 KB
testcase_43 AC 61 ms
17,920 KB
testcase_44 AC 36 ms
16,640 KB
testcase_45 AC 60 ms
17,920 KB
testcase_46 AC 56 ms
17,664 KB
testcase_47 AC 60 ms
17,792 KB
testcase_48 AC 41 ms
17,024 KB
testcase_49 AC 60 ms
18,048 KB
testcase_50 AC 40 ms
16,896 KB
testcase_51 AC 58 ms
17,920 KB
testcase_52 AC 51 ms
17,536 KB
testcase_53 AC 61 ms
17,920 KB
testcase_54 AC 63 ms
17,792 KB
testcase_55 AC 62 ms
17,920 KB
testcase_56 AC 62 ms
17,920 KB
testcase_57 AC 37 ms
16,768 KB
testcase_58 AC 46 ms
17,152 KB
testcase_59 AC 44 ms
17,024 KB
testcase_60 AC 39 ms
16,896 KB
testcase_61 AC 36 ms
16,640 KB
testcase_62 AC 51 ms
17,280 KB
testcase_63 AC 11 ms
15,488 KB
testcase_64 AC 10 ms
15,360 KB
testcase_65 AC 10 ms
15,488 KB
testcase_66 AC 10 ms
15,488 KB
testcase_67 AC 9 ms
15,488 KB
testcase_68 AC 10 ms
15,488 KB
testcase_69 AC 9 ms
15,488 KB
testcase_70 AC 10 ms
15,488 KB
testcase_71 AC 10 ms
15,488 KB
testcase_72 AC 11 ms
15,360 KB
testcase_73 AC 10 ms
15,488 KB
testcase_74 AC 10 ms
15,488 KB
testcase_75 AC 9 ms
15,488 KB
testcase_76 AC 10 ms
15,488 KB
testcase_77 AC 10 ms
15,488 KB
testcase_78 AC 9 ms
15,616 KB
testcase_79 AC 9 ms
15,488 KB
testcase_80 AC 9 ms
15,360 KB
testcase_81 AC 10 ms
15,488 KB
testcase_82 AC 10 ms
15,488 KB
testcase_83 AC 10 ms
15,488 KB
testcase_84 AC 9 ms
15,488 KB
testcase_85 AC 10 ms
15,488 KB
testcase_86 AC 10 ms
15,488 KB
testcase_87 AC 10 ms
15,488 KB
testcase_88 AC 10 ms
15,616 KB
testcase_89 AC 10 ms
15,488 KB
testcase_90 AC 10 ms
15,488 KB
testcase_91 AC 10 ms
15,488 KB
testcase_92 AC 10 ms
15,488 KB
testcase_93 AC 11 ms
15,488 KB
testcase_94 AC 11 ms
15,488 KB
testcase_95 AC 10 ms
15,360 KB
testcase_96 AC 10 ms
15,488 KB
testcase_97 AC 10 ms
15,488 KB
testcase_98 AC 10 ms
15,488 KB
testcase_99 AC 10 ms
15,360 KB
testcase_100 AC 10 ms
15,360 KB
testcase_101 AC 10 ms
15,488 KB
testcase_102 AC 9 ms
15,488 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep1(a)          for(int i = 0; i < a; i++)
#define rep2(i, a)       for(int i = 0; i < a; i++)
#define rep3(i, a, b)    for(int i = a; i < b; i++)
#define rep4(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a)          for(int i = (a)-1; i >= 0; i--)
#define rrep2(i, a)       for(int i = (a)-1; i >= 0; i--)
#define rrep3(i, a, b)    for(int i = (b)-1; i >= a; i--)
#define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using vvvvvc = vector<vvvvc<T>>;
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; in(n);
    vector<int> a(n); in(a);
    int m = min(n,10);
    vector<int> p(m); iota(ALL(p),1);
    vector<vector<int>> f(1<<19);
    do{
        int x = 0;
        rep(i,m) x ^= (p[i]+a[i]);
        if(f[x].size()){
            vector<int> q(n),r(n);
            rep(i,m) q[i]=p[i];
            rep(i,m) r[i]=f[x][i];
            rep(i,m,n) q[i]=r[i]=i+1;
            out(q);
            out(r);
            return 0;
        }
        else{
            f[x]=p;
        }
    }while(next_permutation(ALL(p)));
    out("-1");
}
0