結果
問題 | No.1225 I hate I hate Matrix Construction |
ユーザー |
![]() |
提出日時 | 2020-09-11 21:36:33 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 2,509 bytes |
コンパイル時間 | 1,927 ms |
コンパイル使用メモリ | 200,892 KB |
最終ジャッジ日時 | 2025-01-14 10:10:48 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 35 |
ソースコード
#ifdef LOCAL#define _GLIBCXX_DEBUG#endif#include<bits/stdc++.h>using namespace std;#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)#define all(x) (x).begin(), (x).end()typedef long long ll;typedef long double ld;typedef pair<ll,ll> Pll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<vvl> vvvl;constexpr ll INF = numeric_limits<ll>::max()/4;constexpr ll n_max = 2e5+10;#define int lltemplate <typename A, typename B>string to_string(pair<A, B> p);string to_string(const string &s) {return '"' + s + '"';}string to_string(const char *c) {return to_string((string) c);}string to_string(bool b) {return (b ? "true" : "false");}template <size_t N>string to_string(bitset<N> v){string res = "";for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);return res;}template <typename A>string to_string(A v) {bool first = true;string res = "{";for(const auto &x : v) {if(!first) res += ", ";first = false;res += to_string(x);}res += "}";return res;}template <typename A, typename B>string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}void debug_out() {cerr << endl;}template<typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}#ifdef LOCAL#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#else#define debug(...) 42#endiftemplate<class T>bool chmax(T &a, T b){if(a < b){a = b; return true;} return false;}template<class T>bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;}signed main(){cin.tie(nullptr);ios::sync_with_stdio(false);ll n; cin >> n;vector v(n, vector<ll>(n));bool ht = false, wt = false;ll hc = 0, wc = 0;rep(i,0,n){ll s; cin >> s;if(s == 2){ht = true;rep(j,0,n)v[i][j] = 1;}if(s == 1)hc++;}rep(j, 0, n){ll t; cin >> t;if(t == 2){wt = true;rep(i,0,n)v[i][j] = 1;}if(t == 1)wc++;}ll ans = 0;rep(i,0,n)rep(j,0,n)ans += v[i][j];if(ht && wt){cout << ans << "\n";}else if(ht){cout << ans + hc << "\n";}else if(wt){cout << ans + wc << "\n";}else{cout << max(hc, wc) << "\n";}}