結果
問題 | No.2880 Max Sigma Mod |
ユーザー | wingu |
提出日時 | 2024-09-08 16:21:42 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 9 ms / 3,000 ms |
コード長 | 2,738 bytes |
コンパイル時間 | 2,944 ms |
コンパイル使用メモリ | 249,200 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-08 16:21:47 |
合計ジャッジ時間 | 4,745 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 7 ms
6,940 KB |
testcase_06 | AC | 6 ms
6,944 KB |
testcase_07 | AC | 5 ms
6,940 KB |
testcase_08 | AC | 4 ms
6,940 KB |
testcase_09 | AC | 4 ms
6,944 KB |
testcase_10 | AC | 3 ms
6,940 KB |
testcase_11 | AC | 5 ms
6,940 KB |
testcase_12 | AC | 3 ms
6,944 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 5 ms
6,940 KB |
testcase_15 | AC | 8 ms
6,940 KB |
testcase_16 | AC | 9 ms
6,940 KB |
testcase_17 | AC | 8 ms
6,940 KB |
testcase_18 | AC | 8 ms
6,944 KB |
testcase_19 | AC | 8 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 4 ms
6,944 KB |
testcase_22 | AC | 5 ms
6,944 KB |
testcase_23 | AC | 4 ms
6,944 KB |
testcase_24 | AC | 4 ms
6,944 KB |
testcase_25 | AC | 7 ms
6,944 KB |
testcase_26 | AC | 7 ms
6,940 KB |
testcase_27 | AC | 7 ms
6,944 KB |
testcase_28 | AC | 7 ms
6,940 KB |
testcase_29 | AC | 4 ms
6,944 KB |
testcase_30 | AC | 2 ms
6,940 KB |
testcase_31 | AC | 2 ms
6,944 KB |
testcase_32 | AC | 2 ms
6,940 KB |
testcase_33 | AC | 2 ms
6,944 KB |
testcase_34 | AC | 2 ms
6,940 KB |
testcase_35 | AC | 2 ms
6,940 KB |
testcase_36 | AC | 2 ms
6,944 KB |
testcase_37 | AC | 2 ms
6,940 KB |
testcase_38 | AC | 2 ms
6,940 KB |
testcase_39 | AC | 2 ms
6,944 KB |
testcase_40 | AC | 2 ms
6,940 KB |
testcase_41 | AC | 2 ms
6,940 KB |
testcase_42 | AC | 1 ms
6,944 KB |
testcase_43 | AC | 2 ms
6,940 KB |
testcase_44 | AC | 2 ms
6,948 KB |
testcase_45 | AC | 1 ms
6,944 KB |
testcase_46 | AC | 2 ms
6,944 KB |
testcase_47 | AC | 2 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,944 KB |
testcase_49 | AC | 2 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #include <atcoder/modint> using namespace atcoder; #ifdef DEFINED_ONLY_IN_LOCAL #include <dump.hpp> #define dump(...) cpp_dump(__VA_ARGS__) #else #undef dump #define dump(...) #endif #define rep1(i, a) for (int i = 0; i < (int)(a); i++) #define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep3(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c)) #define overloadRep(a, b, c, d, e, ...) e #define rep(...) overloadRep(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__) #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() using ll = long long; using ull = unsigned long long; const int inf = 1e9; const ll INF = 1e18; const int dx[4] = {0, 1, 0, -1}; const int dy[4] = {1, 0, -1, 0}; const int ddx[8] = {1, 0, -1, 0, 1, -1, 1, -1}; const int ddy[8] = {0, 1, 0, -1, 1, -1, -1, 1}; struct cincout {cincout() {ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15);}} init; 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;} template <class T1, class T2> istream& operator>>(istream& is, pair<T1, T2>& p) {is >> p.first >> p.second; return is;} template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& p) {os << p.first << " " << p.second << '\n'; return os;} template <class T> istream& operator>>(istream& is, vector<T>& v) {for (T& in : v) {is >> in;} return is;} template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {rep(i, (int)v.size()) {os << v[i] << " \n"[i + 1 == (int)v.size()];} return os;} template <class T> istream& operator>>(istream& is, vector<vector<T>>& vv) {for (vector<T>& v : vv) {is >> v;} return is;} template <class T> ostream& operator<<(ostream& os, vector<vector<T>>& vv) {for (vector<T>& v : vv) {os << v;} return os;} inline bool bit(ll x, int p) {return (x >> p) & 1;} inline bool out(int ni, int nj, int h, int w) {return (ni < 0 or ni >= h or nj < 0 or nj >= w);} inline int pc(ll x) {return __builtin_popcountll(x);} template <class T> inline T max(vector<T> x) {return *max_element(x.begin(), x.end());} template <class T> inline T min(vector<T> x) {return *min_element(x.begin(), x.end());} template <class T> inline T sum(vector<T> x) {return reduce(x.begin(), x.end());} using P = pair<int, int>; using T = tuple<int, int, int>; int main() { int n, m; cin >> n >> m; vector<ll> dp(n + 1); for (int i = 1; i <= m; i++) { for (int j = i; j <= n; j += i) dp[j] -= i; } for (int i = 1; i <= n; i++) dp[i] += dp[i - 1] + m; cout << max(dp) << '\n'; return 0; }