結果

問題 No.2719 Equal Inner Products in Permutation
ユーザー woodywoodywoodywoody
提出日時 2024-04-06 02:51:32
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 45 ms / 2,000 ms
コード長 7,131 bytes
コンパイル時間 3,401 ms
コンパイル使用メモリ 231,604 KB
実行使用メモリ 10,292 KB
最終ジャッジ日時 2024-10-01 03:20:59
合計ジャッジ時間 7,797 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 1 ms
5,248 KB
testcase_09 AC 1 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 40 ms
9,088 KB
testcase_16 AC 43 ms
9,856 KB
testcase_17 AC 26 ms
7,424 KB
testcase_18 AC 42 ms
10,088 KB
testcase_19 AC 35 ms
8,820 KB
testcase_20 AC 24 ms
7,040 KB
testcase_21 AC 43 ms
9,848 KB
testcase_22 AC 30 ms
7,936 KB
testcase_23 AC 28 ms
7,652 KB
testcase_24 AC 24 ms
6,912 KB
testcase_25 AC 45 ms
10,132 KB
testcase_26 AC 43 ms
10,292 KB
testcase_27 AC 43 ms
10,228 KB
testcase_28 AC 44 ms
10,208 KB
testcase_29 AC 44 ms
10,240 KB
testcase_30 AC 44 ms
10,240 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;
    if (n==1){
        retval(-1);
    }
    vl ans(n*3,-1);
    if (n%4==2){
        rep(i,n/4*2){
            int a = 1;
            int b = 2;
            if (i%2==1) swap(a,b);
            ans[i*2] = (n-i*2)*3-a;
            ans[i*2+n] = (n-i*2)*3;
            ans[i*2+n*2] = (n-i*2)*3-b;
            ans[i*2+1] = (n-i*2)*3-3-b;
            ans[i*2+1+n] = (n-i*2)*3-3;
            ans[i*2+1+n*2] = (n-i*2)*3-3-a;
        }
        vi v = {6, 1, 4, 2, 5, 3};
        int l = 0;
        fore(y, ans) if (y==-1){
            y = v[l++];
        }
        assert(l==6);
    }else if(n%4==0){
        rep(i,(n-1)/4*2){
            int a = 1;
            int b = 2;
            if (i%2==1) swap(a,b);
            ans[i*2] = (n-i*2)*3-a;
            ans[i*2+n] = (n-i*2)*3;
            ans[i*2+n*2] = (n-i*2)*3-b;
            ans[i*2+1] = (n-i*2)*3-3-b;
            ans[i*2+1+n] = (n-i*2)*3-3;
            ans[i*2+1+n*2] = (n-i*2)*3-3-a;
        }
        vi v = {1, 2, 7, 9, 4, 11, 10, 12, 5, 8, 6, 3};
        int l = 0;
        fore(y, ans) if (y==-1){
            y = v[l++];
        }
        assert(l==12);
    }else if (n%4==3){
        rep(i,n/4*2){
            int a = 1;
            int b = 2;
            if (i%2==1) swap(a,b);
            ans[i*2] = (n-i*2)*3-a;
            ans[i*2+n] = (n-i*2)*3;
            ans[i*2+n*2] = (n-i*2)*3-b;
            ans[i*2+1] = (n-i*2)*3-3-b;
            ans[i*2+1+n] = (n-i*2)*3-3;
            ans[i*2+1+n*2] = (n-i*2)*3-3-a;
        }
        vi v = {1, 2, 8, 3, 6, 9, 7, 5, 4};
        int l = 0;
        fore(y, ans) if (y==-1){
            y = v[l++];
        }
        assert(l==9);
    }else if(n%4==1){
        rep(i,(n-2)/4*2){
            int a = 1;
            int b = 2;
            if (i%2==1) swap(a,b);
            ans[i*2] = (n-i*2)*3-a;
            ans[i*2+n] = (n-i*2)*3;
            ans[i*2+n*2] = (n-i*2)*3-b;
            ans[i*2+1] = (n-i*2)*3-3-b;
            ans[i*2+1+n] = (n-i*2)*3-3;
            ans[i*2+1+n*2] = (n-i*2)*3-3-a;
        }
        vi v = {1, 3, 5, 13, 15, 10, 8, 11, 2, 14, 6, 12, 9, 7, 4};
        int l = 0;
        fore(y, ans) if (y==-1){
            y = v[l++];
        }
        assert(l==15);
    }
    {
        vi flg(n*3);
        fore(y, ans){
            assert(y>0);
            flg[y-1]++;
        }
        fore(y, flg) assert(y==1);
        ll sum1 = 0;
        ll sum2 = 0;
        rep(i,n){
            sum1 += ans[i]*ans[i+n];
            sum2 += ans[i+n]*ans[i+n*2];
        }
        assert(sum1==sum2);
    }
    coutv(ans);

    return;
}

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

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

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

    return 0;
}
0