結果
| 問題 | No.1078 I love Matrix Construction |
| ユーザー |
 tatyam
|
| 提出日時 | 2020-06-12 22:42:04 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 498 ms / 2,000 ms |
| コード長 | 12,157 bytes |
| コンパイル時間 | 3,583 ms |
| コンパイル使用メモリ | 227,592 KB |
| 最終ジャッジ日時 | 2025-01-11 02:46:03 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 |
コンパイルメッセージ
main.cpp: In function ‘void scan(int&)’:
main.cpp:84:25: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
84 | void scan(int& a){ scanf("%d", &a); }
| ~~~~~^~~~~~~~~~
main.cpp: In function ‘void scan(unsigned int&)’:
main.cpp:85:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
85 | void scan(unsigned& a){ scanf("%u", &a); }
| ~~~~~^~~~~~~~~~
main.cpp: In function ‘void scan(long int&)’:
main.cpp:86:26: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
86 | void scan(long& a){ scanf("%ld", &a); }
| ~~~~~^~~~~~~~~~~
main.cpp: In function ‘void scan(long long int&)’:
main.cpp:87:31: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
87 | void scan(long long& a){ scanf("%lld", &a); }
| ~~~~~^~~~~~~~~~~~
main.cpp: In function ‘void scan(long long unsigned int&)’:
main.cpp:88:40: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
88 | void scan(unsigned long long& a){ scanf("%llu", &a); }
| ~~~~~^~~~~~~~~~~~
main.cpp: In function ‘void scan(float&)’:
main.cpp:90:27: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
90 | void scan(float& a){ scanf("%f", &a); }
| ~~~~~^~~~~~~~~~
main.cpp: In function ‘void scan(double&)’:
main.cpp:91:28: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using ull = unsigned long long;using uint = unsigned;using pcc = pair<char, char>;using pii = pair<int, int>;using pll = pair<ll, ll>;using pdd = pair<double, double>;using tuplis = array<ll, 3>;template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;const ll LINF=0x1fffffffffffffff;const ll MINF=0x7fffffffffff;const int INF=0x3fffffff;const int MOD=1000000007;const int MODD=998244353;const ld DINF=numeric_limits<ld>::infinity();const ld EPS=1e-9;const ld PI=3.1415926535897932;const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};#define overload4(_1,_2,_3,_4,name,...) name#define overload3(_1,_2,_3,name,...) name#define rep1(n) for(ll i=0;i<n;++i)#define rep2(i,n) for(ll i=0;i<n;++i)#define rep3(i,a,b) for(ll i=a;i<b;++i)#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)#define rrep1(n) for(ll i=(n);i--;)#define rrep2(i,n) for(ll i=(n);i--;)#define rrep3(i,a,b) for(ll i=(b);i-->(a);)#define rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)#define each(i,a) for(auto&& i:a)#define eachs2(x,y,a) for(auto&& [x,y]:a)#define eachs3(x,y,z,a) for(auto&& [x,y,z]:a)#define eachs(...) overload4(__VA_ARGS__,eachs3,eachs2)(__VA_ARGS__)#define all1(i) begin(i),end(i)#define all2(i,a) begin(i),begin(i)+a#define all3(i,a,b) begin(i)+a,begin(i)+b#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)#define rall1(i) (i).rbegin(),(i).rend()#define rall2(i,k) (i).rbegin(),(i).rbegin()+k#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)#define sum(...) accumulate(all(__VA_ARGS__),0LL)#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)#define elif else if#define unless(a) if(!(a))#define mp make_pair#define mt make_tuple#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)#define Sort(a) sort(all(a))#define Rev(a) reverse(all(a))#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))#define vec(type,name,...) vector<type> name(__VA_ARGS__)#define VEC(type,name,size) vector<type> name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))template<class T> auto min(const T& a){ return *min_element(all(a)); }template<class T> auto max(const T& a){ return *max_element(all(a)); }inline ll popcnt(ull a){ return __builtin_popcountll(a); }ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }template<class T, class U> bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }template<class T, class U> bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }vector<ll> iota(ll n){ vector<ll> a(n); iota(a.begin(), a.end(), 0); return a; }vector<pll> factor(ull x){ vector<pll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }map<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x !=1) ans[x] = 1; return ans; }vector<uint> divisor(uint x){ vector<uint> ans; for(uint i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }template<class T> unordered_map<T, ll> press(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); unordered_map<T, ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }template<class T> map<T, ll> press_map(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); map<T, ll> ans; rep(b.size())ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }int scan(){ return getchar(); }void scan(int& a){ scanf("%d", &a); }void scan(unsigned& a){ scanf("%u", &a); }void scan(long& a){ scanf("%ld", &a); }void scan(long long& a){ scanf("%lld", &a); }void scan(unsigned long long& a){ scanf("%llu", &a); }void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); }void scan(float& a){ scanf("%f", &a); }void scan(double& a){ scanf("%lf", &a); }void scan(long double& a){ scanf("%Lf", &a); }void scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }void scan(char a[]){ scanf("%s", a); }void scan(string& a){ cin >> a; }template<class T> void scan(vector<T>&);template<class T, size_t size> void scan(array<T, size>&);template<class T, class L> void scan(pair<T, L>&);template<class T, size_t size> void scan(T(&)[size]);template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }template<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }template<class T> void scan(T& a){ cin >> a; }void in(){}template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }void print(){ putchar(' '); }void print(bool a){ printf("%d", a); }void print(int a){ printf("%d", a); }void print(unsigned a){ printf("%u", a); }void print(long a){ printf("%ld", a); }void print(long long a){ printf("%lld", a); }void print(unsigned long long a){ printf("%llu", a); }void print(char a){ printf("%c", a); }void print(char a[]){ printf("%s", a); }void print(const char a[]){ printf("%s", a); }void print(float a){ printf("%.15f", a); }void print(double a){ printf("%.15f", a); }void print(long double a){ printf("%.15Lf", a); }void print(const string& a){ for(auto&& i : a) print(i); }template<class T> void print(const vector<T>&);template<class T, size_t size> void print(const array<T, size>&);template<class T, class L> void print(const pair<T, L>& p);template<class T, size_t size> void print(const T (&)[size]);template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i);} }template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }template<class T> void print(const T& a){ cout << a; }int out(){ putchar('\n'); return 0; }template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }#ifdef DEBUGinline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }#define debug(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }#else#define debug(...) void(0)#endifint first(bool i = true){ return out(i?"first":"second"); }int yes(bool i = true){ return out(i?"yes":"no"); }int Yes(bool i = true){ return out(i?"Yes":"No"); }int No(){ return out("No"); }int YES(bool i = true){ return out(i?"YES":"NO"); }int NO(){ return out("NO"); }int Yay(bool i = true){ return out(i?"Yay!":":("); }int possible(bool i = true){ return out(i?"possible":"impossible"); }int Possible(bool i = true){ return out(i?"Possible":"Impossible"); }int POSSIBLE(bool i = true){ return out(i?"POSSIBLE":"IMPOSSIBLE"); }void Case(ll i){ printf("Case #%lld: ", i); }struct UnWeightedEdge{ll to;static constexpr ll cost = 1;UnWeightedEdge(){}UnWeightedEdge(ll to): to(to){}operator ll() const { return to; }};struct UnWeightedGraph{using E = UnWeightedEdge;vector<vector<E>> g;UnWeightedGraph(){}UnWeightedGraph(ll n): g(n){}vector<E>& operator[](ll at){ return g[at]; }operator vector<vector<E>>&(){ return g; }auto begin() const { return g.cbegin(); }auto end() const { return g.cend(); }ll size() const { return g.size(); }void resize(ll n){ g.resize(n); }const vector<E>& operator[](ll at) const { return g[at]; }operator const vector<vector<E>>&() const { return g; }void add_edge(ll a, ll b){g[a].emplace_back(b);g[b].emplace_back(a);}void add_directed_edge(ll from, ll to){g[from].emplace_back(to);}template<ll start_index = 1, bool directed = false> void input_graph(ll m){while(m--){ll a, b;scanf("%lld%lld", &a, &b);a -= start_index;b -= start_index;g[a].emplace_back(b);if(!directed) g[b].emplace_back(a);}}template<ll start_index = 1> void input_tree(ll n){ input_graph<start_index>(n - 1); }};template< typename G >struct StronglyConnectedComponents {const G &g;UnWeightedGraph gg, rg;vector< int > comp, order, used;StronglyConnectedComponents(G &g) : g(g), gg(g.size()), rg(g.size()), comp(g.size(), -1), used(g.size()) {for(int i = 0; i < g.size(); i++) {for(auto e : g[i]) {gg[i].push_back((int) e);rg[(int) e].push_back(i);}}}int operator[](int k) {return comp[k];}void dfs(int idx) {if(used[idx]) return;used[idx] = true;for(int to : gg[idx]) dfs(to);order.push_back(idx);}void rdfs(int idx, int cnt) {if(comp[idx] != -1) return;comp[idx] = cnt;for(int to : rg[idx]) rdfs(to, cnt);}void build() {UnWeightedGraph t;for(int i = 0; i < gg.size(); i++) dfs(i);reverse(begin(order), end(order));int ptr = 0;for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;t.resize(ptr);for(int i = 0; i < g.size(); i++) {for(auto &to : g[i]) {int x = comp[i], y = comp[to];if(x == y) continue;t[x].push_back(y);}}}};signed main(){LL(n);VEC(ll,s,n);VEC(ll,t,n);VEC(ll,u,n);each(i,s)i--;each(i,t)i--;UnWeightedGraph g(n*n*2);auto add_edge=[&](ll a,ll b){g.add_directed_edge(a,b^1);debug(a,b^1);g.add_directed_edge(b,a^1);debug(b,a^1);};#define F(x) (x<<1)#define T(x) (x<<1|1)rep(n){ll x=s[i]*n,y=t[i];rep(j,n){if(u[i]==0)add_edge(F(x),F(y));elif(u[i]==1)add_edge(T(x),F(y));elif(u[i]==2)add_edge(F(x),T(y));else add_edge(T(x),T(y));x++;y+=n;}}StronglyConnectedComponents G(g);G.build();rep(n*n)if(G[i<<1]==G[i<<1|1])return out(-1);vv(ll,ans,n,n);vv(ll,vertex,n*n*2);rep(n*n*2)vertex[G[i]].push_back(i);each(i,vertex)each(j,i){ll x=j>>1,y=j&1;ans[x/n][x%n]=y;}each(i,ans)out(i);}