結果
問題 | No.1225 I hate I hate Matrix Construction |
ユーザー | Thistle |
提出日時 | 2020-09-11 22:29:41 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 18 ms / 2,000 ms |
コード長 | 7,141 bytes |
コンパイル時間 | 2,015 ms |
コンパイル使用メモリ | 134,664 KB |
実行使用メモリ | 38,544 KB |
最終ジャッジ日時 | 2023-08-27 15:19:36 |
合計ジャッジ時間 | 4,021 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
36,568 KB |
testcase_01 | AC | 16 ms
36,652 KB |
testcase_02 | AC | 16 ms
36,584 KB |
testcase_03 | AC | 16 ms
36,772 KB |
testcase_04 | AC | 17 ms
38,424 KB |
testcase_05 | AC | 16 ms
37,020 KB |
testcase_06 | AC | 16 ms
37,808 KB |
testcase_07 | AC | 17 ms
37,092 KB |
testcase_08 | AC | 16 ms
37,284 KB |
testcase_09 | AC | 17 ms
37,772 KB |
testcase_10 | AC | 17 ms
37,612 KB |
testcase_11 | AC | 17 ms
38,256 KB |
testcase_12 | AC | 17 ms
37,944 KB |
testcase_13 | AC | 16 ms
37,092 KB |
testcase_14 | AC | 16 ms
36,688 KB |
testcase_15 | AC | 17 ms
37,848 KB |
testcase_16 | AC | 17 ms
37,736 KB |
testcase_17 | AC | 17 ms
38,308 KB |
testcase_18 | AC | 17 ms
38,544 KB |
testcase_19 | AC | 17 ms
37,776 KB |
testcase_20 | AC | 17 ms
37,448 KB |
testcase_21 | AC | 16 ms
37,900 KB |
testcase_22 | AC | 17 ms
37,580 KB |
testcase_23 | AC | 17 ms
37,764 KB |
testcase_24 | AC | 17 ms
37,600 KB |
testcase_25 | AC | 17 ms
38,160 KB |
testcase_26 | AC | 16 ms
37,500 KB |
testcase_27 | AC | 16 ms
36,556 KB |
testcase_28 | AC | 17 ms
38,116 KB |
testcase_29 | AC | 16 ms
37,620 KB |
testcase_30 | AC | 17 ms
38,072 KB |
testcase_31 | AC | 17 ms
38,244 KB |
testcase_32 | AC | 17 ms
38,412 KB |
testcase_33 | AC | 17 ms
37,588 KB |
testcase_34 | AC | 18 ms
38,348 KB |
testcase_35 | AC | 18 ms
38,420 KB |
testcase_36 | AC | 17 ms
37,600 KB |
ソースコード
#pragma GCC target ("avx") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define _USE_MATH_DEFINES #include<iostream> #include<string> #include<queue> #include<cmath> #include<map> #include<set> #include<list> #include<iomanip> #include<vector> #include<random> #include<functional> #include<algorithm> #include<stack> #include<cstdio> #include<cstring> #include<bitset> #include<unordered_map> #include<climits> #include<fstream> #include<complex> #include<time.h> #include<cassert> #include<functional> #include<numeric> #include<tuple> using namespace std; using ll = long long; using ld = long double; using H = pair<ll, ll>; using P = pair<ll, H>; using vi = vector<ll>; #define all(a) (a).begin(),(a).end() #define fs first #define sc second #define xx first #define yy second.first #define zz second.second #define Q(i,j,k) mkp(i,mkp(j,k)) #define rng(i,s,n) for(ll i = (s) ; i < (n) ; i++) #define rep(i,n) rng(i, 0, (n)) #define mkp make_pair #define vec vector #define pb emplace_back #define siz(a) (int)(a).size() #define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end()) #define getidx(b,i) (lower_bound(all(b),(i))-(b).begin()) #define ssp(i,n) (i==(ll)(n)-1?"\n":" ") #define ctoi(c) (int)(c-'0') #define itoc(c) (char)(c+'0') #define cyes printf("Yes\n") #define cno printf("No\n") #define cdf(n) for(int quetimes_=(n);quetimes_>0;quetimes_--) #define gcj printf("Case #%lld: ",qq123_+1) #define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read() #define found(a,x) (a.find(x)!=a.end()) constexpr ll mod = (ll)1e9 + 7; constexpr ll Mod = 998244353; constexpr ld EPS = 1e-10; constexpr ll inf = (ll)3 * 1e18; constexpr int Inf = (ll)15 * 1e8; constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 }; template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } ll read() { ll u, k = scanf("%lld", &u); return u; } string reads() { string s; cin >> s; return s; } H readh(short g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; } bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; } bool ina(int t, int l, int r) { return l <= t && t < r; } ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; } ll popcount(ll x) { int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++; return sum; } template<typename T> class csum { vec<T> v; public: csum(vec<T>& a) :v(a) { build(); } csum() {} void init(vec<T>& a) { v = a; build(); } void build() { for (int i = 1; i < v.size(); i++) v[i] += v[i - 1]; } //[l,r] T a(int l, int r) { if (r < l) return 0; return v[r] - (l == 0 ? 0 : v[l - 1]); } //[l,r) T b(int l, int r) { return a(l, r - 1); } T a(pair<int, int>t) { return a(t.first, t.second); } T b(pair<int, int>t) { return b(t.first, t.second); } }; class mint { public:ll v; mint(ll v = 0) { s(v % mod + mod); } constexpr static int mod = (ll)1e9 + 7; constexpr static int fn_ = (ll)2e6 + 5; static mint fact[fn_], comp[fn_]; mint pow(int x) const { mint b(v), c(1); while (x) { if (x & 1) c *= b; b *= b; x >>= 1; } return c; } inline mint& s(int vv) { v = vv < mod ? vv : vv - mod; return *this; } inline mint inv()const { return pow(mod - 2); } inline mint operator-()const { return mint() - *this; } inline mint& operator+=(const mint b) { return s(v + b.v); } inline mint& operator-=(const mint b) { return s(v + mod - b.v); } inline mint& operator*=(const mint b) { v = v * b.v % mod; return *this; } inline mint& operator/=(const mint b) { v = v * b.inv().v % mod; return *this; } inline mint operator+(const mint b) const { return mint(v) += b; } inline mint operator-(const mint b) const { return mint(v) -= b; } inline mint operator*(const mint b) const { return mint(v) *= b; } inline mint operator/(const mint b) const { return mint(v) /= b; } friend ostream& operator<<(ostream& os, const mint& m) { return os << m.v; } friend istream& operator>>(istream& is, mint& m) { int x; is >> x; m = mint(x); return is; } bool operator<(const mint& r)const { return v < r.v; } bool operator>(const mint& r)const { return v > r.v; } bool operator<=(const mint& r)const { return v <= r.v; } bool operator>=(const mint& r)const { return v >= r.v; } bool operator==(const mint& r)const { return v == r.v; } bool operator!=(const mint& r)const { return v != r.v; } explicit operator bool()const { return v; } explicit operator int()const { return v; } mint comb(mint k) { if (k > * this) return mint(); if (!fact[0]) combinit(); if (v >= fn_) { if (k > * this - k) k = *this - k; mint tmp(1); for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i); return tmp * comp[k.v]; } return fact[v] * comp[k.v] * comp[v - k.v]; }//nCk mint perm(mint k) { if (k > * this) return mint(); if (!fact[0]) combinit(); if (v >= fn_) { mint tmp(1); for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i); return tmp; } return fact[v] * comp[v - k.v]; }//nPk static void combinit() { fact[0] = 1; for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * mint(i); comp[fn_ - 1] = fact[fn_ - 1].inv(); for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * mint(i + 1); } }; mint mint::fact[fn_], mint::comp[fn_]; //-------------------------------------------------------------- //--------------------------------------------------------------------- int a[1000][1000]; signed main() { int n; vec<int>s, t; cin >> n; readv(s, n); readv(t, n); rep(i, n)rep(j, n)a[i][j] = -1; vector<vector<int>>b(2, vector<int>(3, 0)); int sum = 0; rep(i, n) { b[0][s[i]]++; if (s[i] == 0) rep(j, n) a[i][j] = 0; else if (s[i] == 2) rep(j, n) a[i][j] = 1; } rep(i, n) { b[1][t[i]]++; if (t[i] == 0) rep(j, n) a[j][i] = 0; else if (t[i] == 2) rep(j, n) a[j][i] = 1; } rep(i, n)rep(j, n) if (a[i][j] >= 0) sum += a[i][j]; if (b[0][2] && b[1][2]) cout << sum << endl; else if (!b[0][2] && b[1][2]) { //横方向には存在しているが、縦にはない //横方向の1を探せ cout << sum + b[1][1] << endl; } else if (b[0][2] && !b[1][2]) { cout << sum + b[0][1] << endl; } else cout << max(b[0][1], b[1][1]) << endl; }