結果

問題 No.1884 Sequence
ユーザー T101010101
提出日時 2023-03-16 20:55:43
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,496 bytes
コンパイル時間 14,284 ms
コンパイル使用メモリ 365,760 KB
最終ジャッジ日時 2025-02-11 11:59:04
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 39 WA * 1
権限があれば一括ダウンロードができます

ソースコード

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

#pragma region Macros
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;
#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'
using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 61;
// const int MOD = 998244353;
const int MOD = 1000000007;
__attribute__((constructor))
void constructor() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
cout << fixed << setprecision(15);
}
class UnionFind {
public:
UnionFind() = default;
UnionFind(int n) : par(n),
sz(n, 1) { iota(par.begin(), par.end(), 0); }
int root(int x) {
if (par[x] == x) return x;
return (par[x] = root(par[x]));
}
bool unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return false;
if (sz[rx] < sz[ry]) swap(rx, ry);
sz[rx] += sz[ry];
par[ry] = rx;
return true;
}
bool issame(int x, int y) {
return (root(x) == root(y));
}
int size(int x) {
return sz[root(x)];
}
int get_sum(int x) {
return sum[root(x)];
}
vector<vector<int>> groups(int n) {
vector<vector<int>> G(n);
for (int x = 0; x < n; x++) {
G[root(x)].push_back(x);
}
G.erase(
remove_if(G.begin(), G.end(),
[&](const vector<int>& v) { return v.empty(); }),
G.end());
return G;
}
private:
vector<int> par;
vector<int> sz;
vector<int> sum;
};
template<int mod> class modint{
public:
int val = 0;
modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
modint(const modint &r) { val = r.val; }
modint operator -() { return modint(-val); }
modint operator +(const modint &r) { return modint(*this) += r; }
modint operator +(const int &q) {modint r(q); return modint(*this) += r; }
modint operator -(const modint &r) { return modint(*this) -= r; }
modint operator -(const int &q) {modint r(q); return modint(*this) -= r; }
modint operator *(const modint &r) { return modint(*this) *= r; }
modint operator *(const int &q) {modint r(q); return modint(*this) *= r; }
modint operator /(const modint &r) { return modint(*this) /= r; }
modint operator /(const int &q) {modint r(q); return modint(*this) /= r; }
modint &operator +=(const modint &r) {
val += r.val;
if (val >= mod) val -= mod;
return *this;
}
modint &operator -=(const modint &r) {
if (val < r.val) val += mod;
val -= r.val;
return *this;
}
modint &operator *=(const modint &r) {
val = val * r.val % mod;
return *this;
}
modint &operator /=(const modint &r) {
int a = r.val, b = mod, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
val = val * u % mod;
if (val < 0) val += mod;
return *this;
}
bool operator ==(const modint& r) { return this -> val == r.val; }
bool operator <(const modint& r) { return this -> val < r.val; }
bool operator !=(const modint& r) { return this -> val != r.val; }
};
using mint = modint<MOD>;
istream &operator >>(istream &is, mint& x) {
int t; is >> t;
x = t;
return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
return os << x.val;
}
mint modpow(const mint &a, int n) {
if (n == 0) return 1;
mint t = modpow(a, n / 2);
t = t * t;
if (n & 1) t = t * a;
return t;
}
int modpow(int x, int n, int mod) {
int ret = 1;
while (n > 0) {
if (n % 2 == 1) ret = ret * x % mod;
x = x * x % mod;
n /= 2;
}
return ret;
}
int POW(int x, int y) {
if (y != (int)(y) or y < 0 or x != 0 && x != 1 && y > 64) {cout << "Error" << endl;return 0;}
if (y == 0) return 1;
if (y % 2 == 0) return POW(x * x, y / 2);
return x * POW(x, y - 1);
}
int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }
#pragma endregion
signed main() {
int N;
cin >> N;
vector<int> A(N);
unordered_map<int,int> mp;
for (int i = 0; i < N; i++) {
cin >> A[i];
mp[A[i]]++;
}
sort(A.begin(),A.end());
int d = INFL, l = INFL, r = 0, cnt = 0; // , , 0
for (int i = 0; i < N; i++) {
if (A[i] == 0) {
cnt++;
continue;
}
l = min(l, A[i]);
r = max(r, A[i]);
if (i == N - 1) break;
d = min(d, A[i + 1] - A[i]);
}
if (d == 0) {
if (!mp.count(0) && mp.size() >= 2 or mp.count(0) && mp.size() >= 3) {
cout << "No" << endl;
} else cout << "Yes" << endl;
return 0;
}
bool flag = true;
while (l < r) {
if (mp[l] > 2) flag = false;
if (mp[l] == 0) {
if (cnt == 0) {
flag = false;
break;
}
cnt--;
}
l += d;
}
if (!flag or l < r) cout << "No" << endl;
else cout << "Yes" << endl;
// cout << d << " " << l << " " << r << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0