test/aoj2991.memo.cpp

Back to top page

• category: test
• View this file on GitHub
  • Last commit date: 2020-03-01 12:39:31+09:00
• see: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2991

Depends on

• graph/SCC.cpp
• graph/twosat.cpp
• memo/macro.hpp

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2991"
#include "../memo/macro.hpp"
#include "../graph/SCC.cpp"
#include "../graph/twosat.cpp"

// これスペシャルジャッジ
int main() {
    ll n, x, a, o;
    cin >> n >> x >> a >> o;

    if(x == 0) {
        cout << "No" << endl;
        return 0;
    }

    const ll m = 1LL<<(n+1);
    twoSAT sat(m);
    // xor
    REP(i, m) {
        sat.add({i, false}, {x^i, false});
        sat.add({i, true}, {x^i, true});
    }
    // and
    REP(i, m) {
        if((i&a)!=a) continue;
        ll sub = (m-1)^i;
        while(true) {
            sat.add({i, false}, {a^sub, false});
            if(sub == 0) break;
            sub = (sub-1) & ((m-1)^i);
        }
    }
    // or
    REP(i, m) {
        if((i|o)!=o) continue;
        ll sub = i;
        while(true) {
            sat.add({i, false}, {((~i)&o)^sub, false});
            if(sub == 0) break;
            sub = (sub-1) & i;
        }
    }

    if(!sat.solve()) {
        cout << "No" << endl;
        return 0;
    }
    cout << "Yes" << endl;
    vector<ll> ret;
    REP(i, m) if(sat.ans[i]) ret.push_back(i);
    REP(i, m/2) cout << ret[i] << (i==m/2-1?'\n':' ');

    return 0;
}

#line 1 "test/aoj2991.memo.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2991"
#line 1 "memo/macro.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a, const T &b) { a = max(a, b); }
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
const ll INF = 1LL<<60;
#line 1 "graph/SCC.cpp"
// BEGIN CUT
struct SCC {
    int V, K;
    vector<vector<int>> G;
    vector<vector<int>> rG;
    vector<int> vs;
    vector<int> used;
    vector<int> cmp;

    void dfs(int v) {
        used[v]=true;
        for(int nx: G[v]) if(!used[nx]) dfs(nx);
        vs.push_back(v);
    }
    void rdfs(int v,int k) {
        used[v]=true; cmp[v]=k;
        for(int nx: rG[v]) if(!used[nx]) rdfs(nx,k);
    }

    SCC() { V=K=-1; }
    SCC(int V_): V(V_), G(V_), rG(V_), used(V_), cmp(V_) {}

    void add_edge(int from,int to) {
        G[from].push_back(to);
        rG[to].push_back(from);
    }
    int scc() {
        used.assign(V,0); vs.clear();
        for(int v=0;v<V;v++) if(!used[v]) dfs(v);
        used.assign(V,0);
        int k=0;
        for(int i=(int)vs.size()-1;i>=0;i--) if(!used[vs[i]]) {
            rdfs(vs[i],k++);
        }
        return K=k;
    }
    // O(ElogE)
    // SCCしたあとのグラフはトポロジカル順になってる
    vector<vector<int>> getDAG() {
        vector<vector<int>> res(K);
        for(int from=0;from<V;from++) {
            for(int to:G[from]) if(cmp[from]!=cmp[to]) {
                res[cmp[from]].push_back(cmp[to]);
            }
        }
        for(int i=0;i<K;i++){
            sort(ALL(res[i]));
            res[i].erase(unique(ALL(res[i])),res[i].end());
        }
        return res;
    }
};
// END CUT
#line 1 "graph/twosat.cpp"
// BEGIN CUT
struct twoSAT {
    ll n;
    SCC graph;
    vector<bool> ans;
    twoSAT(ll n) : n(n), graph(n*2), ans(n) {}
    // not なら false
    void add(pair<ll,bool> a0, pair<ll,bool> b0) {
        ll a = a0.first, ar = (a0.first+n)%(2*n);
        ll b = b0.first, br = (b0.first+n)%(2*n);
        if(!a0.second) swap(a, ar);
        if(!b0.second) swap(b, br);
        graph.add_edge(ar, b);
        graph.add_edge(br, a);
    }
    bool solve() {
        graph.scc();
        REP(i, n) if(graph.cmp[i] == graph.cmp[n+i]) return false;
        REP(i, n) ans[i] = graph.cmp[i] > graph.cmp[n+i];
        return true;
    }
};
// END CUT
#line 5 "test/aoj2991.memo.cpp"

// これスペシャルジャッジ
int main() {
    ll n, x, a, o;
    cin >> n >> x >> a >> o;

    if(x == 0) {
        cout << "No" << endl;
        return 0;
    }

    const ll m = 1LL<<(n+1);
    twoSAT sat(m);
    // xor
    REP(i, m) {
        sat.add({i, false}, {x^i, false});
        sat.add({i, true}, {x^i, true});
    }
    // and
    REP(i, m) {
        if((i&a)!=a) continue;
        ll sub = (m-1)^i;
        while(true) {
            sat.add({i, false}, {a^sub, false});
            if(sub == 0) break;
            sub = (sub-1) & ((m-1)^i);
        }
    }
    // or
    REP(i, m) {
        if((i|o)!=o) continue;
        ll sub = i;
        while(true) {
            sat.add({i, false}, {((~i)&o)^sub, false});
            if(sub == 0) break;
            sub = (sub-1) & i;
        }
    }

    if(!sat.solve()) {
        cout << "No" << endl;
        return 0;
    }
    cout << "Yes" << endl;
    vector<ll> ret;
    REP(i, m) if(sat.ans[i]) ret.push_back(i);
    REP(i, m/2) cout << ret[i] << (i==m/2-1?'\n':' ');

    return 0;
}

Back to top page