結果

問題 No.1225 I hate I hate Matrix Construction
ユーザー rniyarniya
提出日時 2020-09-11 21:34:07
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 4 ms / 2,000 ms
コード長 3,155 bytes
コンパイル時間 1,929 ms
コンパイル使用メモリ 171,956 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-27 04:57:45
合計ジャッジ時間 3,059 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1000000007;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};
template<typename T>
istream &operator>>(istream &is,vector<T> &v){
for (T &x:v) is >> x;
return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
for (int i=0;i<v.size();++i){
os << v[i] << (i+1==v.size()?"": " ");
}
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
os << '{';
for (auto itr=m.begin();itr!=m.end();++itr){
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr!=m.end()) os << ',';
--itr;
}
os << '}';
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
os << '{';
for (auto itr=s.begin();itr!=s.end();++itr){
os << *itr;
if (++itr!=s.end()) os << ',';
--itr;
}
os << '}';
return os;
}
void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
cerr << head;
if (sizeof...(Tail)>0) cerr << ", ";
debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}
template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
if (a<b){a=b; return true;} return false;
}
#pragma endregion
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<int> S(N),T(N); cin >> S >> T;
vector<vector<int>> ans(N,vector<int>(N,-1));
for (int i=0;i<N;++i){
if (S[i]==1) continue;
for (int j=0;j<N;++j) ans[i][j]=S[i]/2;
}
for (int j=0;j<N;++j){
if (T[j]==1) continue;
for (int i=0;i<N;++i) ans[i][j]=T[j]/2;
}
int cnt1=0,cnt2=0;
for (int i=0;i<N;++i){
if (S[i]!=1) continue;
int ok=0;
for (int j=0;j<N;++j){
if (ans[i][j]==1){
ok=1;
}
}
if (ok) S[i]=2;
cnt1+=(S[i]==1);
}
for (int j=0;j<N;++j){
if (T[j]!=1) continue;
int ok=0;
for (int i=0;i<N;++i){
if (ans[i][j]==1){
ok=1;
}
}
if (ok) T[j]=2;
cnt2+=(T[j]==1);
}
int sum=0;
for (int i=0;i<N;++i){
for (int j=0;j<N;++j){
sum+=max(0,ans[i][j]);
}
}
cout << sum+max(cnt1,cnt2) << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0