結果
問題 | No.1078 I love Matrix Construction |
ユーザー |
|
提出日時 | 2020-06-28 18:39:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 284 ms / 2,000 ms |
コード長 | 7,525 bytes |
コンパイル時間 | 4,120 ms |
コンパイル使用メモリ | 223,048 KB |
最終ジャッジ日時 | 2025-01-11 13:25:48 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 22 |
ソースコード
#pragma GCC optimize ("O3")#include "bits/stdc++.h"using namespace std;using ll = long long int;#define all(v) (v).begin(),(v).end()#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')';return o; }template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }void bye(string s, int code = 0) { cout << s << endl; exit(code); }mt19937_64 randdev(8901016);template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }template <typename I>struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };template<typename I>static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';return o << ']';}template <typename I>struct MyMatrixFormat{const I& p; long long n, m;MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}};template<typename I>static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {o<<'\n';repeat(i,(f.n)) {repeat(j,f.m) o<<f.p[i][j]<<' ';o<<'\n';}return o;}struct LOG_t { ~LOG_t() { cout << endl; } };#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))#define FMTV(v) FMTR(v.begin(),v.end())#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))#if defined(_WIN32) || defined(_WIN64)#define getc_x _getc_nolock#define putc_x _putc_nolock#elif defined(__GNUC__)#define getc_x getc_unlocked#define putc_x putc_unlocked#else#define getc_x getc#define putc_x putc#endifclass MaiScanner {FILE* fp_;constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }public:inline MaiScanner(FILE* fp):fp_(fp){}template<typename T> void input_integer(T& var) noexcept {var = 0; T sign = 1;int cc = getc_x(fp_);for (; cc < '0' || '9' < cc; cc = getc_x(fp_))if (cc == '-') sign = -1;for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))var = (var << 3) + (var << 1) + cc - '0';var = var * sign;}inline int c() noexcept { return getc_x(fp_); }template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }inline MaiScanner& operator>>(string& var) {int cc = getc_x(fp_);for (; !isvisiblechar(cc); cc = getc_x(fp_));for (; isvisiblechar(cc); cc = getc_x(fp_))var.push_back(cc);return *this;}template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }};class MaiPrinter {FILE* fp_;public:inline MaiPrinter(FILE* fp):fp_(fp){}template<typename T>void output_integer(T var) noexcept {if (var == 0) { putc_x('0', fp_); return; }if (var < 0)putc_x('-', fp_),var = -var;char stack[32]; int stack_p = 0;while (var)stack[stack_p++] = '0' + (var % 10),var /= 10;while (stack_p)putc_x(stack[--stack_p], fp_);}inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }inline MaiPrinter& operator<<(const string& str) {const char* p = str.c_str();const char* l = p + str.size();while (p < l) putc_x(*p++, fp_);return *this;}template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin :*this << *begin; }};MaiScanner scanner(stdin);MaiPrinter printer(stdout);class DGraph {public:int n;vector<vector<int>> vertex_to;vector<vector<int>> vertex_from;explicit DGraph(int n = 1) : n(n), vertex_to(n), vertex_from(n) {}inline int size() const { return n; }void resize(int _n) {n = _n;vertex_to.resize(_n);vertex_from.resize(_n);}void connect(int from, int to) {vertex_to[(int)from].emplace_back(to);vertex_from[(int)to].emplace_back(from);}};class Sat2 {public:int n;DGraph graph;Sat2(int n) : n(n), graph(n * 2) {}private:inline int _cv(int v) { return 0 < v ? (v - 1) * 2 : (-v - 1) * 2 + 1; }vector<int> label_, postorder_;void solveScc_dfs1(int v) {if (label_[v] < 0)return;label_[v] = -1;for (int to : graph.vertex_to[v])solveScc_dfs1(to);postorder_.push_back(v);}void solveScc_dfs2(int v, int rank) {if (label_[v] > 0)return;label_[v] = rank;for (int to : graph.vertex_from[v])solveScc_dfs2(to, rank);}public:// 1 <= a <= n OR -1 >= a >= -n// 正ならばx_a,負ならばNOT x_aを表現.inline void push(int a, int b) {assert(a != 0 && b != 0);graph.connect(_cv(-a), _cv(b));graph.connect(_cv(-b), _cv(a));}vector<int> solve() {label_.resize(graph.n);postorder_.reserve(graph.n);for (int i = 0; i < graph.n; ++i)if (label_[i] == 0)solveScc_dfs1(i);for (int i = (int)postorder_.size() - 1; 0 <= i; --i)if (label_[postorder_[i]] <= 0)solveScc_dfs2(postorder_[i], i + 1);vector<int> result(n);for (int i = 0; i < n; ++i) {if (label_[i * 2] == label_[i * 2 + 1])return {};result[i] = (label_[i * 2] < label_[i * 2 + 1]);}return result;}};//int N;int S[505];int T[505];int U[505];//inline int cv(int y, int x) noexcept {return y*N+x;}// https://yukicoder.me/submissions/496115int main() {scanner >> N;scanner.in(S, S+N);scanner.in(T, T+N);scanner.in(U, U+N);Sat2 sat(N*N);repeat(i, N) {int s = S[i]-1;int t = T[i]-1;int u = U[i];// int x = (u&1) ? -1 : 1;// int y = (u&2) ? -1 : 1;repeat(j, N) {// LOG << s << ' ' << j;// LOG << j << ' ' << t;// LOG << u;// sat.emplace(x*(cv(s,j)+1), y*(cv(j,t)+1));int x = (cv(s,j)+1);int y = (cv(j,t)+1);if (u&1) x = -x;if (u&2) y = -y;sat.push(x, y);}}// vector<bool> result;// if (!sat.solve(result)) bye("-1");auto res = sat.solve();if (res.empty()) bye("-1");repeat(i, N) {repeat(j, N) {printer << (int)res[i*N+j] << ' ';}printer << '\n';}return 0;}