結果
| 問題 | No.1977 Extracting at Constant Intervals |
| ユーザー |
 kuhaku
|
| 提出日時 | 2023-09-20 19:33:42 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,590 bytes |
| コンパイル時間 | 6,169 ms |
| コンパイル使用メモリ | 301,048 KB |
| 最終ジャッジ日時 | 2025-01-17 20:05:26 |
| 合計ジャッジ時間 | 7,626 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /usr/include/c++/13/string:43,
from /usr/include/c++/13/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
from /home/kuhaku/atcoder/github/algo/lib/template/template.hpp:5:
/usr/include/c++/13/bits/allocator.h: In destructor ‘constexpr std::_Vector_base<int, std::allocator<int> >::_Vector_impl::~_Vector_impl()’:
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘constexpr std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = int]’: target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /usr/include/c++/13/vector:66,
from /usr/include/c++/13/functional:64,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53:
/usr/include/c++/13/bits/stl_vector.h:133:14: note: called from here
133 | struct _Vector_impl
| ^~~~~~~~~~~~
ソースコード
#line 1 "a.cpp"#define PROBLEM "https://yukicoder.me/problems/no/1097"#line 2 "/home/kuhaku/atcoder/github/algo/lib/template/template.hpp"#pragma GCC target("sse4.2,avx2,bmi2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>template <class T, class U>bool chmax(T &a, const U &b) {return a < (T)b ? a = (T)b, true : false;}template <class T, class U>bool chmin(T &a, const U &b) {return (T)b < a ? a = (T)b, true : false;}constexpr std::int64_t INF = 1000000000000000003;constexpr int Inf = 1000000003;constexpr int MOD = 1000000007;constexpr int MOD_N = 998244353;constexpr double EPS = 1e-7;constexpr double PI = M_PI;#line 2 "/home/kuhaku/atcoder/github/algo/lib/algorithm/doubling.hpp"/*** @brief ダブリング** @tparam L* @tparam Monoid モノイド*/template <int L, class Monoid = void>struct Doubling {private:using T = Monoid::value_type;public:template <class U>Doubling(const std::vector<int> &to, const std::vector<U> &v) : Doubling(to.size()) {build(to, v);}std::pair<int, T> jump(int f, std::uint64_t k) { return solve(f, k); }std::pair<int, T> solve(int f, std::uint64_t k) {T res = Monoid::id;for (int cnt = 0; k > 0; k >>= 1, ++cnt) {if (k & 1) {res = Monoid::op(res, data[cnt][f]);f = table[cnt][f];}}return std::make_pair(f, res);}private:int _size;std::vector<std::vector<int>> table;std::vector<std::vector<T>> data;Doubling(int n) : _size(n), table(L, std::vector<int>(n)), data(L, std::vector<T>(n)) {}template <class U>void build(const std::vector<int> &to, const std::vector<U> &v) {assert(to.size() == v.size());for (int i = 0; i < _size; ++i) {assert(-1 <= to[i] && to[i] < _size);table[0][i] = to[i];data[0][i] = v[i];}for (int i = 0; i < L - 1; ++i) {for (int j = 0; j < _size; ++j) {int k = table[i][j];if (k != -1) {table[i + 1][j] = table[i][k];data[i + 1][j] = Monoid::op(data[i][j], data[i][k]);} else {table[i + 1][j] = table[i][j];data[i + 1][j] = data[i][j];}}}}};/*** @brief ダブリング** @tparam L*/template <int L>struct Doubling<L, void> {Doubling(const std::vector<int> &v) : Doubling(v.size()) { build(v); }int jump(int f, std::uint64_t k) { return solve(f, k); }int solve(int f, std::uint64_t k) {for (int cnt = 0; k > 0; k >>= 1, ++cnt) {if (k & 1) f = data[cnt][f];}return f;}private:int _size;std::vector<std::vector<int>> data;Doubling(int n) : _size(n), data(L, std::vector<int>(n)) {}void build(const std::vector<int> &v) {for (int i = 0; i < _size; ++i) {assert(-1 <= v[i] && v[i] < _size);data[0][i] = v[i];}for (int i = 0; i < L - 1; ++i) {for (int j = 0; j < _size; ++j) {if (data[i][j] != -1) data[i + 1][j] = data[i][data[i][j]];}}}};#line 3 "/home/kuhaku/atcoder/github/algo/lib/template/macro.hpp"#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)#define rep(i, n) FOR (i, 0, n)#define repn(i, n) FOR (i, 1, n + 1)#define repr(i, n) FORR (i, n, 0)#define repnr(i, n) FORR (i, n + 1, 1)#define all(s) (s).begin(), (s).end()#line 3 "/home/kuhaku/atcoder/github/algo/lib/template/sonic.hpp"struct Sonic {Sonic() {std::ios::sync_with_stdio(false);std::cin.tie(nullptr);}constexpr void operator()() const {}} sonic;#line 5 "/home/kuhaku/atcoder/github/algo/lib/template/atcoder.hpp"using namespace std;using ll = std::int64_t;using ld = long double;template <class T, class U>std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {return is >> p.first >> p.second;}template <class T>std::istream &operator>>(std::istream &is, std::vector<T> &v) {for (T &i : v) is >> i;return is;}template <class T, class U>std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {return os << '(' << p.first << ',' << p.second << ')';}template <class T>std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {for (auto it = v.begin(); it != v.end(); ++it) {os << (it == v.begin() ? "" : " ") << *it;}return os;}template <class Head, class... Tail>void co(Head &&head, Tail &&...tail) {if constexpr (sizeof...(tail) == 0) std::cout << head << '\n';else std::cout << head << ' ', co(std::forward<Tail>(tail)...);}template <class Head, class... Tail>void ce(Head &&head, Tail &&...tail) {if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n';else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);}template <typename T, typename... Args>auto make_vector(T x, int arg, Args... args) {if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);else return std::vector(arg, make_vector<T>(x, args...));}void setp(int n) {std::cout << std::fixed << std::setprecision(n);}void Yes(bool is_correct = true) {std::cout << (is_correct ? "Yes" : "No") << '\n';}void No(bool is_not_correct = true) {Yes(!is_not_correct);}void YES(bool is_correct = true) {std::cout << (is_correct ? "YES" : "NO") << '\n';}void NO(bool is_not_correct = true) {YES(!is_not_correct);}void Takahashi(bool is_correct = true) {std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n';}void Aoki(bool is_not_correct = true) {Takahashi(!is_not_correct);}#line 4 "a.cpp"struct Monoid {using value_type = ll;static constexpr ll id = 0;static constexpr ll op(const ll &lhs, const ll &rhs) {return lhs + rhs;}};int main(void) {ll n, m, l;cin >> n >> m >> l;vector<int> a(n);cin >> a;vector<int> to(n);rep (i, n) to[i] = (i + l) % n;Doubling<40, Monoid> db(to, a);ll r = (n * m) % l;ll k = (n * m) / l;ll ans = -INF;rep (i, min(r, n)) chmax(ans, db.solve(i, k + 1).second);rep (i, min(l - r, n)) chmax(ans, db.solve((r + i) % n, k).second);co(ans);return 0;}