結果

問題 No.1771 A DELETEQ
ユーザー oteraotera
提出日時 2021-12-03 18:19:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 133 ms / 3,500 ms
コード長 5,050 bytes
コンパイル時間 1,991 ms
コンパイル使用メモリ 202,912 KB
実行使用メモリ 67,200 KB
最終ジャッジ日時 2024-07-05 22:02:49
合計ジャッジ時間 8,664 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
67,072 KB
testcase_01 AC 58 ms
67,072 KB
testcase_02 AC 133 ms
67,072 KB
testcase_03 AC 59 ms
67,072 KB
testcase_04 AC 133 ms
67,072 KB
testcase_05 AC 133 ms
67,072 KB
testcase_06 AC 59 ms
67,072 KB
testcase_07 AC 58 ms
67,072 KB
testcase_08 AC 59 ms
67,072 KB
testcase_09 AC 72 ms
67,072 KB
testcase_10 AC 70 ms
67,200 KB
testcase_11 AC 67 ms
67,072 KB
testcase_12 AC 67 ms
67,072 KB
testcase_13 AC 68 ms
67,072 KB
testcase_14 AC 85 ms
67,072 KB
testcase_15 AC 96 ms
67,072 KB
testcase_16 AC 96 ms
67,072 KB
testcase_17 AC 63 ms
67,200 KB
testcase_18 AC 72 ms
67,072 KB
testcase_19 AC 60 ms
67,200 KB
testcase_20 AC 84 ms
67,072 KB
testcase_21 AC 62 ms
67,072 KB
testcase_22 AC 67 ms
67,072 KB
testcase_23 AC 71 ms
67,072 KB
testcase_24 AC 61 ms
67,200 KB
testcase_25 AC 59 ms
67,072 KB
testcase_26 AC 81 ms
67,072 KB
testcase_27 AC 67 ms
67,072 KB
testcase_28 AC 60 ms
67,072 KB
evil_hand_1.txt RE -
evil_hand_2.txt RE -
evil_hand_3.txt RE -
evil_random_1.txt RE -
evil_random_2.txt RE -
evil_random_3.txt RE -
evil_random_4.txt RE -
evil_random_5.txt RE -
evil_random_6.txt RE -
evil_random_7.txt RE -
evil_random_8.txt RE -
evil_random_9.txt RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
 *    author:  otera
 *    created: 03.12.2021 16:24:43 
**/
#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
#define repa(i, n) for(int i = 0; i < n; ++ i)
#define repb(i, a, b) for(int i = a; i < b; ++ i)
#define repc(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)
#define rep1a(i, n) for(int i = 0; i <= n; ++ i)
#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)
#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)
#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>=1;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define eb emplace_back
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define si(c) (int)(c).size()
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
#define tpow(n) (1LL<<(n))
#define unless(A) if(!(A))
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> void scan(T& a){ cin >> a; }
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ cout << ' '; }
template<class T> void print(const T& a){ cout << a; }
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }
int out(){ cout << '\n'; return 0; }
template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...)
#define dump(...)
#endif

using mint = atcoder::modint998244353;

mint dp[4040][4040];

void solve() {
    rep(i, 4040) rep(j, 4040) dp[i][j] = 0;
    INT(x, y);
    assert(x <= 4000 and y <= 4000);
    mint ans = 0;
    dp[0][0] = 1;
    for(int i = 0; i <= x; ++ i) {
        for(int j = 0; j <= y; ++ j) {
            // AA, BB
            dp[i + 1][j + 1] += dp[i][j] * 2;
            // AB
            dp[i + 1][j] += dp[i][j];
            // BA
            dp[i][j + 1] += dp[i][j];
        }
    }
    for(int i = x, j = y; i >= 0 and j >= 0; i --, j -- ) {
        ans += dp[i][j];
    }
    out(ans.val());
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // cout << fixed << setprecision(20);
    // INT(t); rep(i, t)solve();
    solve();
    return 0;
}
0