結果
問題 | No.2944 Sigma Partition Problem |
ユーザー |
👑 |
提出日時 | 2024-10-18 22:51:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 734 ms / 4,000 ms |
コード長 | 2,678 bytes |
コンパイル時間 | 4,514 ms |
コンパイル使用メモリ | 266,272 KB |
実行使用メモリ | 66,048 KB |
最終ジャッジ日時 | 2024-10-18 22:56:08 |
合計ジャッジ時間 | 23,791 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 673 ms
65,920 KB |
testcase_01 | AC | 690 ms
66,048 KB |
testcase_02 | AC | 727 ms
66,048 KB |
testcase_03 | AC | 734 ms
65,920 KB |
testcase_04 | AC | 676 ms
66,048 KB |
testcase_05 | AC | 674 ms
66,048 KB |
testcase_06 | AC | 669 ms
65,920 KB |
testcase_07 | AC | 691 ms
65,920 KB |
testcase_08 | AC | 712 ms
66,048 KB |
testcase_09 | AC | 705 ms
65,920 KB |
testcase_10 | AC | 727 ms
65,920 KB |
testcase_11 | AC | 673 ms
66,048 KB |
testcase_12 | AC | 679 ms
65,920 KB |
testcase_13 | AC | 667 ms
65,920 KB |
testcase_14 | AC | 688 ms
65,920 KB |
testcase_15 | AC | 723 ms
65,920 KB |
testcase_16 | AC | 683 ms
66,048 KB |
testcase_17 | AC | 682 ms
66,048 KB |
testcase_18 | AC | 679 ms
66,048 KB |
testcase_19 | AC | 692 ms
66,048 KB |
testcase_20 | AC | 680 ms
66,048 KB |
testcase_21 | AC | 693 ms
65,920 KB |
testcase_22 | AC | 675 ms
65,920 KB |
testcase_23 | AC | 684 ms
65,920 KB |
testcase_24 | AC | 685 ms
65,920 KB |
testcase_25 | AC | 678 ms
65,920 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;} template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} using mint = modint998244353; const int M = 4000; int main(){ int q; cin >> q; vector<vector<mint>> f(M + 1, vector<mint>(M + 1)); for(int k = 0; k <= M; k++) f[0][k] = 1; for(int n = 1; n <= M; n++){ for(int k = 1; k <= M; k++){ for(int m = n; m >= 0; m -= k){ f[n][k] += f[m][k - 1]; } } } rep(_, q){ int t, n, k; cin >> t >> n >> k; cout << f[n][k] << "\n"; } return 0; }