結果
問題 | No.1645 AB's abs |
ユーザー | ruthen71 |
提出日時 | 2021-08-13 21:38:39 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 23 ms / 2,000 ms |
コード長 | 3,320 bytes |
コンパイル時間 | 1,895 ms |
コンパイル使用メモリ | 172,828 KB |
実行使用メモリ | 19,584 KB |
最終ジャッジ日時 | 2024-10-03 17:51:42 |
合計ジャッジ時間 | 3,605 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 3 ms
6,816 KB |
testcase_02 | AC | 8 ms
8,320 KB |
testcase_03 | AC | 3 ms
6,820 KB |
testcase_04 | AC | 3 ms
6,816 KB |
testcase_05 | AC | 3 ms
6,816 KB |
testcase_06 | AC | 4 ms
6,816 KB |
testcase_07 | AC | 3 ms
6,816 KB |
testcase_08 | AC | 10 ms
9,728 KB |
testcase_09 | AC | 10 ms
9,728 KB |
testcase_10 | AC | 10 ms
9,088 KB |
testcase_11 | AC | 10 ms
9,088 KB |
testcase_12 | AC | 10 ms
9,216 KB |
testcase_13 | AC | 22 ms
19,200 KB |
testcase_14 | AC | 21 ms
18,304 KB |
testcase_15 | AC | 22 ms
19,200 KB |
testcase_16 | AC | 22 ms
18,432 KB |
testcase_17 | AC | 22 ms
19,072 KB |
testcase_18 | AC | 22 ms
18,432 KB |
testcase_19 | AC | 23 ms
19,200 KB |
testcase_20 | AC | 21 ms
17,920 KB |
testcase_21 | AC | 22 ms
18,560 KB |
testcase_22 | AC | 22 ms
18,944 KB |
testcase_23 | AC | 23 ms
19,584 KB |
testcase_24 | AC | 23 ms
19,456 KB |
testcase_25 | AC | 23 ms
19,456 KB |
testcase_26 | AC | 22 ms
19,584 KB |
testcase_27 | AC | 23 ms
19,456 KB |
testcase_28 | AC | 22 ms
19,456 KB |
testcase_29 | AC | 23 ms
19,456 KB |
testcase_30 | AC | 23 ms
19,456 KB |
testcase_31 | AC | 22 ms
19,584 KB |
testcase_32 | AC | 23 ms
19,584 KB |
testcase_33 | AC | 23 ms
19,456 KB |
testcase_34 | AC | 23 ms
19,584 KB |
testcase_35 | AC | 23 ms
19,456 KB |
testcase_36 | AC | 22 ms
19,584 KB |
testcase_37 | AC | 23 ms
19,456 KB |
testcase_38 | AC | 23 ms
19,584 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;// clang-format off//#include <atcoder/all>//using namespace atcoder;using ll = long long;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pdd = pair<ld, ld>;using vii = vector<int>;using vll = vector<ll>;using vdd = vector<ld>;using vvii = vector<vector<int>>;using vvll = vector<vector<ll>>;using vvdd = vector<vector<ld>>;using vvvii = vector<vector<vector<int>>>;using vvvll = vector<vector<vector<ll>>>;using vvvdd = vector<vector<vector<ld>>>;template<class T, class U> using P = pair<T, U>;template<class T> using V = vector<T>;template<class T> using V2 = vector<vector<T>>;template<class T> using V3 = vector<vector<vector<T>>>;template<class T> using pque = priority_queue<T, vector<T>, greater<T>>;#define _overload3(_1, _2, _3, name, ...) name#define rep1(n) for (ll i = 0; i < (n); i++)#define rep2(i, n) for (ll i = 0; i < (n); i++)#define rep3(i, a, b) for (ll i = (a); i < (b); i++)#define rep(...) _overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)#define rrep1(n) for (ll i = (n) - 1; i >= 0; i--)#define rrep2(i, n) for (ll i = (n) - 1; i >= 0; i--)#define rrep3(i, a, b) for (ll i = (b) - 1; i >= (a); i--)#define rrep(...) _overload3(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define sz(x) ((int)(x).size())#define fi first#define se second#define pb push_back#define endl '\n'#define popcnt(x) __builtin_popcountll(x)#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end());#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);const int inf = 1 << 30;const ll INF = 1ll << 60;const ld DINF = numeric_limits<ld>::infinity();const ll mod = 1000000007;const ll modd = 998244353;const ld EPS = 1e-9;const ld PI = 3.1415926535897932;const ll dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};const ll dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};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 (a>b) { a=b; return 1; } return 0; }template<typename T> T min(const vector<T> &x) { return *min_element(all(x)); }template<typename T> T max(const vector<T> &x) { return *max_element(all(x)); }template<class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << "(" << p.fi << ", " << p.se << ")"; }template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << "[ "; for (auto &z : v) os << z << " "; os << "]"; return os; }#define show(x) cout << #x << " = " << x << endlll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }ll rem(ll a, ll b) { return (a % b + b) % b; }// clang-format on// using mint = modint998244353;int main() {IOS;ll n;cin >> n;vll a(n);rep(n) cin >> a[i];vvll dp(n + 1, vll(20010, 0));dp[0][10005] = 1;rep(i, n) {rep(j, 20010) {if (j - a[i] >= 0) dp[i + 1][j - a[i]] = (dp[i + 1][j - a[i]] + dp[i][j]) % modd;if (j + a[i] < 20010) dp[i + 1][j + a[i]] = (dp[i + 1][j + a[i]] + dp[i][j]) % modd;}}ll ans = 0;rep(i, 20010) { ans = (ans + dp[n][i] * abs(i - 10005) % modd) % modd; }cout << ans << endl;return 0;}