結果

問題 No.2719 Equal Inner Products in Permutation
ユーザー dyktr_06dyktr_06
提出日時 2024-04-05 23:49:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 66 ms / 2,000 ms
コード長 5,652 bytes
コンパイル時間 2,117 ms
コンパイル使用メモリ 209,080 KB
実行使用メモリ 16,312 KB
最終ジャッジ日時 2024-10-01 03:11:56
合計ジャッジ時間 6,947 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 7 ms
5,248 KB
testcase_03 AC 7 ms
5,248 KB
testcase_04 AC 7 ms
5,248 KB
testcase_05 AC 7 ms
5,248 KB
testcase_06 AC 7 ms
5,248 KB
testcase_07 AC 7 ms
5,248 KB
testcase_08 AC 7 ms
5,248 KB
testcase_09 AC 8 ms
5,248 KB
testcase_10 AC 7 ms
5,248 KB
testcase_11 AC 9 ms
5,248 KB
testcase_12 AC 8 ms
5,248 KB
testcase_13 AC 8 ms
5,248 KB
testcase_14 AC 8 ms
5,248 KB
testcase_15 AC 51 ms
11,468 KB
testcase_16 AC 59 ms
15,948 KB
testcase_17 AC 37 ms
10,160 KB
testcase_18 AC 59 ms
15,996 KB
testcase_19 AC 53 ms
11,252 KB
testcase_20 AC 38 ms
9,904 KB
testcase_21 AC 60 ms
16,156 KB
testcase_22 AC 44 ms
10,704 KB
testcase_23 AC 39 ms
10,352 KB
testcase_24 AC 36 ms
9,956 KB
testcase_25 AC 60 ms
16,184 KB
testcase_26 AC 66 ms
16,188 KB
testcase_27 AC 66 ms
16,072 KB
testcase_28 AC 62 ms
16,312 KB
testcase_29 AC 61 ms
16,188 KB
testcase_30 AC 62 ms
16,192 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'vll naive(ll)':
main.cpp:78:1: warning: control reaches end of non-void function [-Wreturn-type]
   78 | }
      | ^
main.cpp: In function 'vll naive3()':
main.cpp:99:1: warning: control reaches end of non-void function [-Wreturn-type]
   99 | }
      | ^

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
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; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

void input(){

}

vll naive(ll n){
    vll p(3 * n);
    iota(ALL(p), 1);
    do{
        ll mul1 = 0, mul2 = 0;
        rep(i, n){
            mul1 += p[i] * p[n + i];
            mul2 += p[n + i] * p[n * 2 + i];
        }
        if(mul1 == mul2){
            return p;
        }
    }while(next_permutation(ALL(p)));
}

vll naive3(){
    ll n = 3;
    vll p(3 * n);
    iota(ALL(p), 1);
    do{
        ll mul1 = 0, mul2 = 0;
        rep(i, n){
            mul1 += p[i] * p[n + i];
            mul2 += p[n + i] * p[n * 2 + i];
        }
        ll sum1 = 0, sum2 = 0;
        rep(i, n){
            sum1 += p[i];
            sum2 += p[i + 2 * n];
        }
        if(mul1 == mul2 && sum1 == sum2){
            return p;
        }
    }while(next_permutation(ALL(p)));
}

void solve(){
    ll n; in(n);
    if(n == 1){
        out(-1);
        return;
    }
    vll p2 = naive(2);
    vll p3 = naive3();
    vll p4 = naive(4);
    vector<vll> ans0(3);
    if(n % 3 == 0){
        rep(i, 9){
            ans0[i / 3].push_back(p3[i]);
        }
    }else if(n % 3 == 1){
        rep(i, 12){
            ans0[i / 4].push_back(p4[i]);
        }
    }else{
        rep(i, 6){
            ans0[i / 2].push_back(p2[i]);
        }
    }

    ll mx = 0;
    rep(i, 3) chmax(mx, max(ans0[i]));
    rep(i, (n - 2) / 3){
        rep(i, 9){
            ans0[i / 3].push_back(mx + p3[i]);
        }
        mx += 9;
    }
    vll ans;
    rep(i, 3) for(auto x : ans0[i]) ans.push_back(x);
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0