結果
問題 | No.1225 I hate I hate Matrix Construction |
ユーザー |
![]() |
提出日時 | 2020-09-11 22:09:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 2,276 bytes |
コンパイル時間 | 1,793 ms |
コンパイル使用メモリ | 122,032 KB |
最終ジャッジ日時 | 2025-01-14 10:35:39 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 35 |
ソースコード
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<bitset>#include<set>#include<map>#include<stack>#include<queue>#include<deque>#include<list>#include<iomanip>#include<cmath>#include<cstring>#include<functional>#include<cstdio>#include<cstdlib>#include<numeric>using namespace std;#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)#define rep(i, n) repr(i, 0, n)#define INF 2e9//#define MOD 1000000007#define MOD 998244353#define LINF (long long)4e18#define jck 3.141592const double EPS = 1e-10;using ll = long long;using Pi = pair<int,int>;using Pl = pair<ll,ll>;int main(){int n; cin >> n;vector<int> s(n),t(n);rep(i,n) cin >> s[i];rep(i,n) cin >> t[i];vector<vector<int>> a(n,vector<int>(n));bool s2 = false,t2 = false;rep(i,n){if(s[i] == 2){rep(j,n){a[i][j] = 1;}s2 = true;}}rep(i,n){if(t[i] == 2){rep(j,n){a[j][i] = 1;}t2 = true;}}vector<bool> s3(n,false),t3(n,false);if(!s2 && !t2){rep(i,n){if(s[i] == 1){rep(j,n){if(t[j] == 1 && !t3[j]){t3[j] = true;s3[i] = true;a[i][j] = 1;break;}}}}rep(i,n){if(s[i] == 1 && !s3[i]){rep(j,n){if(t[j] == 1){a[i][j] = 1;break;}}}}rep(j,n){if(!t3[j] && t[j] == 1){rep(i,n){if(s[i] == 1){a[i][j] = 1;break;}}}}}else if(s2 && !t2){rep(i,n){if(s[i] == 1) a[i][0] = 1;}}else if(!s2 && t2){rep(i,n){if(t[i] == 1) a[0][i] = 1;}}int ans = 0;rep(i,n)rep(j,n) ans += a[i][j];cout << ans << endl;}