結果

問題 No.2991 Hypercubic Graph Flow
ユーザー ecottea
提出日時 2024-12-16 02:32:54
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 62 ms / 2,000 ms
コード長 10,014 bytes
コンパイル時間 5,004 ms
コンパイル使用メモリ 267,972 KB
実行使用メモリ 7,424 KB
最終ジャッジ日時 2024-12-16 02:33:01
合計ジャッジ時間 6,337 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

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

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9e18int -2^31 2^31 = 2e9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
using mint = modint998244353;
//using mint = static_modint<1000000007>;
//using mint = modint; // mint::set_mod(m);
string mint_to_frac(mint x, int v_max = 31595) {
repi(dnm, 1, v_max) {
int num = (x * dnm).val();
if (num == 0) {
return "0";
}
if (num <= v_max) {
if (dnm == 1) return to_string(num);
return to_string(num) + "/" + to_string(dnm);
}
if (mint::mod() - num <= v_max) {
if (dnm == 1) return "-" + to_string(mint::mod() - num);
return "-" + to_string(mint::mod() - num) + "/" + to_string(dnm);
}
}
return to_string(x.val());
}
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
#ifdef _MSC_VER
inline ostream& operator<<(ostream& os, const mint& x) { os << mint_to_frac(x); return os; }
#else
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
#endif
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(...)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
bool check(int n, vvi f) {
int N = 1 << n;
rep(i, N) rep(j, N) {
if (popcount(i ^ j) == 1) {
if (f[i][j] == 0) {
dump("tp1:", i, j, ":", f[i][j]);
return 0;
}
}
else {
if (f[i][j] != 0) {
dump("tp1:", i, j, ":", f[i][j]);
return 0;
}
}
}
rep(i, N) rep(j, N) {
if (f[i][j] != -f[j][i]) {
dump("tp2:", i, j, ":", f[i][j], f[j][i]);
return 0;
}
}
rep(i, N) {
int s = accumulate(all(f[i]), 0);
if (s != 0) {
dump("tp3:", i, ":", s);
return 0;
}
}
return 1;
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n;
cin >> n;
if (n == 1) EXIT("No");
int N = 1 << n;
vvi f(N, vi(N));
if (n & 1) {
rep(i, N) rep(j, N) {
int x = i ^ j;
if (popcount(x) != 1) continue;
int k = lsb(x);
if (k == 0) {
int ik0 = getb(i, k);
int ik1 = getb(i, k + 1);
int ik2 = getb(i, k + 2);
// 000 -> 001
if (ik0 == 0 && ik1 == 0 && ik2 == 0) f[i][j] = 1;
else if (ik0 == 1 && ik1 == 0 && ik2 == 0) f[i][j] = -1;
// 011 -> 010
else if (ik0 == 1 && ik1 == 1 && ik2 == 0) f[i][j] = 1;
else if (ik0 == 0 && ik1 == 1 && ik2 == 0) f[i][j] = -1;
// 101 -> 100
else if (ik0 == 1 && ik1 == 0 && ik2 == 1) f[i][j] = 1;
else if (ik0 == 0 && ik1 == 0 && ik2 == 1) f[i][j] = -1;
// 110 -> 111
else if (ik0 == 0 && ik1 == 1 && ik2 == 1) f[i][j] = 1;
else if (ik0 == 1 && ik1 == 1 && ik2 == 1) f[i][j] = -1;
}
else if (k == 1) {
int ik0 = getb(i, k - 1);
int ik1 = getb(i, k);
int ik2 = getb(i, k + 1);
// 010 ->> 000
if (ik0 == 0 && ik1 == 1 && ik2 == 0) f[i][j] = 2;
else if (ik0 == 0 && ik1 == 0 && ik2 == 0) f[i][j] = -2;
// 001 ->> 011
else if (ik0 == 1 && ik1 == 0 && ik2 == 0) f[i][j] = 2;
else if (ik0 == 1 && ik1 == 1 && ik2 == 0) f[i][j] = -2;
// 111 ->> 101
else if (ik0 == 1 && ik1 == 1 && ik2 == 1) f[i][j] = 2;
else if (ik0 == 1 && ik1 == 0 && ik2 == 1) f[i][j] = -2;
// 100 ->> 110
else if (ik0 == 0 && ik1 == 0 && ik2 == 1) f[i][j] = 2;
else if (ik0 == 0 && ik1 == 1 && ik2 == 1) f[i][j] = -2;
}
else if (k == 2) {
int ik0 = getb(i, k - 2);
int ik1 = getb(i, k - 1);
int ik2 = getb(i, k);
// 000 -> 100
if (ik0 == 0 && ik1 == 0 && ik2 == 0) f[i][j] = 1;
else if (ik0 == 0 && ik1 == 0 && ik2 == 1) f[i][j] = -1;
// 101 -> 001
else if (ik0 == 0 && ik1 == 1 && ik2 == 1) f[i][j] = 1;
else if (ik0 == 0 && ik1 == 1 && ik2 == 0) f[i][j] = -1;
// 110 -> 010
else if (ik0 == 1 && ik1 == 0 && ik2 == 1) f[i][j] = 1;
else if (ik0 == 1 && ik1 == 0 && ik2 == 0) f[i][j] = -1;
// 011 -> 111
else if (ik0 == 1 && ik1 == 1 && ik2 == 0) f[i][j] = 1;
else if (ik0 == 1 && ik1 == 1 && ik2 == 1) f[i][j] = -1;
}
else if (~k & 1) {
int ik = getb(i, k);
int ik1 = getb(i, k - 1);
// 01 -> 11
if (ik == 0 && ik1 == 1) f[i][j] = 1;
else if (ik == 1 && ik1 == 1) f[i][j] = -1;
// 10 -> 00
else if (ik == 1 && ik1 == 0) f[i][j] = 1;
else if (ik == 0 && ik1 == 0) f[i][j] = -1;
}
else {
int ik = getb(i, k);
int ik1 = getb(i, k + 1);
// 00 -> 01
if (ik == 0 && ik1 == 0) f[i][j] = 1;
else if (ik == 1 && ik1 == 0) f[i][j] = -1;
// 11 -> 10
else if (ik == 1 && ik1 == 1) f[i][j] = 1;
else if (ik == 0 && ik1 == 1) f[i][j] = -1;
}
}
}
else {
rep(i, N) rep(j, N) {
int x = i ^ j;
if (popcount(x) != 1) continue;
int k = lsb(x);
if (k & 1) {
int ik = getb(i, k);
int ik1 = getb(i, k - 1);
// 01 -> 11
if (ik == 0 && ik1 == 1) f[i][j] = 1;
else if (ik == 1 && ik1 == 1) f[i][j] = -1;
// 10 -> 00
else if (ik == 1 && ik1 == 0) f[i][j] = 1;
else if (ik == 0 && ik1 == 0) f[i][j] = -1;
}
else {
int ik = getb(i, k);
int ik1 = getb(i, k + 1);
// 00 -> 01
if (ik == 0 && ik1 == 0) f[i][j] = 1;
else if (ik == 1 && ik1 == 0) f[i][j] = -1;
// 11 -> 10
else if (ik == 1 && ik1 == 1) f[i][j] = 1;
else if (ik == 0 && ik1 == 1) f[i][j] = -1;
}
}
}
dump("ok?:", check(n, f));
Yes(1);
rep(i, N) {
rep(j, N) {
cout << f[i][j] << " \n"[j == N - 1];
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0