結果

問題 No.1652 XOR Inequalities
ユーザー ir5
提出日時 2024-06-23 21:53:59
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,487 bytes
コンパイル時間 3,198 ms
コンパイル使用メモリ 146,644 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-23 21:54:13
合計ジャッジ時間 8,870 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 27 WA * 26
権限があれば一括ダウンロードができます

ソースコード

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>
#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] = max(0, 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[k] && sb[k] < (sb[i] ^ sb[j])) {
sb[k] ^= 1;
upd = 1;
}
}
}
for (int i : range(N)) if (unknown[i]) A[i] ^= (sb[i] & 1) << pos;
}
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);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0