結果
| 問題 | No.1078 I love Matrix Construction |
| ユーザー |
 heno239
|
| 提出日時 | 2020-06-12 21:51:20 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 601 ms / 2,000 ms |
| コード長 | 5,145 bytes |
| コンパイル時間 | 2,068 ms |
| コンパイル使用メモリ | 135,888 KB |
| 実行使用メモリ | 108,972 KB |
| 最終ジャッジ日時 | 2024-06-24 04:52:36 |
| 合計ジャッジ時間 | 10,570 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acos(-1.0);struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n%mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, int n) {if (n == 0)return modint(1);modint res = (a*a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 20;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}struct graph {private:int n;vector<vector<int>> G, rG;vector<bool> used;vector<int> vs;int mk;vector<vector<int>> fG;vector<vector<int>> ori;vector<int> trans;public:graph(int sz) {n = sz;G.resize(n);rG.resize(n);used.resize(n);fG.resize(n);trans.resize(n, -1);ori.resize(n);}void add_edge(int a, int b) {G[a].push_back(b);rG[b].push_back(a);}void dfs(int v) {used[v] = true;rep(i, G[v].size()) {if (!used[G[v][i]])dfs(G[v][i]);}vs.push_back(v);}void rdfs(int v, int k) {used[v] = true;queue<int> q; q.push(v);vector<int> c;while (!q.empty()) {int id = q.front(); q.pop();ori[k].push_back(id);rep(j, rG[id].size()) {int to = rG[id][j];if (used[to]) {if (trans[to] >= 0)c.push_back(trans[to]);continue;}used[to] = true; q.push(to);}}sort(c.begin(), c.end());int len = unique(c.begin(), c.end()) - c.begin();rep(i, len) {fG[c[i]].push_back(k);}rep(i, ori[k].size()) {trans[ori[k][i]] = k;}}void scc() {fill(used.begin(), used.end(), false);rep(i, n) {if (!used[i])dfs(i);}fill(used.begin(), used.end(), false);int k = 0;per(i, (int)vs.size()) {if (!used[vs[i]]) {rdfs(vs[i], k); k++;}}mk = k;}void query(int d) {int sz = d * d;rep(i, sz) {if (trans[i] == trans[i + sz]) {cout << -1 << "\n"; return;}}vector<bool> used(sz,false);vector<int> ans(sz);vector<bool> valid(mk, true);per(i, mk) {for (int to : fG[i]) {if (!valid[to]) {valid[i] = false;}}for (int id : ori[i]) {if (used[id%sz])valid[i] = false;}if (!valid[i])continue;for (int id : ori[i]) {used[id%sz] = true;ans[id%sz] = id / sz;}}rep(i, d){rep(j, d) {if (j > 0)cout << " ";cout << ans[i*d+j];}cout << "\n";}}};void solve() {int n; cin >> n;vector<int> s(n);rep(i, n) {cin >> s[i]; s[i]--;}vector<int> t(n);rep(i, n) {cin >> t[i]; t[i]--;}vector<int> u(n);rep(i, n)cin >> u[i];int nn = n * n;graph g(2 * nn);rep(i, n) {rep(j, n) {int l = s[i] * n + j;int r = j * n + t[i];if (u[i] == 0) {g.add_edge(l, r + nn);g.add_edge(r, l + nn);}else if (u[i] == 1) {g.add_edge(l + nn, r + nn);g.add_edge(r, l);}else if (u[i] == 2) {g.add_edge(l, r);g.add_edge(r + nn, l + nn);}else {g.add_edge(l + nn, r);g.add_edge(r + nn, l);}}}g.scc();g.query(n);}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f();//init();//int t; cin >> t;rep(i,t)solve();stopreturn 0;}