#969772 (C++23) No.2719 Equal Inner Products in Permutation

提出ソース

結果

問題	No.2719 Equal Inner Products in Permutation
ユーザー	hitonanode
提出日時	2024-04-05 22:12:44
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	39 ms / 2,000 ms
コード長	8,549 bytes
コンパイル時間	2,169 ms
コンパイル使用メモリ	190,448 KB
実行使用メモリ	6,824 KB
最終ジャッジ日時	2024-10-01 02:27:32
合計ジャッジ時間	6,762 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	1 ms 6,816 KB
testcase_05	AC	2 ms 6,820 KB
testcase_06	AC	2 ms 6,816 KB
testcase_07	AC	2 ms 6,820 KB
testcase_08	AC	2 ms 6,820 KB
testcase_09	AC	2 ms 6,820 KB
testcase_10	AC	2 ms 6,816 KB
testcase_11	AC	2 ms 6,820 KB
testcase_12	AC	2 ms 6,824 KB
testcase_13	AC	2 ms 6,820 KB
testcase_14	AC	2 ms 6,816 KB
testcase_15	AC	33 ms 6,820 KB
testcase_16	AC	37 ms 6,820 KB
testcase_17	AC	23 ms 6,820 KB
testcase_18	AC	36 ms 6,820 KB
testcase_19	AC	30 ms 6,816 KB
testcase_20	AC	21 ms 6,820 KB
testcase_21	AC	37 ms 6,820 KB
testcase_22	AC	25 ms 6,820 KB
testcase_23	AC	24 ms 6,816 KB
testcase_24	AC	21 ms 6,816 KB
testcase_25	AC	37 ms 6,820 KB
testcase_26	AC	36 ms 6,820 KB
testcase_27	AC	36 ms 6,816 KB
testcase_28	AC	39 ms 6,816 KB
testcase_29	AC	38 ms 6,820 KB
testcase_30	AC	37 ms 6,816 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

bool check(const vector<int> &vec) {
    const int N = vec.size() / 3;

    auto U = vec;
    sort(ALL(U));
    if ((int)U.size() != N * 3) return false;

    REP(i, N) if (U.at(i) != i + 1) return false;

    lint ret = 0;
    REP(i, N) {
        ret += (lint)vec.at(N + i) * (vec.at(i) - vec.at(2 * N + i));
    }
    return ret == 0;
}

vector<int> expe(int N) {
    vector<int> X(N * 3);
    REP(i, N * 3) X.at(i) = i + 1;

    do {
        if (check(X)) {
            return X;
        }
    } while (next_permutation(ALL(X)));

    return {};
}

void answer(const vector<int> &vec) {
    if (vec.empty()) {
        puts("-1");
    } else {
        REP(i, vec.size()) cout << vec.at(i) << (i + 1 == vec.size() ? '\n' : ' ');
    }
    exit(0);
}

int main() {
    // FOR(n, 1, 6) {
    //     const auto vec = expe(n);
    //     cout << vec << endl;
    // }

    int N;
    cin >> N;

    if (N == 1) answer({});

    vector<int> ret(N * 3);
    int head = N * 3;
    int i = N;

    while (head >= 18 or head == 12) {
        i -= 4;
        ++head;
        IREP(j, 4) ret.at(N + i + j) = --head;
        ret.at(i + 3) = --head;
        ret.at(i + 3 + N * 2) = --head;
        ret.at(i + 2 + N * 2) = --head;
        ret.at(i + 2) = --head;
        ret.at(i + 1 + N * 2) = --head;
        ret.at(i + 1) = --head;
        ret.at(i + 0) = --head;
        ret.at(i + 0 + N * 2) = --head;
        --head;
    }

    if (head == 15) {
        vector<int> U{1, 2, 3, 8, 13, 7, 10, 12, 14, 15, 11, 9, 6, 4, 5};
        REP(i, 3) REP(j, 5) ret.at(i * N + j) = U.at(i * 5 + j);
    } else if (head == 9) {
        vector<int> U{1, 2, 8, 3, 6, 9, 7, 5, 4};
        REP(i, 3) REP(j, 3) ret.at(i * N + j) = U.at(i * 3 + j);
    } else if (head == 6) {
        ret.at(0) = 1;
        ret.at(1) = 4;
        ret.at(N) = 3;
        ret.at(N + 1) = 6;
        ret.at(N * 2) = 5;
        ret.at(N * 2 + 1) = 2;
    }
    dbg(check(ret));

    answer(ret);
}

yukicoder

結果

テストケース

ソースコード