結果
問題 | No.2402 Dirty Stairs and Shoes |
ユーザー | jabee |
提出日時 | 2023-08-07 12:45:39 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 37 ms / 2,000 ms |
コード長 | 4,608 bytes |
コンパイル時間 | 3,843 ms |
コンパイル使用メモリ | 268,752 KB |
実行使用メモリ | 23,296 KB |
最終ジャッジ日時 | 2024-05-10 07:26:22 |
合計ジャッジ時間 | 5,665 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
18,944 KB |
testcase_01 | AC | 24 ms
18,944 KB |
testcase_02 | AC | 23 ms
19,016 KB |
testcase_03 | AC | 30 ms
20,992 KB |
testcase_04 | AC | 23 ms
19,328 KB |
testcase_05 | AC | 37 ms
23,040 KB |
testcase_06 | AC | 28 ms
20,096 KB |
testcase_07 | AC | 27 ms
19,328 KB |
testcase_08 | AC | 26 ms
19,968 KB |
testcase_09 | AC | 28 ms
20,560 KB |
testcase_10 | AC | 31 ms
21,120 KB |
testcase_11 | AC | 28 ms
20,148 KB |
testcase_12 | AC | 30 ms
19,328 KB |
testcase_13 | AC | 27 ms
21,488 KB |
testcase_14 | AC | 26 ms
23,296 KB |
testcase_15 | AC | 24 ms
21,624 KB |
testcase_16 | AC | 24 ms
20,080 KB |
testcase_17 | AC | 27 ms
22,204 KB |
testcase_18 | AC | 27 ms
21,376 KB |
testcase_19 | AC | 28 ms
22,792 KB |
testcase_20 | AC | 27 ms
22,212 KB |
testcase_21 | AC | 23 ms
19,072 KB |
testcase_22 | AC | 26 ms
20,432 KB |
testcase_23 | AC | 26 ms
20,304 KB |
testcase_24 | AC | 26 ms
20,440 KB |
testcase_25 | AC | 27 ms
22,528 KB |
testcase_26 | AC | 24 ms
20,608 KB |
testcase_27 | AC | 27 ms
22,784 KB |
testcase_28 | AC | 26 ms
21,736 KB |
testcase_29 | AC | 24 ms
20,608 KB |
testcase_30 | AC | 24 ms
19,072 KB |
testcase_31 | AC | 26 ms
22,912 KB |
testcase_32 | AC | 25 ms
20,608 KB |
testcase_33 | AC | 25 ms
18,944 KB |
testcase_34 | AC | 24 ms
20,096 KB |
ソースコード
#include<bits/stdc++.h> #include <math.h> #include <algorithm> #include <iostream> #include <vector> #include <atcoder/all> #include <atcoder/dsu> #include <atcoder/segtree> #include <atcoder/lazysegtree> #include <atcoder/modint> #include <atcoder/scc> #include <chrono> #include <random> #include <cassert> #ifndef templete #define rep(i,a,b) for(int i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() //#include<boost/multiprecision/cpp_int.hpp> //using namespace boost::multiprecision; using namespace std; using namespace atcoder; //using atmint = modint998244353; using atmint = modint; using Graph = vector<vector<int>>; using P = pair<long long,long long>; //#pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; 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; } //--------------------------------------------------------------------------------------------------- template<int MOD> struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) { } ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; }; template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) { ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; } template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac; Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i; ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);} T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; } T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; } T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0; return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));} // combination of paris for n com.aCb(h+w-2,h-1); }; typedef ModInt<1000000007> mint; //typedef ModInt<998244353> mint; //typedef ModInt<1000000000> mint; Comb<mint, 2010101> com; //vector dp(n+1,vector(n+1,vector<ll>(n+1,0))); //vector dp(n+1,vector<ll>(n+1,0)); std::random_device seed_gen; std::mt19937 engine(seed_gen()); string ye = "Yes"; string no = "No"; string draw = "Draw"; #endif // templete //--------------------------------------------------------------------------------------------------- void _main() { ll n,k,m1; cin >> n >> k >> m1; vector<ll>d(n+1,0); vector<ll>a(n+1,0); vector<ll>b(n+1,0); rep(i,0,m1){ ll v; cin >> v; a[v] = 1; } ll m2; cin >> m2; rep(i,0,m2){ ll v; cin >> v; b[v] = 1; } d[0] = 1; rep(i,0,n){ ll ni; ni = i + 1; d[ni] |= d[i]; if(a[ni])d[ni] = 0; if(b[ni])d[ni] = 1; ni = i + k; if(ni > n)continue; d[ni] |= d[i]; if(a[ni])d[ni] = 0; if(b[ni])d[ni] = 1; } if(d[n])cout << ye << endl; else cout << no << endl; }