結果

問題 No.2732 Similar Permutations
ユーザー woodywoodywoodywoody
提出日時 2024-04-20 15:07:27
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 137 ms / 2,000 ms
コード長 6,176 bytes
コンパイル時間 4,170 ms
コンパイル使用メモリ 239,256 KB
実行使用メモリ 16,768 KB
最終ジャッジ日時 2024-10-12 10:48:50
合計ジャッジ時間 21,972 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 37 ms
6,936 KB
testcase_03 AC 60 ms
10,312 KB
testcase_04 AC 18 ms
5,328 KB
testcase_05 AC 16 ms
5,248 KB
testcase_06 AC 8 ms
5,248 KB
testcase_07 AC 48 ms
8,212 KB
testcase_08 AC 22 ms
5,724 KB
testcase_09 AC 13 ms
5,248 KB
testcase_10 AC 105 ms
16,680 KB
testcase_11 AC 10 ms
5,248 KB
testcase_12 AC 107 ms
16,632 KB
testcase_13 AC 107 ms
16,636 KB
testcase_14 AC 107 ms
16,760 KB
testcase_15 AC 105 ms
16,636 KB
testcase_16 AC 75 ms
12,032 KB
testcase_17 AC 70 ms
11,908 KB
testcase_18 AC 100 ms
16,336 KB
testcase_19 AC 107 ms
16,636 KB
testcase_20 AC 104 ms
16,552 KB
testcase_21 AC 131 ms
16,636 KB
testcase_22 AC 64 ms
10,468 KB
testcase_23 AC 115 ms
16,632 KB
testcase_24 AC 64 ms
10,480 KB
testcase_25 AC 110 ms
16,636 KB
testcase_26 AC 83 ms
12,972 KB
testcase_27 AC 137 ms
16,640 KB
testcase_28 AC 85 ms
12,564 KB
testcase_29 AC 103 ms
16,768 KB
testcase_30 AC 75 ms
11,752 KB
testcase_31 AC 108 ms
16,636 KB
testcase_32 AC 110 ms
16,516 KB
testcase_33 AC 128 ms
16,632 KB
testcase_34 AC 96 ms
11,336 KB
testcase_35 AC 112 ms
16,636 KB
testcase_36 AC 108 ms
16,364 KB
testcase_37 AC 114 ms
16,764 KB
testcase_38 AC 107 ms
16,088 KB
testcase_39 AC 106 ms
16,636 KB
testcase_40 AC 106 ms
13,136 KB
testcase_41 AC 134 ms
16,760 KB
testcase_42 AC 76 ms
12,128 KB
testcase_43 AC 105 ms
16,764 KB
testcase_44 AC 54 ms
10,068 KB
testcase_45 AC 136 ms
16,632 KB
testcase_46 AC 99 ms
16,304 KB
testcase_47 AC 105 ms
16,764 KB
testcase_48 AC 63 ms
10,864 KB
testcase_49 AC 129 ms
16,764 KB
testcase_50 AC 61 ms
10,644 KB
testcase_51 AC 102 ms
16,764 KB
testcase_52 AC 82 ms
13,436 KB
testcase_53 AC 106 ms
16,636 KB
testcase_54 AC 103 ms
16,640 KB
testcase_55 AC 104 ms
16,764 KB
testcase_56 AC 104 ms
16,636 KB
testcase_57 AC 54 ms
10,072 KB
testcase_58 AC 70 ms
11,732 KB
testcase_59 AC 67 ms
11,420 KB
testcase_60 AC 57 ms
10,284 KB
testcase_61 AC 52 ms
10,032 KB
testcase_62 AC 81 ms
12,968 KB
testcase_63 AC 2 ms
5,248 KB
testcase_64 AC 2 ms
5,248 KB
testcase_65 AC 2 ms
5,248 KB
testcase_66 AC 1 ms
5,248 KB
testcase_67 AC 2 ms
5,248 KB
testcase_68 AC 2 ms
5,248 KB
testcase_69 AC 2 ms
5,248 KB
testcase_70 AC 2 ms
5,248 KB
testcase_71 AC 2 ms
5,248 KB
testcase_72 AC 2 ms
5,248 KB
testcase_73 AC 2 ms
5,248 KB
testcase_74 AC 2 ms
5,248 KB
testcase_75 AC 2 ms
5,248 KB
testcase_76 AC 2 ms
5,248 KB
testcase_77 AC 2 ms
5,248 KB
testcase_78 AC 2 ms
5,248 KB
testcase_79 AC 2 ms
5,248 KB
testcase_80 AC 2 ms
5,248 KB
testcase_81 AC 2 ms
5,248 KB
testcase_82 AC 2 ms
5,248 KB
testcase_83 AC 2 ms
5,248 KB
testcase_84 AC 2 ms
5,248 KB
testcase_85 AC 2 ms
5,248 KB
testcase_86 AC 2 ms
5,248 KB
testcase_87 AC 2 ms
5,248 KB
testcase_88 AC 2 ms
5,248 KB
testcase_89 AC 2 ms
5,248 KB
testcase_90 AC 2 ms
5,248 KB
testcase_91 AC 2 ms
5,248 KB
testcase_92 AC 2 ms
5,248 KB
testcase_93 AC 2 ms
5,248 KB
testcase_94 AC 2 ms
5,248 KB
testcase_95 AC 2 ms
5,248 KB
testcase_96 AC 2 ms
5,248 KB
testcase_97 AC 2 ms
5,248 KB
testcase_98 AC 2 ms
5,248 KB
testcase_99 AC 2 ms
5,248 KB
testcase_100 AC 2 ms
5,248 KB
testcase_101 AC 2 ms
5,248 KB
testcase_102 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

void solve(){
    int n; cin>>n;
    vi a(n);
    rep(i,n) cin>>a[i];
    if (n==1){
        retval(-1);
    }else if(n==2){
        int p1 = (a[0]+1)^(a[1]+2);
        int p2 = (a[1]+1)^(a[0]+2);
        if (p1==p2){
            cout << 1 << " " << 2 << endl;
            cout << 2 << " " << 1 << endl;
            return;
        }else{
            retval(-1);
        }
    }
    pii p = {-1,-1};
    rep1(i,n){
        if (a[i]%2==a[0]%2){
            p = {0,i};
            break;
        }
    }
    if (p.fi==-1){
        repx(i,2,n){
            if (a[i]%2==a[1]%2){
                p = {1,i};
                break;
            }
        } 
    }
    assert(p.fi!=-1);
    vi p1(n);
    vi p2(n);
    pii t = {0,1};
    if (a[p.fi]%2==0) t = {1,2};
    int now = 1;
    rep(i,n){
        if (i==t.fi) continue;
        if (i==t.se) continue;
        while(now==p.fi+1) now++;
        while(now==p.se+1) now++;
        p1[i] = now++;
    }
    p2 = p1;
    p1[t.fi] = p.fi+1;
    p1[t.se] = p.se+1;
    p2[t.fi] = p.se+1;
    p2[t.se] = p.fi+1;
    {
        ll s1 = 0;
        ll s2 = 0;
        rep(i,n) s1 ^= (a[p1[i]-1]+i+1);
        rep(i,n) s2 ^= (a[p2[i]-1]+i+1);
        assert(s1==s2);
        unordered_map<int,int> mp;
        rep(i,n) mp[p1[i]]++;
        rep(i,n) mp[p2[i]]++;
        fore(y , mp) assert(y.se==2);
    }
    vi q1(n);
    vi q2(n);
    rep(i,n) q1[p1[i]-1] = i+1; 
    rep(i,n) q2[p2[i]-1] = i+1; 
    {
        unordered_map<int,int> mp;
        rep(i,n) mp[q1[i]]++;
        rep(i,n) mp[q2[i]]++;
        fore(y , mp) assert(y.se==2);
    }
    coutv(q1);
    coutv(q2);

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0