結果
問題 | No.1225 I hate I hate Matrix Construction |
ユーザー |
![]() |
提出日時 | 2020-09-11 21:30:07 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 3,232 bytes |
コンパイル時間 | 1,397 ms |
コンパイル使用メモリ | 120,416 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-27 02:44:06 |
合計ジャッジ時間 | 2,720 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 35 |
ソースコード
#line 2 "library/other/template.hpp"#define _CRT_SECURE_NO_WARNINGS#pragma target("avx2")#pragma optimize("O3")#pragma optimize("unroll-loops")#include <algorithm>#include <bitset>#include <cassert>#include <cfloat>#include <climits>#include <cmath>#include <complex>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <list>#include <map>#include <memory>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <string.h>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define rep(i,n) for(int i=0;i<(n);i++)#define REP(i,n) for(int i=1;i<=(n);i++)#define all(V) V.begin(),V.end()typedef unsigned int uint;typedef long long lint;typedef unsigned long long ulint;typedef std::pair<int, int> P;typedef std::pair<lint, lint> LP;constexpr int INF = INT_MAX/2;constexpr lint LINF = LLONG_MAX/2;constexpr double eps = DBL_EPSILON;constexpr double PI=3.141592653589793238462643383279;template<class T>class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};template <class T, class U>inline bool chmax(T& lhs, const U& rhs) {if (lhs < rhs) {lhs = rhs;return 1;}return 0;}template <class T, class U>inline bool chmin(T& lhs, const U& rhs) {if (lhs > rhs) {lhs = rhs;return 1;}return 0;}inline lint gcd(lint a, lint b) {while (b) {lint c = a;a = b; b = c % b;}return a;}inline lint lcm(lint a, lint b) {return a / gcd(a, b) * b;}bool isprime(lint n) {if (n == 1)return false;for (int i = 2; i * i <= n; i++) {if (n % i == 0)return false;}return true;}template<typename T>T mypow(T a, lint b) {T res(1);while(b){if(b&1)res*=a;a*=a;b>>=1;}return res;}lint modpow(lint a, lint b, lint m) {lint res(1);while(b){if(b&1){res*=a;res%=m;}a*=a;a%=m;b>>=1;}return res;}template<typename T>void printArray(std::vector<T>& vec) {rep(i, vec.size()){std::cout << vec[i];std::cout<<(i==(int)vec.size()-1?"\n":" ");}}template<typename T>void printArray(T l, T r) {T rprev = std::prev(r);for (T i = l; i != rprev; i++) {std::cout << *i << " ";}std::cout << *rprev << std::endl;}LP extGcd(lint a,lint b) {if(b==0)return {1,0};LP s=extGcd(b,a%b);std::swap(s.first,s.second);s.second-=a/b*s.first;return s;}LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {lint p=extGcd(m1,m2).first;lint tmp=(b2-b1)*p%m2;lint r=(b1+m1*tmp+m1*m2)%(m1*m2);return std::make_pair(r,m1*m2);}template<typename F>inline constexpr decltype(auto) lambda_fix(F&& f){return [f=std::forward<F>(f)](auto&&... args){return f(f,std::forward<decltype(args)>(args)...);};}#line 2 "main.cpp"int n,s[510],t[510];int main(){std::cin>>n;rep(i,n)std::cin>>s[i];rep(i,n)std::cin>>t[i];int a=std::count(s,s+n,2),b=std::count(t,t+n,2);if(a&&b)std::cout<<a*n+b*n-a*b<<std::endl;else if(a)std::cout<<a*n+std::count(s,s+n,1)<<std::endl;else if(b)std::cout<<b*n+std::count(t,t+n,1)<<std::endl;else std::cout<<std::max(std::count(s,s+n,1),std::count(t,t+n,1))<<std::endl;}