結果
問題 |
No.1884 Sequence
|
ユーザー |
![]() |
提出日時 | 2022-03-25 21:37:16 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 69 ms / 2,000 ms |
コード長 | 2,453 bytes |
コンパイル時間 | 1,532 ms |
コンパイル使用メモリ | 120,672 KB |
最終ジャッジ日時 | 2025-01-28 11:46:54 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
ソースコード
// ===== template.hpp ===== #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cmath> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> #define OVERRIDE(a, b, c, d, ...) d #define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i) #define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i) #define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__) #define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i) #define ALL(x) begin(x), end(x) using namespace std; using u32 = unsigned int; using u64 = unsigned long long; using u128 = __uint128_t; using i32 = signed int; using i64 = signed long long; using i128 = __int128_t; template <typename T> using Vec = vector<T>; template <typename T> bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } template <typename T> bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } [[maybe_unused]] constexpr i32 inf = 1000000100; [[maybe_unused]] constexpr i64 inf64 = 3000000000000000100; struct SetIO { SetIO() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); } } set_io; // ===== template.hpp ===== #ifdef DEBUGF #include "../new_library/other/debug.hpp" #else #define DBG(x) (void) 0 #endif int main() { i32 n; cin >> n; Vec<i64> a(n); REP(i, n) { cin >> a[i]; } Vec<i64> b; i32 cnt = 0; REP(i, n) { if (a[i] > 0) { b.push_back(a[i]); } else { ++cnt; } } if (b.size() <= 1) { cout << "Yes\n"; exit(0); } sort(ALL(b)); Vec<i64> diff(b.size() - 1); REP(i, b.size() - 1) { diff[i] = b[i + 1] - b[i]; } if (count(ALL(diff), 0) == diff.size()) { cout << "Yes\n"; exit(0); } for (i64 d : diff) { if (d == 0) { cout << "No\n"; exit(0); } } i64 g = diff[0]; REP(i, 1, diff.size()) { g = gcd(g, diff[i]); } i64 need = 0; for (i64 d : diff) { need += d / g - 1; } cout << (need <= cnt ? "Yes\n" : "No\n"); }