結果
問題 | No.1532 Different Products |
ユーザー | satashun |
提出日時 | 2022-07-04 22:25:39 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 625 ms / 4,000 ms |
コード長 | 4,399 bytes |
コンパイル時間 | 2,577 ms |
コンパイル使用メモリ | 207,936 KB |
実行使用メモリ | 475,636 KB |
最終ジャッジ日時 | 2024-05-08 12:22:54 |
合計ジャッジ時間 | 24,994 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 102 ms
78,392 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 6 ms
6,940 KB |
testcase_09 | AC | 49 ms
42,088 KB |
testcase_10 | AC | 132 ms
106,300 KB |
testcase_11 | AC | 108 ms
86,544 KB |
testcase_12 | AC | 297 ms
235,724 KB |
testcase_13 | AC | 212 ms
167,152 KB |
testcase_14 | AC | 550 ms
390,048 KB |
testcase_15 | AC | 51 ms
42,992 KB |
testcase_16 | AC | 113 ms
88,832 KB |
testcase_17 | AC | 126 ms
100,800 KB |
testcase_18 | AC | 113 ms
90,376 KB |
testcase_19 | AC | 317 ms
226,416 KB |
testcase_20 | AC | 507 ms
394,488 KB |
testcase_21 | AC | 165 ms
127,964 KB |
testcase_22 | AC | 205 ms
155,940 KB |
testcase_23 | AC | 152 ms
118,376 KB |
testcase_24 | AC | 464 ms
363,792 KB |
testcase_25 | AC | 263 ms
202,360 KB |
testcase_26 | AC | 38 ms
30,976 KB |
testcase_27 | AC | 225 ms
172,300 KB |
testcase_28 | AC | 175 ms
135,764 KB |
testcase_29 | AC | 136 ms
105,328 KB |
testcase_30 | AC | 296 ms
230,176 KB |
testcase_31 | AC | 302 ms
235,668 KB |
testcase_32 | AC | 354 ms
274,396 KB |
testcase_33 | AC | 277 ms
211,196 KB |
testcase_34 | AC | 446 ms
340,116 KB |
testcase_35 | AC | 357 ms
272,788 KB |
testcase_36 | AC | 425 ms
331,016 KB |
testcase_37 | AC | 73 ms
54,400 KB |
testcase_38 | AC | 498 ms
354,156 KB |
testcase_39 | AC | 406 ms
315,112 KB |
testcase_40 | AC | 417 ms
321,508 KB |
testcase_41 | AC | 596 ms
461,200 KB |
testcase_42 | AC | 551 ms
408,356 KB |
testcase_43 | AC | 550 ms
427,388 KB |
testcase_44 | AC | 603 ms
467,044 KB |
testcase_45 | AC | 620 ms
468,620 KB |
testcase_46 | AC | 594 ms
454,324 KB |
testcase_47 | AC | 620 ms
473,676 KB |
testcase_48 | AC | 617 ms
468,236 KB |
testcase_49 | AC | 617 ms
470,828 KB |
testcase_50 | AC | 616 ms
466,916 KB |
testcase_51 | AC | 625 ms
471,744 KB |
testcase_52 | AC | 617 ms
463,296 KB |
testcase_53 | AC | 624 ms
473,808 KB |
testcase_54 | AC | 610 ms
463,420 KB |
testcase_55 | AC | 623 ms
469,512 KB |
testcase_56 | AC | 606 ms
454,064 KB |
testcase_57 | AC | 594 ms
457,048 KB |
testcase_58 | AC | 607 ms
466,020 KB |
testcase_59 | AC | 582 ms
439,388 KB |
testcase_60 | AC | 616 ms
475,636 KB |
testcase_61 | AC | 2 ms
5,376 KB |
testcase_62 | AC | 2 ms
5,376 KB |
testcase_63 | AC | 621 ms
469,308 KB |
ソースコード
#pragma region satashun //#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; template <class T> V<T> make_vec(size_t a) { return V<T>(a); } template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) { return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...)); } #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; } template <class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; } template <class T> void mkuni(vector<T>& v) { sort(ALL(v)); v.erase(unique(ALL(v)), end(v)); } template <class T> vector<int> sort_by(const vector<T>& v, bool increasing = true) { vector<int> res(v.size()); iota(res.begin(), res.end(), 0); if (increasing) { stable_sort(res.begin(), res.end(), [&](int i, int j) { return v[i] < v[j]; }); } else { stable_sort(res.begin(), res.end(), [&](int i, int j) { return v[i] > v[j]; }); } return res; } template <class T, class U> istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) { is >> x; } return is; } template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template <class T> void scan(vector<T>& v, T offset = T(0)) { for (auto& x : v) { cin >> x; x += offset; } } // suc : 1 = newline, 2 = space template <class T> void print(T x, int suc = 1) { cout << x; if (suc == 1) cout << "\n"; else if (suc == 2) cout << " "; } template <class T> void print(const vector<T>& v, int suc = 1) { for (int i = 0; i < v.size(); ++i) print(v[i], i == int(v.size()) - 1 ? suc : 2); } template <class T> void show(T x) { print(x, 1); } template <typename Head, typename... Tail> void show(Head H, Tail... T) { print(H, 2); show(T...); } struct prepare_io { prepare_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); } } prep_io; #pragma endregion satashun void slv() { int N; ll K; cin >> N >> K; ll sq = 1; while (sq * sq <= K) sq++; auto dp1 = make_vec<ll>(N + 1, sq); auto ps1 = make_vec<ll>(N + 1, sq); auto dp2 = make_vec<ll>(N + 1, sq); dp1[0][1] = 1; rep(i, sq - 1) ps1[0][i + 1] = 1; rep(i, sq - 1) dp2[0][i + 1] = 1; for (int i = 1; i <= N; ++i) { rep(j, sq) { dp1[i][j] = dp1[i - 1][j]; dp2[i][j] = dp2[i - 1][j]; } for (int j = 1; j * i < sq; ++j) { dp1[i][j * i] += dp1[i - 1][j]; } rep(j, sq - 1) ps1[i][j + 1] = ps1[i][j] + dp1[i][j + 1]; rep(j, sq) { dp2[i][j] += (j * i < sq ? dp2[i - 1][j * i] : ps1[i - 1][K / (i * j)]); } } show(dp2[N][1] - 1); } int main() { int cases = 1; // cin >> cases; rep(i, cases) slv(); return 0; }