結果

問題 No.2777 Wild Flush
ユーザー AyunaAyuna
提出日時 2024-06-07 21:39:49
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 4,819 bytes
コンパイル時間 5,287 ms
コンパイル使用メモリ 263,796 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-26 07:25:39
合計ジャッジ時間 5,955 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

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

#if 1
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint93 = modint998244353;
using mint17 = modint1000000007;
using mint = modint;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T, class S>
using p = pair<T, S>;
#define vec vector
template <class T>
using v = vector<T>;
template <class T>
using vv = v<v<T>>;
template <class T>
using vvv = v<vv<T>>;
using vl = v<ll>;
using vvl = vv<ll>;
using vvvl = vvv<ll>;
using vpl = v<pll>;
constexpr ll TEN(int n) { return (n == 0) ? 1ll : 10ll * TEN(n - 1); }
#define FOR(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, N) for (ll i = 0; i < (ll)(N); i++)
#define rep1(i, N) for (ll i = 1; i <= (ll)(N); i++)
#define rrep(i, N) for (ll i = N - 1; i >= 0; i--)
#define rrep1(i, N) for (ll i = N; i > 0; i--)
#define fore(i, a) for (auto &i : a)
#define fs first
#define sc second
#define eb emplace_back
#define pb push_back
#define ps push
#define elif else if
#define all(x) (x).begin(), (x).end()
#define UNIQUE(x) (x).erase(unique((x).begin(), (x).end()), (x).end());
#define YES(x) cout << ((x) ? "YES" : "NO") << endl;
#define Yes(x) cout << ((x) ? "Yes" : "No") << endl;
#define yes(x) cout << ((x) ? "yes" : "no") << endl;
#define printans(x) cout << (x == infl ? -1 : x) << endl;
ll sum(vl &x) { return accumulate(all(x), 0ll); }
template <class T>
auto min(const T &a) {
return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
return *max_element(all(a));
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
const int inf = (1ll << 29);
const ll infl = (1ll << 60);
const ll mod93 = 998244353ll;
const ll mod17 = 1000000007ll;
int popcnt(uint x) { return __builtin_popcount(x); }
int popcnt(ull x) { return __builtin_popcountll(x); }
int bsr(uint x) { return 32 - __builtin_clz(x); }
int bsr(ull x) { return 64 - __builtin_clzll(x); }
int bsf(uint x) { return __builtin_ctz(x); }
int bsf(ull x) { return __builtin_ctzll(x); }
ostream &operator<<(ostream &os, const mint93 &x) { return os << x.val(); }
ostream &operator<<(ostream &os, const mint17 &x) { return os << x.val(); }
template <class T, class S>
istream &operator>>(istream &is, pair<T, S> &x) {
return is >> x.fs >> x.sc;
}
template <class T, class S>
ostream &operator<<(ostream &os, pair<T, S> &x) {
return os << x.fs << " " << x.sc;
}
template <class T>
istream &operator>>(istream &is, v<T> &x) {
for (auto &y : x) is >> y;
return is;
}
template <class T>
ostream &operator<<(ostream &os, v<T> &x) {
for (unsigned int i = 0, size = x.size(); i < size; i++)
os << x[i] << (i == size - 1 ? "" : " ");
return os;
}
template <class T>
T popleft(queue<T> &q) {
T a = q.front();
q.pop();
return a;
}
template <class T>
void print(T &t) {
fore(H, t) cout << H << ' ';
cout << endl;
}
struct StopWatch {
bool f = false;
clock_t st;
void start() {
f = true;
st = clock();
}
int msecs() {
assert(f);
return (clock() - st) * 1000 / CLOCKS_PER_SEC;
}
};
ll rand_int(ll l, ll r) { // [l, r]
static random_device rd;
static mt19937 gen(rd());
return uniform_int_distribution<ll>(l, r)(gen);
}
template <typename T> // mint93 or mint17
struct Count {
int N;
v<T> fact, ifact;
Count(int N) : N(N) {
fact.resize(N + 1);
ifact.resize(N + 1);
fact[0] = 1;
rep1(i, N) { fact[i] = fact[i - 1] * i; }
ifact[N] = T(1) / fact[N];
rrep1(i, N) { ifact[i - 1] = ifact[i] * i; }
}
void extend(int n) {
int pn = fact.size();
fact.resize(n + 1);
ifact.resize(n + 1);
FOR(i, pn, n + 1) { fact[i] = fact[i - 1] * i; }
ifact[n] = T(1) / fact[n];
for (int i = n; i > pn; i--) {
ifact[i - 1] = ifact[i] * i;
}
}
T nCk(int n, int k) {
if (k > n || k < 0) return 0;
if (n >= int(fact.size())) extend(n);
return fact[n] * ifact[k] * ifact[n - k];
}
T nPk(int n, int k) {
if (k > n || k < 0) return 0;
if (n >= int(fact.size())) extend(n);
return fact[n] * ifact[n - k];
}
T nHk(int n, int k) {
if (n == 0 && k == 0) return 1;
return nCk(n + k - 1, k);
}
T catalan(int n) { return nCk(2 * n, n) - nCk(2 * n, n + 1); }
T catalan(int n, int m, int k) {
if (n > m + k || k < 0)
return 0;
else
return nCk(n + m, n) - nCk(n + m, m + k + 1);
}
};
#endif
// #define _GLIBCXX_DEBUG
int main() {
int n, k;
cin >> n >> k;
vl a(n);
cin >> a;
vl cnt(n + 1);
fore(i, a) cnt[i]++;
rep1(i, n) if (cnt[0] + cnt[i] >= k){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0