結果
問題 | No.1225 I hate I hate Matrix Construction |
ユーザー |
![]() |
提出日時 | 2020-07-27 23:07:06 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 2,888 bytes |
コンパイル時間 | 2,379 ms |
コンパイル使用メモリ | 200,708 KB |
最終ジャッジ日時 | 2025-01-12 07:01:38 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 35 |
ソースコード
#include<bits/stdc++.h>using namespace std;#pragma region Macros#define ios\ios::sync_with_stdio(false);\cin.tie(nullptr);#define VEC(type, name, size)\V<type> name(size);\IN(name)#define VVEC(type, name, h, w)\VV<type> name(h, V<type>(w));\IN(name)#define INT(...)\int __VA_ARGS__;\IN(__VA_ARGS__)#define LL(...)\ll __VA_ARGS__;\IN(__VA_ARGS__)#define STR(...)\string __VA_ARGS__;\IN(__VA_ARGS__)#define CHAR(...)\char __VA_ARGS__;\IN(__VA_ARGS__)#define DOUBLE(...)\DOUBLE __VA_ARGS__;\IN(__VA_ARGS__)#define LD(...)\LD __VA_ARGS__;\IN(__VA_ARGS__)template <class T> void scan(T &a) { cin >> a; }template <class T> void scan(vector<T> &a) { for(auto &i : a) scan(i); }template <class T, class L> void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &... tail) { scan(head); IN(tail...); }template <class T> inline void print(T &x){ cout << x << '\n';}#define ll long long#define ld long double#define FOR(i,l,r) for(ll i=(l);i<(r);++i)#define REP(i,n) FOR(i,0,n)#define REPS(i,n) FOR(i,1,n+1)#define RFOR(i,l,r) for(ll i=(l);i>=(r);--i)#define RREP(i,n) RFOR(i,n-1,0)#define RREPS(i,n) RFOR(i,n,1)#define pb push_back#define eb emplace_back#define SZ(x) ((ll)(x).size())#define all(x) (x).begin(),(x).end()#define rall(x) (x).rbegin(),(x).rend()template<class T = ll> using V = vector<T>;template<class T = ll> using VV = V<V<T>>;template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true; }return false; }template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true; }return false; }inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';}inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';}inline void err(bool b = true) {if(b) {cout << -1 << '\n'; exit(0);}}template<class T> inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n'; exit(0);}}template<class T> T Roundup_div(T x, T y) {return (x+(y-1))/y;}template <typename T> T pow(T a, long long n, T e = 1) {T ret = e; while (n) {if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; }const ll INF = 1e18;#pragma endregionint main(){ios;INT(n);VEC(int, s, n);VEC(int ,t, n);VV<> mat(n, V<>(n, 0));REP(i, n)if(s[i] == 2){REP(j, n) mat[i][j] = 1;}REP(j, n)if(t[j] == 2){REP(i, n) mat[i][j] = 1;}ll res = 0;REP(i, n) REP(j, n) res += mat[i][j];ll xc = 0, yc = 0;REP(i, n)if(s[i] == 1){bool exi = false;REP(j, n) if(mat[i][j] == 1) exi = true;if(!exi) xc++;}REP(j, n)if(t[j] == 1){bool exi = false;REP(i, n) if(mat[i][j] == 1) exi = true;if(!exi) yc++;}cout << res + max(xc, yc) << '\n';}