結果

問題 No.1078 I love Matrix Construction
ユーザー raoZraoZ
提出日時 2020-06-13 00:23:31
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 227 ms / 2,000 ms
コード長 7,072 bytes
コンパイル時間 1,645 ms
コンパイル使用メモリ 125,308 KB
実行使用メモリ 49,228 KB
最終ジャッジ日時 2024-06-24 06:10:35
合計ジャッジ時間 7,256 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 25 ms
10,164 KB
testcase_03 AC 89 ms
20,984 KB
testcase_04 AC 126 ms
27,392 KB
testcase_05 AC 94 ms
23,496 KB
testcase_06 AC 19 ms
9,996 KB
testcase_07 AC 8 ms
6,144 KB
testcase_08 AC 80 ms
23,612 KB
testcase_09 AC 5 ms
5,376 KB
testcase_10 AC 208 ms
49,228 KB
testcase_11 AC 128 ms
28,684 KB
testcase_12 AC 207 ms
41,352 KB
testcase_13 AC 190 ms
46,028 KB
testcase_14 AC 124 ms
33,524 KB
testcase_15 AC 227 ms
43,832 KB
testcase_16 AC 8 ms
5,376 KB
testcase_17 AC 3 ms
5,376 KB
testcase_18 AC 19 ms
8,576 KB
testcase_19 AC 49 ms
14,616 KB
testcase_20 AC 44 ms
14,364 KB
testcase_21 AC 3 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
#include<array>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int,int>;
using piii = pair<pii,int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>inline bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>inline bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void in(void){return;}
template <typename First, typename... Rest> void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}
inline void out(void){cout << "\n";return;}
template <typename First, typename... Rest> void out(First first, Rest... rest){cout << first << " ";out(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
}
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
    os << p.first << " " << p.second;
    return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}
template<class T> vector<T> make_vec(size_t a) {return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts){
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class S, class T> pair<S,T> operator*(const pair<S,T> &s, const S& t){return pair<S,T>(s.first*t, s.second*t);}
template <typename T> void Exit(T first){cout << first << endl;exit(0); };
template< int mod > struct ModInt {
    unsigned x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1,0), pii(0, 1), pii(-1, 0), pii(0, -1)};
bool range(int a, int b, int x){if(a <= x and x < b)return true;else return false;}
bool range(int a, int b, int c, int d, pii p){if(a <= p.first and p.first < b and c <= p.second and p.second < d) return true;else return false;}

class TwoSAT{
private:
    const int V;
    vector<vector<int> > G, rG;
    vector<int> ps, cmp;
    void add_edge(int from, int to){
        G[from].emplace_back(to), rG[to].emplace_back(from);
    }
    void dfs(int u){
        cmp[u] = 0;
        for(int v: G[u]){
            if(cmp[v] == -1) dfs(v);
        }
        ps.push_back(u);
    }
    void rdfs(int u, int k){
        cmp[u] = k;
        for(int v: rG[u]){
            if(cmp[v] == -1) rdfs(v, k);
        }
    }
    int scc(){
        for(int i = 0; i < 2 * V; i++){
            if(cmp[i] == -1) dfs(i);
        }
        fill(cmp.begin(), cmp.end(), -1);
        int k = 0;
        for(int i = 2 * V - 1; i >= 0; i--){
            if(cmp[ps[i]] == -1) rdfs(ps[i], k++);
        }
        return k;
    }
public:
    vector<int> ans;
    TwoSAT(const int literal_count)
        : V(literal_count), G(2 * V), rG(2 * V), cmp(2 * V, -1), ans(V){}
    void add_closure(int x, int y){
        add_edge((x + V) % (2 * V), y), add_edge((y+V)% (2 * V), x);
    } 
    // 真のものは 1,偽のものは 0 が ans に格納される(解の構成)
    bool satisfy(){
        scc();
        for(int i = 0; i < V; i++){
            if(cmp[i] == cmp[V + i]) return false;
            ans[i] = (cmp[i] > cmp[V + i]);
        }
        return true;
    }
};
// int V;
// TwoSAT st(V);


int main(){
    iosetup();
    int n; cin >> n;
    vector<int> S(n), T(n), U(n);
    cin >> S >> T >> U;
    rep(i, 0, n) S[i]--, T[i]--;
    int V = n * n;
    TwoSAT st(V);

    rep(i, 0, n){
        if(U[i] == 0){
            rep(j, 0, n) st.add_closure(S[i] * n + j, j * n + T[i]);
        }else if(U[i] == 1){
            rep(j, 0, n) st.add_closure(S[i] * n + j + V, j * n + T[i]);
        }else if(U[i] == 2){
            rep(j, 0, n) st.add_closure(S[i] * n + j, j * n + T[i] + V);
        }else{
            rep(j, 0, n) st.add_closure(S[i] * n + j + V, j * n + T[i] + V);
        }
    }
    if(!st.satisfy()) Exit(-1);
    auto ans = make_vec<int>(n, n);
    rep(i, 0, V) ans[i/n][i%n] = st.ans[i];
    rep(i, 0, n) cout << ans[i] << endl;
    return 0;
}
0