#996528 (C++17) No.2811 Calculation Within Sequence

• 問題: No.2811 Calculation Within Sequence
• ユーザー: igeee
• 提出日時: 2024-07-20 09:10:09
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 52 ms / 2,000 ms
• コード長: 3,796 bytes
• コンパイル時間: 4,737 ms
• コンパイル使用メモリ: 263,920 KB
• 実行使用メモリ: 6,528 KB
• 最終ジャッジ日時: 2024-07-20 09:10:18
• 合計ジャッジ時間: 7,857 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	51 ms; 6,400 KB
testcase_04	AC	45 ms; 6,400 KB
testcase_05	AC	47 ms; 6,400 KB
testcase_06	AC	52 ms; 6,528 KB
testcase_07	AC	45 ms; 6,272 KB
testcase_08	AC	49 ms; 6,528 KB
testcase_09	AC	48 ms; 6,400 KB
testcase_10	AC	50 ms; 6,400 KB
testcase_11	AC	45 ms; 6,400 KB
testcase_12	AC	47 ms; 6,400 KB
testcase_13	AC	45 ms; 6,400 KB
testcase_14	AC	45 ms; 6,528 KB
testcase_15	AC	47 ms; 6,400 KB
testcase_16	AC	46 ms; 6,400 KB
testcase_17	AC	44 ms; 6,528 KB
testcase_18	AC	48 ms; 6,528 KB
testcase_19	AC	48 ms; 6,272 KB
testcase_20	AC	44 ms; 6,528 KB
testcase_21	AC	43 ms; 6,528 KB
testcase_22	AC	44 ms; 6,528 KB
testcase_23	AC	46 ms; 6,400 KB
testcase_24	AC	35 ms; 5,376 KB
testcase_25	AC	11 ms; 5,376 KB
testcase_26	AC	12 ms; 5,376 KB
testcase_27	AC	31 ms; 5,376 KB
testcase_28	AC	7 ms; 5,376 KB
testcase_29	AC	24 ms; 5,376 KB
testcase_30	AC	23 ms; 5,376 KB
testcase_31	AC	27 ms; 5,376 KB
testcase_32	AC	8 ms; 5,376 KB
testcase_33	AC	22 ms; 5,376 KB
testcase_34	AC	28 ms; 5,376 KB
testcase_35	AC	13 ms; 5,376 KB
testcase_36	AC	24 ms; 5,376 KB
testcase_37	AC	17 ms; 5,376 KB
testcase_38	AC	17 ms; 5,376 KB
testcase_39	AC	17 ms; 5,376 KB
testcase_40	AC	26 ms; 5,376 KB
testcase_41	AC	29 ms; 5,376 KB
testcase_42	AC	16 ms; 5,376 KB
testcase_43	AC	21 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--)
#define repn(i,end) for(long long i = 0; i <= (long long)(end); i++)
#define reps(i,start,end) for(long long i = start; i < (long long)(end); i++)
#define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++)
#define each(p,a) for(auto &p:a)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<long long> vll;
typedef vector<pair<long long ,long long>> vpll;
typedef vector<vector<long long>> vvll;
typedef set<ll> sll;
typedef map<long long , long long> mpll;
typedef pair<long long ,long long> pll;
typedef tuple<long long , long long , long long> tpl3;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a)  (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (int)x.size()
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
 
inline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
  
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} 
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;
 
int main(){
  ios::sync_with_stdio(false);cin.tie(nullptr);
  LL(n,m);
  vll a(n),b(m);cin >> a >> b;
  ll g = 0;
  rep(i,n){
    g = gcd(g,a[i]);
  }
  rep(i,m){
    if(b[i] % g != 0){
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
}