#970284 (C++17) No.2719 Equal Inner Products in Permutation

提出ソース

結果

問題	No.2719 Equal Inner Products in Permutation
ユーザー	siganai
提出日時	2024-04-06 14:19:32
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	34 ms / 2,000 ms
コード長	6,607 bytes
コンパイル時間	2,149 ms
コンパイル使用メモリ	205,912 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-10-01 03:50:50
合計ジャッジ時間	6,022 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	1 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	2 ms 6,820 KB
testcase_06	AC	2 ms 6,816 KB
testcase_07	AC	1 ms 6,820 KB
testcase_08	AC	2 ms 6,820 KB
testcase_09	AC	1 ms 6,816 KB
testcase_10	AC	2 ms 6,816 KB
testcase_11	AC	2 ms 6,816 KB
testcase_12	AC	2 ms 6,820 KB
testcase_13	AC	2 ms 6,816 KB
testcase_14	AC	2 ms 6,816 KB
testcase_15	AC	29 ms 6,816 KB
testcase_16	AC	32 ms 6,820 KB
testcase_17	AC	20 ms 6,816 KB
testcase_18	AC	32 ms 6,816 KB
testcase_19	AC	27 ms 6,816 KB
testcase_20	AC	19 ms 6,820 KB
testcase_21	AC	32 ms 6,820 KB
testcase_22	AC	24 ms 6,820 KB
testcase_23	AC	21 ms 6,816 KB
testcase_24	AC	17 ms 6,816 KB
testcase_25	AC	33 ms 6,820 KB
testcase_26	AC	34 ms 6,816 KB
testcase_27	AC	33 ms 6,820 KB
testcase_28	AC	33 ms 6,816 KB
testcase_29	AC	33 ms 6,820 KB
testcase_30	AC	34 ms 6,820 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }

#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;

int main() {
    INT(n);
    if(n == 1) {
        cout << -1 << '\n';
        return 0;
    }
    vi A(n);
    vi ans(3 * n);
    if(n % 4 == 0 || n % 4 == 3) {
        ll x = 1LL * n * (n + 1) / 4;
        rrep(i,n) {
            if(x >= i + 1) {
                x -= i + 1;
                ans[i] = i + n + 1;
                ans[i+n] = i + 1;
                ans[i+2*n] = i + 2 * n + 1;
            }
            else {
                ans[i] = i + 2 * n + 1;
                ans[i+n] = i + 1;
                ans[i+2*n] = i + n + 1;
            }
        }
    }
    else if(n % 4 == 2) {
        ans[0] = 1;
        ans[n] = 1 + n;
        ans[2*n] = 1 + 2 * n;
        ans[1] = 2 + n;
        ans[1+n] = 2 + 2 * n;
        ans[1+2*n] = 2;
        rep(i,2,(n+2)/2,2) {
            ans[i] = i + n + 1;
            ans[i+n] = i + 1;
            ans[i+2*n] = i + 2 * n + 1;
            ans[i+2*n+1] = i + n + 2;
            ans[i+n+1] = i + 2;
            ans[i+1] = i + 2 * n + 2;
            int j = n - i;
            ans[j] = j + 2 * n + 1;
            ans[j+n] = j + 1;
            ans[j+2*n] = j + n + 1;
            ans[j+1] = j + n + 2;
            ans[j+n+1] = j + 2;
            ans[j+2*n+1] = j + 2 * n + 2;
            debug(i,i+1,j,j+1);
        }
    }
    else {
        if(n == 5) {
            ans[4] = n;
            ans[9] = 2 * n;
            ans[14] = 3 * n;
            ans[3] = 4;
            ans[8] = 9;
            ans[13] = 14;
            ans[2] = 8;
            ans[7] = 13;
            ans[12] = 3;
            ans[1] = 12;
            ans[6] = 7;
            ans[11] = 2;
            ans[0] = 6;
            ans[5] = 11;
            ans[10] = 1;
        }
        else {
            ans[n-1] = n;
            ans[2*n-1] = 2 * n;
            ans[3*n-1] = 3 * n;
            ll x = 1LL * (n - 1) * n / 2 + 4 * n;
            x /= 2;
            x -= 4 * n;
            rrep(i,n-1) {
                if(x >= i + 1) {
                    x -= i + 1;
                    ans[i] = i + n + 1;
                    ans[i+n] = i + 1;
                    ans[i+2*n] = i + 2 * n + 1;
                }
                else {
                    ans[i] = i + 2 * n + 1;
                    ans[i+n] = i + 1;
                    ans[i+2*n] = i + n + 1;
                }
            }
        }
    }
    ll S = 0;
    ll B = 0;
    rep(i,n) {
        S += ans[i] * ans[i + n];
        B += ans[i + n] * ans[i + 2 * n];
    }
    debug(S,B);
    rep(i,3 * n) cout << ans[i] << " \n"[i == 3 * n - 1];
}

yukicoder

結果

テストケース

ソースコード