結果
| 問題 | No.2880 Max Sigma Mod |
| ユーザー |
 iiljj
|
| 提出日時 | 2024-09-08 13:39:44 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 283 ms / 3,000 ms |
| コード長 | 13,041 bytes |
| コンパイル時間 | 2,839 ms |
| コンパイル使用メモリ | 187,308 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-09-08 13:39:53 |
| 合計ジャッジ時間 | 8,494 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 48 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")/* #region Head */// #include <bits/stdc++.h>#include <algorithm>#include <array>#include <bitset>#include <cassert> // assert.h#include <cmath> // math.h#include <cstring>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <list>#include <map>#include <memory>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;template <class T, class U> using um = unordered_map<T, U>;template <class T> using pq = priority_queue<T>;template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;template <class T> using us = unordered_set<T>;#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define ISIZE(x) ((int)(x).size())#define PERM(c) \sort(ALL(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());#define CEIL(a, b) (((a) + (b)-1) / (b))#define endl '\n'constexpr ll INF = 1'010'000'000'000'000'017LL;constexpr int IINF = 1'000'000'007LL;constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7// constexpr ll MOD = 998244353;constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;// 前方宣言template <typename T> istream &operator>>(istream &is, vc<T> &vec);template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec);template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec);template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr);template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr);template <typename T, size_t _Nm> ostream &operator>>(ostream &os, const array<T, _Nm> &arr);template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var);template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var);template <class T> ostream &out_iter(ostream &os, const T &map_var);template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var);template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var);template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var);template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var);template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var);template <typename T> ostream &operator<<(ostream &os, const queue<T> &queue_var);template <typename T> ostream &operator<<(ostream &os, const stack<T> &stk_var);template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力for (T &x : vec)is >> x;return is;}template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)os << "{";REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");return os;}template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力REP(i, 0, SIZE(arr)) is >> arr[i];return is;}template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)os << "{";REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力is >> pair_var.first >> pair_var.second;return is;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map, um, set, us 出力template <class T> ostream &out_iter(ostream &os, const T &map_var) {os << "{";REPI(itr, map_var) {os << *itr;auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}return os << "}";}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {return out_iter(os, map_var);}template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {os << "{";REPI(itr, map_var) {auto [key, value] = *itr;os << "(" << key << ", " << value << ")";auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {pq<T> pq_cp(pq_var);os << "{";if (!pq_cp.empty()) {os << pq_cp.top(), pq_cp.pop();while (!pq_cp.empty())os << ", " << pq_cp.top(), pq_cp.pop();}return os << "}";}// tuple 出力template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {if constexpr (N < std::tuple_size_v<tuple<Args...>>) {os << get<N>(a);if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {os << ' ';} else if constexpr (end_line) {os << '\n';}return operator<< <N + 1, end_line>(os, a);}return os;}template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(std::cout, a); }void pprint() { std::cout << endl; }template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {std::cout << head;if (sizeof...(Tail) > 0) std::cout << ' ';pprint(move(tail)...);}// dump#define DUMPOUT cerrvoid dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {DUMPOUT << head;if (sizeof...(Tail) > 0) DUMPOUT << ", ";dump_func(move(tail)...);}// chmax (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {if (comp(xmax, x)) {xmax = x;return true;}return false;}// chmin (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {if (comp(x, xmin)) {xmin = x;return true;}return false;}// ローカル用#ifndef ONLINE_JUDGE#define DEBUG_#endif#ifndef MYLOCAL#undef DEBUG_#endif#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endif#define VAR(type, ...) \type __VA_ARGS__; \assert((std::cin >> __VA_ARGS__));template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }struct AtCoderInitialize {static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = false;AtCoderInitialize() {ios_base::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);std::cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH) std::cout << unitbuf;}} ATCODER_INITIALIZE;void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {for (int i = 0; i < ISIZE(v); ++i)v[i]--;}template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {for (int i = 0; i < ISIZE(v); ++i)v[i]++;}/* #endregion */// #include <atcoder/all>// using namespace atcoder;template <typename T = ll> inline constexpr T mul_overflow(T x, T y) {T result = 0;if (__builtin_mul_overflow(x, y, &result)) return std::numeric_limits<T>::max();return result;}// cf.// https://codeforces.com/blog/entry/22712// https://pastebin.com/2VSdtDxxnamespace cf {using li = ll;const li mod = INF;inline void normal(li &a) {a %= mod;(a < 0) && (a += mod);}inline li mul(li a, li b) {a %= mod, b %= mod;normal(a), normal(b);li result = 0;if (__builtin_mul_overflow(a, b, &result)) {return li(((__int128_t)a * (__int128_t)b) % mod);} else {return result % mod;}}inline li add(li a, li b) {a %= mod, b %= mod;normal(a), normal(b);return (a + b) % mod;}inline li sub(li a, li b) {a %= mod, b %= mod;normal(a), normal(b);a -= b;normal(a);return a;}inline li sum(li n) { return mul(mul(n, n + 1), (mod + 1) / 2); }inline li sum(li lf, li rg) { return sub(sum(rg), sum(lf - 1)); }inline li calcDiv(li n, li m) {m = min(m, n);li ans = 0;li minVal = m;for (li i = 1; i * i <= n; i++) {li lf = n / (i + 1), rg = n / i;rg = min(rg, m);if (lf >= rg) continue;minVal = lf; // interval (lf, rg]ans = add(ans, mul(i, sum(lf + 1, rg)));}REP(i, 1, minVal + 1) { ans = add(ans, mul(n / i, i)); }return ans;}// O(sqrt n)inline li calcMod(li n, li m) {li ans = mul(n, m);ans = sub(ans, calcDiv(n, m));return ans;}} // namespace cfvoid test() {vc<pll> results;ll prev = -1;REPD(m, 1, 100000, 1000) {const ll n = m;ll maxval = -1;ll argmax_x = -1;REPM(x, 1, n) {ll val = cf::calcMod(x, m);// dump(x, val);if (chmax(maxval, val)) {argmax_x = x;}}dump(m, argmax_x, (argmax_x - m * 6 / 10), maxval);if (argmax_x != prev) {prev = argmax_x;results.emplace_back(m, argmax_x);}}dump(results);}// Problemvoid solve() {VAR(ll, n, m); //ll maxval = -1;// ll argmax_x = -1;const ll x_center = min(n, m * 6 / 10);const ll xmin = max(1LL, x_center - 3000); // 1;const ll xmax = min(n, x_center + 3000); // n;REPM(x, xmin, xmax) {ll val = cf::calcMod(x, m);// dump(x, val);if (chmax(maxval, val)) {// dump(x, maxval);// argmax_x = x;}}// dump(argmax_x, maxval);pprint(maxval);}// entry pointint main() {solve();// test();return 0;}