#496127 (C++17) No.1078 I love Matrix Construction

提出ソース

結果

問題	No.1078 I love Matrix Construction
ユーザー	ningenMe
提出日時	2020-06-12 23:03:22
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,686 bytes
コンパイル時間	2,844 ms
コンパイル使用メモリ	220,240 KB
実行使用メモリ	53,992 KB
最終ジャッジ日時	2024-06-24 05:47:40
合計ジャッジ時間	9,336 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	25 ms 10,940 KB
testcase_03	AC	102 ms 22,836 KB
testcase_04	AC	134 ms 29,912 KB
testcase_05	WA	-
testcase_06	AC	26 ms 10,752 KB
testcase_07	AC	8 ms 6,944 KB
testcase_08	AC	111 ms 25,724 KB
testcase_09	WA	-
testcase_10	AC	309 ms 53,992 KB
testcase_11	AC	148 ms 31,332 KB
testcase_12	AC	237 ms 45,248 KB
testcase_13	AC	278 ms 50,400 KB
testcase_14	AC	188 ms 36,448 KB
testcase_15	AC	249 ms 47,976 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	18 ms 8,960 KB
testcase_19	AC	49 ms 15,708 KB
testcase_20	AC	45 ms 15,564 KB
testcase_21	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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" : "no") << endl;}

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class StronglyConnectedComponents{
	int nodeNum;
	vector<vector<int>> edge,revEdge;

	vector<int> label,visited,order;

	void dfs(int curr){
		visited[curr] = 1;
		for(int next:edge[curr]) if(!visited[next]) dfs(next);
		order.push_back(curr);
	}

	void revDfs(int curr,int labelId){
		visited[curr] = 1;
		label[curr] = labelId;
		for(int next:revEdge[curr]) if(!visited[next]) revDfs(next,labelId);
	}

public:

	StronglyConnectedComponents(const int& nodeNum) : 
	nodeNum(nodeNum), edge(nodeNum), revEdge(nodeNum), label(nodeNum), visited(nodeNum) {
		// do nothing        
	}

	int operator[](int idx) {
		return label[idx];
	}

	void makeEdge(const int from,const int to) {
		edge[from].push_back(to);
		revEdge[to].push_back(from);
	}

	void solve(void) {
		for(int i = 0; i < nodeNum; ++i) visited[i] = 0;
		for(int i = 0; i < nodeNum; ++i) if(!visited[i]) dfs(i);
		for(int i = 0; i < nodeNum; ++i) visited[i] = 0;
		reverse(order.begin(),order.end());
		int labelId = 0;
		for(int i:order) if(!visited[i]) revDfs(i,labelId++);
	}

	void print(void) {
		for(auto labelId:label) cout << labelId << " ";
		cout << endl;
	}

};

/*
 * @title UnionFindTree
 */
class UnionFindTree {
public:
	vector<int> parent;
	vector<int> rank;

	UnionFindTree(int N) : parent(N), rank(N,0){
		iota(parent.begin(),parent.end(),0);
	} 
	int root(int n) {
		return (parent[n] == n ? n : parent[n] = root(parent[n]));
	}
	inline int same(int n, int m) {
		return root(n) == root(m);
	}
	inline void unite(int n, int m) {
		n = root(n);
		m = root(m);
		if (n == m) return;
		if (rank[n]<rank[m]) {
			parent[n] = m;
		}
		else{
			parent[m] = n;
			if(rank[n] == rank[m]) rank[n]++;
		}
	}
};

int main(void){
	int N; cin >> N;
	//[0,N*N)       i番目は0
	//[N*N,2*N*N)   i番目は1
	StronglyConnectedComponents scc(2*N*N);
    vector<int> S(N),T(N),U(N);
    UnionFindTree uf(2*N*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.makeEdge(s,t+N*N);
                scc.makeEdge(t,s+N*N);
                uf.unite(s,t+N*N);
                uf.unite(t,s+N*N);
            }
            if(U[i]==1) {
                //ab=1&&cd=0がだめ
                scc.makeEdge(s+N*N,t+N*N);
                scc.makeEdge(t,s);
                uf.unite(s+N*N,t+N*N);
                uf.unite(t,s);
            }
            if(U[i]==2) {
                //ab=0&&cd=1がだめ
                scc.makeEdge(s,t);
                scc.makeEdge(t+N*N,s+N*N);
                uf.unite(s,t);
                uf.unite(t+N*N,s+N*N);
            }
            if(U[i]==3) {
                //ab=1&&cd=1がだめ
                scc.makeEdge(s+N*N,t);
                scc.makeEdge(t+N*N,s);
                uf.unite(s+N*N,t);
                uf.unite(t+N*N,s);
            }
        }
    }
    scc.solve();
	int flg = 1;
	for(int i = 0; i < N*N; ++i) if(scc[i]==scc[i+N*N]) flg = 0;
    corner(!flg,-1);

    vector<vector<int>> v(2*N*N);
    for(int i = 0; i < 2*N*N; ++i) {
        v[uf.root(i)].push_back(i);
    }

    vector<int> bl(2*N*N,-1);
    for(int i = 0; i < 2*N*N; ++i) {
        int s = uf.root(i);
        if(bl[s]!=-1) continue;
        queue<pair<int,int>> q;
        bl[s]=1;
        q.push({s,bl[s]});
        while(q.size()){
            auto p = q.front();
            q.pop();
            int c = p.first;
            for(int j:v[c]) {
                int k;
                if(j<N*N ) k=j+N*N;
                if(N*N<=j) k=j-N*N;
                int t = uf.root(k);
                if(bl[t]!=-1) continue;
                bl[t]=p.second^1;
                q.push({t,bl[t]});
            }
        }
    }
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j < N; ++j) {
            int k = i*N+j;
            cout << bl[uf.root(k)] << " ";
        }
        cout << endl;
    }
	return 0;
}

yukicoder

結果

テストケース

ソースコード