結果
問題 | No.2811 Calculation Within Sequence |
ユーザー | soto800 |
提出日時 | 2024-07-19 21:23:47 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 171 ms / 2,000 ms |
コード長 | 3,562 bytes |
コンパイル時間 | 2,132 ms |
コンパイル使用メモリ | 203,380 KB |
実行使用メモリ | 6,528 KB |
最終ジャッジ日時 | 2024-07-19 21:23:59 |
合計ジャッジ時間 | 7,599 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 86 ms
6,400 KB |
testcase_04 | AC | 83 ms
6,400 KB |
testcase_05 | AC | 161 ms
6,400 KB |
testcase_06 | AC | 158 ms
6,400 KB |
testcase_07 | AC | 83 ms
6,400 KB |
testcase_08 | AC | 163 ms
6,272 KB |
testcase_09 | AC | 159 ms
6,400 KB |
testcase_10 | AC | 166 ms
6,400 KB |
testcase_11 | AC | 87 ms
6,400 KB |
testcase_12 | AC | 83 ms
6,400 KB |
testcase_13 | AC | 162 ms
6,400 KB |
testcase_14 | AC | 83 ms
6,400 KB |
testcase_15 | AC | 83 ms
6,400 KB |
testcase_16 | AC | 84 ms
6,272 KB |
testcase_17 | AC | 156 ms
6,400 KB |
testcase_18 | AC | 82 ms
6,400 KB |
testcase_19 | AC | 82 ms
6,400 KB |
testcase_20 | AC | 83 ms
6,272 KB |
testcase_21 | AC | 162 ms
6,400 KB |
testcase_22 | AC | 167 ms
6,528 KB |
testcase_23 | AC | 171 ms
6,400 KB |
testcase_24 | AC | 94 ms
5,376 KB |
testcase_25 | AC | 34 ms
5,376 KB |
testcase_26 | AC | 18 ms
5,376 KB |
testcase_27 | AC | 49 ms
5,376 KB |
testcase_28 | AC | 16 ms
5,376 KB |
testcase_29 | AC | 73 ms
5,376 KB |
testcase_30 | AC | 21 ms
5,376 KB |
testcase_31 | AC | 74 ms
5,376 KB |
testcase_32 | AC | 22 ms
5,376 KB |
testcase_33 | AC | 29 ms
5,376 KB |
testcase_34 | AC | 91 ms
5,376 KB |
testcase_35 | AC | 18 ms
5,376 KB |
testcase_36 | AC | 45 ms
5,376 KB |
testcase_37 | AC | 57 ms
5,376 KB |
testcase_38 | AC | 12 ms
5,376 KB |
testcase_39 | AC | 53 ms
5,376 KB |
testcase_40 | AC | 83 ms
5,376 KB |
testcase_41 | AC | 99 ms
5,376 KB |
testcase_42 | AC | 47 ms
5,376 KB |
testcase_43 | AC | 63 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> //#include <atcoder/all> using namespace std; #define lli long long int #define REP(i, s, n) for (lli i = s; i < n; i++) #define INF (1LL << 62) #define mp(a, b) make_pair(a, b) #define SORT(V) sort(V.begin(), V.end()) #define PI (3.141592653589794) #define TO_STRING(VariableName) #VariableName #define LOG1(x) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << endl; #define LOG2(x, y) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl; #define LOG3(x, y, z) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \ << TO_STRING(z) << "=" << z << endl; #define LOG4(w, x, y, z) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \ << endl; #define LOG5(w, x, y, z, a) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \ << TO_STRING(a) << "=" << a << endl; #define LOG6(w, x, y, z, a, b) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \ << TO_STRING(a) << "=" << a << " " << TO_STRING(b) << "=" << b \ << endl; #define overload6(a, b, c, d, e, f, g, ...) g #define LOG(...) \ overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__) 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; } mt19937 engine; std::chrono::system_clock::time_point start, endTime; #define DEBUG 0 lli gcd(lli a, lli b) { if (a == 0) return b; if (b == 0) return a; if (a % b == 0) { return b; } else { return gcd(b, a % b); } } lli lcm(lli a, lli b) { return a * b / gcd(a, b); } void solve() { // write your code here lli N, M; cin >> N >> M; vector<lli> A(N), B(M); REP(i, 0, N) { cin >> A[i]; } lli gcdNum = A[0]; REP(i, 1, N) { gcdNum = gcd(gcdNum, A[i]); } REP(i, 0, M) { cin >> B[i]; if (B[i] % gcdNum != 0) { cout << "No" << endl; return; } } cout << "Yes" << endl; } // Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools (tips: // You use the default template now. You can remove this line by using your // custom template) int main() { // Failed to predict input format lli N = 1; // cin >> N; while (N--) solve(); return 0; }