結果

問題 No.2719 Equal Inner Products in Permutation
ユーザー ir5ir5
提出日時 2024-07-12 19:56:04
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 61 ms / 2,000 ms
コード長 3,909 bytes
コンパイル時間 1,673 ms
コンパイル使用メモリ 145,012 KB
実行使用メモリ 8,172 KB
最終ジャッジ日時 2024-07-12 19:56:11
合計ジャッジ時間 7,180 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;
class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};
template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}";
    }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}";
    }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", ";
    return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }
#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif
namespace solver {
template<typename T1, typename T2> struct In2 {
T1 a; T2 b;
friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};
template<typename T1, typename T2, typename T3> struct In3 {
T1 a; T2 b; T3 c;
friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};
int n;
void read() {
cin >> n;
}
void expe() {
vector<int> v(6);
for (int i : range(6)) v[i] = i + 1;
do {
if (v[0] * v[2] + v[1] * v[3] == v[4] * v[2] + v[5] * v[3]) {
dump(v);
break;
}
} while (next_permutation(v.begin(), v.end()));
}
using RetType = void;
RetType run() {
if (n == 1) {
cout << "-1" << endl;
return;
}
vector<ll> res;
if (n == 2) {
res = {1, 4, 3, 6, 5, 2};
} else {
res.assign(3 * n, 0);
for (ll i : range(n)) res[n + i] = i + 1;
int s[4] = {0, 1, 1, 0};
for (ll i : range(n)) {
ll lo = n + 2 * i + 1;
ll hi = n + 2 * i + 2;
ll j = i, k = 2 * n + i;
if (n % 4 == 0) {
if (s[i % 4]) swap(j, k);
}
if (n % 4 == 3) {
if (i < 3) {
if (i == 2) swap(j, k);
} else {
if (s[(i - 3) % 4]) swap(j, k);
}
}
if (n % 4 == 1 || n % 4 == 2) {
if (i == 0) lo = n + 1, hi = n + 3;
if (i == 1) lo = n + 2, hi = n + 4;
}
if (n % 4 == 1) {
if (i < 5) {
if (i < 3) swap(j, k);
} else if (s[(i - 5) % 4]) swap(j, k);
}
if (n % 4 == 2) {
if (i < 6) {
if (i == 0) swap(j, k);
if (i == 3) swap(j, k);
if (i == 5) swap(j, k);
} else if (s[(i - 6) % 4]) swap(j, k);
}
res[j] = lo, res[k] = hi;
}
}
dump(res);
ll sum1 = 0, sum2 = 0;
for (ll i : range(n)) {
sum1 += res[n + i] * res[i];
sum2 += res[n + i] * res[2 * n + i];
}
dump(sum1 << " " << sum2);
assert(sum1 == sum2);
for (auto e : res) cout << e << " ";
cout << endl;
}
} // namespace
template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }
int main(int argc, char** argv) {
cerr << fixed << setprecision(12);
cout << fixed << setprecision(12);
int testcase = 1;
if (argc > 1) testcase = atoi(argv[1]);
while (testcase--) {
solver::read();
}
run(solver::run);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0