#936332 (C++17) No.2402 Dirty Stairs and Shoes

• 問題: No.2402 Dirty Stairs and Shoes
• ユーザー: *yudai25n
• 提出日時: 2023-12-04 22:37:22
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 36 ms / 2,000 ms
• コード長: 2,065 bytes
• コンパイル時間: 4,272 ms
• コンパイル使用メモリ: 261,772 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-26 23:18:02
• 合計ジャッジ時間: 5,452 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	26 ms; 5,376 KB
testcase_04	AC	4 ms; 5,376 KB
testcase_05	AC	36 ms; 5,376 KB
testcase_06	AC	13 ms; 5,376 KB
testcase_07	AC	5 ms; 5,376 KB
testcase_08	AC	7 ms; 5,376 KB
testcase_09	AC	12 ms; 5,376 KB
testcase_10	AC	21 ms; 5,376 KB
testcase_11	AC	15 ms; 5,376 KB
testcase_12	AC	7 ms; 5,376 KB
testcase_13	AC	4 ms; 5,376 KB
testcase_14	AC	4 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	3 ms; 5,376 KB
testcase_17	AC	4 ms; 5,376 KB
testcase_18	AC	3 ms; 5,376 KB
testcase_19	AC	4 ms; 5,376 KB
testcase_20	AC	3 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	3 ms; 5,376 KB
testcase_24	AC	3 ms; 5,376 KB
testcase_25	AC	4 ms; 5,376 KB
testcase_26	AC	3 ms; 5,376 KB
testcase_27	AC	3 ms; 5,376 KB
testcase_28	AC	3 ms; 5,376 KB
testcase_29	AC	3 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	4 ms; 5,376 KB
testcase_32	AC	3 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	3 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using LP = pair<long long,long long>;
using SP = pair<string,string>;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using mint1 = modint1000000007;
using mint9 = modint998244353;
const int INF = 2e9;
const long long LINF = 4e18;
const int di[] = {0,1,0,-1,-1,1,-1,1};
const int dj[] = {1,0,-1,0,1,1,-1,-1};
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
void YesNo (bool ok , const string &s , const string &t) {if(ok) cout << s << endl; else cout << t << endl;} 


//-----def end-----//

bool dirty[400005] , clean[400005];
bool dp[400005][2];

int main () {
    int n , k , m1 , m2;
    cin >> n >> k >> m1;
    rep(i , m1) {
        int a;
        cin >> a;
        dirty[a] = true;
    }
    cin >> m2;
    rep(i , m2) {
        int b;
        cin >> b;
        clean[b] = true;
    }
    dp[0][0] = true;
    rep(i , n+1) rep(j , 2) {
        if(!dp[i][j]) continue;
        int ni1 = i+1 , ni2 = i+k;
        if(j == 0) {
            if(dirty[ni1]) dp[ni1][1] = true;
            else dp[ni1][0] = true;
            if(dirty[ni2]) dp[ni2][1] = true;
            else dp[ni2][0] = true;
        } else {
            if(clean[ni1]) dp[ni1][0] = true;
            else dp[ni1][1] = true;
            if(clean[ni2]) dp[ni2][0] = true;
            else dp[ni2][1] = true;
        }
    }
    if(dp[n][0]) cout << "Yes" << endl;
    else cout << "No" << endl;
	return 0;
}