結果

問題 No.1078 I love Matrix Construction
ユーザー ningenMe
提出日時 2020-06-13 00:11:18
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 216 ms / 2,000 ms
コード長 5,420 bytes
コンパイル時間 2,785 ms
コンパイル使用メモリ 204,480 KB
最終ジャッジ日時 2025-01-11 03:18:30
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x
    .second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj
    .begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr !
    = obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") 
    << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj
    .end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "rev") << endl;}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class StronglyConnectedComponents{
    int num,is_2sat,half;
    vector<vector<int>> edge,redge;
    vector<int> label,visited,order;
    inline void dfs(int curr){
        visited[curr] = 1;
        for(int next:edge[curr]) if(!visited[next]) dfs(next);
        order.push_back(curr);
    }
    inline void rdfs(int curr,int id){
        visited[curr] = 1;
        label[curr] = id;
        for(int next:redge[curr]) if(!visited[next]) rdfs(next,id);
    }
    inline int rev(int i) { return i < half ? i + half : i - half; }
public:
    StronglyConnectedComponents(const int n, bool is_2sat=0):num(n),is_2sat(is_2sat){
        if(is_2sat) num*=2;
        edge.resize(num);
        redge.resize(num);
        label.resize(num);
        visited.resize(num);
        half=num/2;
    }
    inline int operator[](int idx) {
        return label[idx];
    }
    inline void make_edge(const int from,const int to) {
        edge[from].push_back(to);
        redge[to].push_back(from);
    }
    inline void make_condition(int x, bool flg_x, int y, bool flg_y) {
        if (!flg_x) x = rev(x);
        if (!flg_y) y = rev(y);
        make_edge(x, y);
        make_edge(rev(y), rev(x));
    }
    inline int solve(void) {
        for(int i = 0; i < num; ++i) visited[i] = 0;
        for(int i = 0; i < num; ++i) if(!visited[i]) dfs(i);
        for(int i = 0; i < num; ++i) visited[i] = 0;
        reverse(order.begin(),order.end());
        int id = 0;
        for(int i:order) if(!visited[i]) rdfs(i,id++);
        if(!is_2sat) return true;
        for (int i = 0; i < num; ++i) if (label[i] == label[rev(i)]) return false;
        return true;
    }
    int is_true(int i) {
        return label[i] > label[rev(i)];
    }
    void print(void) {
        for(auto id:label) cout << id << " ";
        cout << endl;
    }
};
int main(void){
    int N; cin >> N;
    //[0,N*N)       i番目は0
    //[N*N,2*N*N)   i番目は1
    StronglyConnectedComponents scc(N*N,1);
    vector<int> S(N),T(N),U(N);
    for(int i = 0; i < N; ++i) cin >> S[i],S[i]--;
    for(int i = 0; i < N; ++i) cin >> T[i],T[i]--;
    for(int i = 0; i < N; ++i) cin >> U[i];
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j < N; ++j) {
            int a=S[i],b=j,c=j,d=T[i];
            int s=a*N+b,t=c*N+d;
            if(U[i]==0) {
                //ab=0&&cd=0がだめ
                scc.make_condition(s,0,t,1);
            }
            if(U[i]==1) {
                //ab=1&&cd=0がだめ
                scc.make_condition(s,1,t,1);
            }
            if(U[i]==2) {
                //ab=0&&cd=1がだめ
                scc.make_condition(s,0,t,0);
            }
            if(U[i]==3) {
                //ab=1&&cd=1がだめ
                scc.make_condition(s,1,t,0);
            }
        }
    }
    int flg = scc.solve();
    corner(!flg,-1);
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j < N; ++j) {
            cout << scc.is_true(i*N+j) << " ";
        }
        cout << endl;
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0