結果
問題 | No.1977 Extracting at Constant Intervals |
ユーザー |
![]() |
提出日時 | 2022-06-10 12:44:18 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 2,384 bytes |
コンパイル時間 | 8,350 ms |
コンパイル使用メモリ | 300,744 KB |
実行使用メモリ | 10,948 KB |
最終ジャッジ日時 | 2024-10-09 09:41:15 |
合計ジャッジ時間 | 10,354 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 31 |
ソースコード
#include <bits/stdc++.h>#include "testlib.h"using namespace std;long long gcd(long long x, long long y) {if (x < y) swap(x, y);while (y > 0) {long long r = x % y;x = y;y = r;}return x;}long long lcm(long long x, long long y) {return x * y / gcd(x, y);}long long solve(vector<long long> A, long long M, long long L) {long long N = A.size();vector<long long> rui(2 * N);rui[0] = A[0];for (int i = 1; i < 2 * N; i++) {rui[i] = rui[i - 1] + A[(i * (L % N)) % N];}if (L <= N) {long long sum = 0;for (int i = 0; i < N; i++) {sum += A[i];}vector<long long> ans(L, (M / L) * sum);M %= L;for (int i = 0; i < N; i++) {if ((i * L) % N < L && N * M - 1 - (i * L) % N >= 0) {ans[(i * L) % N] += rui[i + (N * M - 1 - (i * L) % N) / L] - rui[i] + A[(i * L) % N];}}long long max_ = -1000000000000000000;for (int i = 0; i < L; i++) {max_ = max(max_, ans[i]);}return max_;}else {long long sum = 0;for (int i = 0; i < N; i++) {sum += A[i];}vector<long long> ans(N, (M / L) * sum), ans2(N, (M / L) * sum);M %= L;for (int i = 0; i < N; i++) {if (N * M - 1 - (i * (L % N)) % N >= 0) {ans[(i * (L % N)) % N] += rui[i + (N * M - 1 - (i * (L % N)) % N) / L] - rui[i] + A[(i * (L % N)) % N];}if (N * (M - (L - (i * (L % N)) % N - 1) / N) - 1 - (i * (L % N)) % N >= 0) {ans2[(i * (L % N)) % N] += rui[i + (N * (M - (L - (i * (L % N)) % N - 1) / N) - 1 - (i * (L % N)) % N) / L] - rui[i] + A[(i * (L % N))% N];}}long long max_ = -1000000000000000000;for (int i = 0; i < N; i++) {max_ = max(max_, ans[i]);max_ = max(max_, ans2[i]);}return max_;}}int main() {registerValidation();long long N, M, L;N = inf.readInt(1, 100000, "N");inf.readSpace();M = inf.readInt(1, 1000000000, "M");inf.readSpace();L = inf.readLong(1LL, N * M, "L");inf.readEoln();vector<long long> A(N);A[0] = inf.readInt(-10000, 10000, "A");for (int i = 1; i < N; i++) {inf.readSpace();A[i] = inf.readInt(-10000, 10000, "A");}inf.readEoln();inf.readEof();long long max_ = -1000000000000000000;for (int i = 0; i < gcd(N, L); i++) {vector<long long> B;for (int j = 0; j < N / gcd(N, L); j++) {B.push_back(A[j * gcd(N, L) + i]);}max_ = max(max_, solve(B, M, L / gcd(N, L)));}cout << max_ << endl;}