結果

問題 No.2719 Equal Inner Products in Permutation
ユーザー noya2
提出日時 2024-04-05 22:39:41
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 47 ms / 2,000 ms
コード長 5,856 bytes
コンパイル時間 3,220 ms
コンパイル使用メモリ 262,732 KB
実行使用メモリ 10,728 KB
最終ジャッジ日時 2024-10-01 02:47:35
合計ジャッジ時間 7,493 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

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...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void jikken(){
    int n = 4;
    vector<int> p(n*3); iota(all(p),1);
    do {
        int lhs = 0, rhs = 0;
        rep(i,n){
            lhs += p[i] * p[n+i];
            rhs += p[n+n+i] * p[n+i];
        }
        if (lhs != rhs) continue;
        int lsum = 0, rsum = 0;
        rep(i,n){
            lsum += p[i] + p[n+i];
            rsum += p[n+n+i] + p[n+i];
        }
        out(p);
        return ;
        // if (lsum != rsum) continue;
        // out(p);
    }while(next_permutation(all(p)));

}

void solve(){
    int n; in(n);
    if (n == 1){
        out(-1);
        return ;
    }
    vector<vector<int>> p(3,vector<int>(n));
    vector<vector<int>> tmp = 
    {
        {1,2,9},
        {6,8,7},
        {3,4,5}
    };
    vector<vector<int>> p1 = 
    {
        {1,2,4,11},
        {7,9,10,12},
        {8,5,6,3}
    };
    vector<vector<int>> p2 =
    {
        {2,5},
        {6,3},
        {4,1}
    };
    int start = 0;
    if (n % 3 == 1){
        rep(i,3){
            rep(j,4){
                p[i][j] = p1[i][j];
            }
        }
        start = 4;
    }
    if (n % 3 == 2){
        rep(i,3){
            rep(j,2){
                p[i][j] = p2[i][j];
            }
        }
        start = 2;
    }
    for (int s = start; s < n; s += 3){
        rep(i,3) rep(j,3){
            p[i][s+j] = tmp[i][j] + s*3;
        }
    }
    vector<int> ans;
    rep(i,3) ans.insert(ans.end(),all(p[i]));
    out(ans);
    // judge
    ll sum = 0;
    rep(i,n){
        sum += ll(ans[i] - ans[n+n+i]) * ans[n+i];
    }
    assert(sum == 0);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0