結果
問題 | No.2402 Dirty Stairs and Shoes |
ユーザー | akiaa11 |
提出日時 | 2023-08-04 23:51:48 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 3,382 bytes |
コンパイル時間 | 3,734 ms |
コンパイル使用メモリ | 264,340 KB |
実行使用メモリ | 14,800 KB |
最終ジャッジ日時 | 2024-05-10 07:23:37 |
合計ジャッジ時間 | 4,850 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,812 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 16 ms
8,832 KB |
testcase_04 | AC | 3 ms
6,940 KB |
testcase_05 | AC | 26 ms
14,412 KB |
testcase_06 | AC | 8 ms
6,940 KB |
testcase_07 | AC | 4 ms
6,944 KB |
testcase_08 | AC | 6 ms
6,944 KB |
testcase_09 | AC | 11 ms
7,680 KB |
testcase_10 | AC | 17 ms
9,204 KB |
testcase_11 | AC | 10 ms
6,940 KB |
testcase_12 | AC | 5 ms
6,940 KB |
testcase_13 | AC | 11 ms
10,112 KB |
testcase_14 | AC | 17 ms
14,800 KB |
testcase_15 | AC | 10 ms
9,984 KB |
testcase_16 | AC | 5 ms
6,940 KB |
testcase_17 | AC | 14 ms
11,756 KB |
testcase_18 | AC | 10 ms
9,728 KB |
testcase_19 | AC | 14 ms
13,332 KB |
testcase_20 | AC | 12 ms
11,632 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 7 ms
7,424 KB |
testcase_23 | AC | 6 ms
6,940 KB |
testcase_24 | AC | 7 ms
7,168 KB |
testcase_25 | AC | 14 ms
13,164 KB |
testcase_26 | AC | 7 ms
7,680 KB |
testcase_27 | AC | 14 ms
13,680 KB |
testcase_28 | AC | 11 ms
10,368 KB |
testcase_29 | AC | 7 ms
7,552 KB |
testcase_30 | AC | 2 ms
6,944 KB |
testcase_31 | AC | 15 ms
13,660 KB |
testcase_32 | AC | 7 ms
7,296 KB |
testcase_33 | AC | 2 ms
6,940 KB |
testcase_34 | AC | 6 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)n-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif using namespace std; using namespace atcoder; using ll=long long; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} constexpr ll INF=numeric_limits<ll>::max() / 4; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, k;cin>>n>>k; veci a(n + 1), b(n + 1); int m;cin>>m; rep(i, m){ int c;cin>>c; a[c] = 1; } cin>>m; rep(i, m){ int c;cin>>c; b[c] = 1; } vector dp(n + 1, veci(2, 0)); dp[0][0] = 1; rep(i, n) rep(j, 2)if(dp[i][j]){ if(i + k <= n){ if(a[i + k]) dp[i + k][1] = 1; else if(b[i + k]) dp[i + k][0] = 1; else dp[i + k][j] = 1; } if(a[i + 1]) dp[i + 1][1] = 1; else if(b[i + 1]) dp[i + 1][0] = 1; else dp[i + 1][j] = 1; } if(dp[n][0]) cout<<"Yes"<<endl; else cout<<"No"<<endl; }