結果
問題 | No.1652 XOR Inequalities |
ユーザー | ir5 |
提出日時 | 2024-06-23 22:04:20 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 5,578 bytes |
コンパイル時間 | 3,036 ms |
コンパイル使用メモリ | 148,052 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-23 22:04:27 |
合計ジャッジ時間 | 6,057 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 3 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 3 ms
6,944 KB |
testcase_14 | AC | 3 ms
6,940 KB |
testcase_15 | AC | 4 ms
6,940 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | AC | 3 ms
6,944 KB |
testcase_18 | AC | 3 ms
6,944 KB |
testcase_19 | AC | 3 ms
6,940 KB |
testcase_20 | AC | 5 ms
6,944 KB |
testcase_21 | AC | 3 ms
6,944 KB |
testcase_22 | AC | 3 ms
6,940 KB |
testcase_23 | AC | 3 ms
6,940 KB |
testcase_24 | AC | 3 ms
6,940 KB |
testcase_25 | AC | 4 ms
6,944 KB |
testcase_26 | AC | 4 ms
6,940 KB |
testcase_27 | AC | 4 ms
6,944 KB |
testcase_28 | AC | 3 ms
6,940 KB |
testcase_29 | AC | 3 ms
6,940 KB |
testcase_30 | AC | 4 ms
6,944 KB |
testcase_31 | AC | 4 ms
6,944 KB |
testcase_32 | AC | 2 ms
6,940 KB |
testcase_33 | AC | 3 ms
6,940 KB |
testcase_34 | AC | 4 ms
6,940 KB |
testcase_35 | AC | 3 ms
6,944 KB |
testcase_36 | AC | 4 ms
6,940 KB |
testcase_37 | AC | 3 ms
6,940 KB |
testcase_38 | AC | 4 ms
6,940 KB |
testcase_39 | AC | 3 ms
6,944 KB |
testcase_40 | AC | 3 ms
6,940 KB |
testcase_41 | AC | 5 ms
6,944 KB |
testcase_42 | AC | 4 ms
6,940 KB |
testcase_43 | AC | 3 ms
6,940 KB |
testcase_44 | AC | 3 ms
6,940 KB |
testcase_45 | AC | 2 ms
6,940 KB |
testcase_46 | AC | 3 ms
6,940 KB |
testcase_47 | AC | 4 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 2 ms
6,944 KB |
testcase_50 | AC | 2 ms
6,940 KB |
testcase_51 | AC | 2 ms
6,944 KB |
testcase_52 | AC | 2 ms
6,940 KB |
testcase_53 | AC | 4 ms
6,944 KB |
testcase_54 | AC | 3 ms
6,940 KB |
testcase_55 | AC | 4 ms
6,940 KB |
ソースコード
#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> #include <bitset> 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; vector<int> as; void read() { cin >> n; take(as, 1 << n); } int at(int i, int pos) { return (as[i] >> pos) & 1; } using RetType = void; RetType run1() { int N = 1 << n; vector<int> ones(N, 30); for (bool upd = 1; upd; ) { upd = 0; dump(upd) for (int i : range(1, N)) for (int j : range(1, N)) if (i != j) { int k = i ^ j; if (as[i] != -1 && as[j] != -1 && as[k] != -1 && as[k] < (as[i] ^ as[j])) { cout << "No" << endl; return; } // propagate if (as[k] != -1) continue; int zeroi = 0, zeroj = 0; int pos = ones[k] - 1; if (pos < 0) continue; if (as[i] != -1 && !at(i, pos)) zeroi = 1; if (as[i] == -1 && ones[i] <= pos) zeroi = 1; if (as[j] != -1 && !at(j, pos)) zeroj = 1; if (as[j] == -1 && ones[j] <= pos) zeroj = 1; if (i == 4 && j == 3) { dump(zeroi << " " << zeroj) } if (zeroi && zeroj && as[k] == -1) { ones[k]--; upd = 1; } } } vector<int> res(N); ones[0] = 0; for (int i : range(N)) { if (as[i] == -1) { res[i] = (1 << ones[i]) - 1; } else res[i] = as[i]; } dump(res); for (int i : range(N)) if (res[i] < (res[0] ^ res[i])) { cout << "No" << endl; return; } for (int i : range(1, N)) for (int j : range(1, N)) if (i != j) { int k = i ^ j; if (res[k] < (res[i] ^ res[j])) { dump("FAIL"); using B = bitset<30>; dump(k << " " << i << " " << j) dump(B(res[k]).to_string() << " " << B(res[i]).to_string() << " " << B(res[j]).to_string()); assert(0); } } cout << "Yes" << endl; for (int i : range(N)) cout << res[i] << " "; cout << endl; } RetType run2() { int N = 1 << n; vector<int> A(as); for (int i : range(N)) A[i] = max(0, A[i]); for (bool upd = 1; upd; ) { upd = 0; for (int i : range(N)) for (int j : range(N)) if (i != j) { int k = i ^ j; if (as[k] == -1 && A[k] < (A[i] ^ A[j])) { A[k] = (A[i] ^ A[j]); upd = 1; } } } for (int i : range(N)) for (int j : range(N)) { int k = i ^ j; if (A[k] < (A[i] ^ A[j])) { cout << "No" << endl; return; } } cout << "Yes" << endl; for (int i : range(N)) cout << A[i] << " "; cout << endl; } RetType run() { int N = 1 << n; vector<int> A(N); vector<int> unknown(N); for (int i : range(N)) { A[i] = as[i] == -1 ? ((1 << 30) - 1) : as[i]; unknown[i] = as[i] == -1; } for (int pos = 29; pos >= 0; --pos) { vector<int> sb(N); for (int i : range(N)) sb[i] = A[i] >> pos; for (bool upd = 1; upd; ) { upd = 0; for (int i : range(N)) for (int j : range(N)) if (i != j) { int k = i ^ j; if (unknown[i] && sb[k] < (sb[i] ^ sb[j])) { if (sb[i] & 1) { sb[i] ^= 1; A[i] ^= 1 << pos; upd = 1; } } } } vector<int> d(sb); for (auto& e : d) e &= 1; dump(d); } dump(A); for (int i : range(N)) for (int j : range(N)) if (i != j) { int k = i ^ j; if (A[k] < (A[i] ^ A[j])) { cout << "No" << endl; return; } } cout << "Yes" << endl; for (int i : range(N)) cout << A[i] << " "; 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); }