結果

問題 No.913 木の燃やし方
ユーザー square1001
提出日時 2020-02-13 21:48:38
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,184 bytes
コンパイル時間 1,500 ms
コンパイル使用メモリ 108,800 KB
実行使用メモリ 18,072 KB
最終ジャッジ日時 2024-10-06 06:29:16
合計ジャッジ時間 13,449 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30 WA * 4
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <set>
#include <deque>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const long long inf = 1LL << 62;
vector<long long> subsolve(int N, vector<long long> A) {
    A.insert(A.begin(), 0);
    for (int i = 0; i < N; ++i) {
        A[i + 1] += A[i];
    }
    // minimize (A[i] - A[j]) + (i - j)^2 = (A[i] + i * i) + (-A[j] + j * j) - 2 * j * i for each i
    vector<long long> intercept(N + 1), slope(N + 1);
    for (int i = 0; i <= N; ++i) {
        intercept[i] = -A[i] + 1LL * i * i;
        slope[i] = -2 * i;
    }
    int mid = (N + 1) / 2;
    vector<long long> seq(N, inf);
    deque<int> que;
    for (int i = 0; i < mid; ++i) {
        while (que.size() >= 2) {
            int pa = que[que.size() - 2];
            int pb = que[que.size() - 1];
            long double cra = -(long double)(intercept[pa] - intercept[i]) * (i - pb);
            long double crb = -(long double)(intercept[pb] - intercept[i]) * (i - pa);
            if (cra > crb) que.pop_back();
            else break;
        }
        que.push_back(i);
        while (que.size() >= 2) {
            int pa = que[0];
            int pb = que[1];
            long long va = 1LL * slope[pa] * (i + 1) + intercept[pa];
            long long vb = 1LL * slope[pb] * (i + 1) + intercept[pb];
            if (va > vb) que.pop_front();
            else break;
        }
    }
    for (int i = mid; i <= N; ++i) {
        seq[i - 1] = que[0];
        while (que.size() >= 2) {
            int pa = que[que.size() - 2];
            int pb = que[que.size() - 1];
            long double cra = -(long double)(intercept[pa] - intercept[i]) * (i - pb);
            long double crb = -(long double)(intercept[pb] - intercept[i]) * (i - pa);
            if (cra > crb) que.pop_back();
            else break;
        }
        while (que.size() >= 2) {
            int pa = que[0];
            int pb = que[1];
            long long va = 1LL * slope[pa] * (i + 1) + intercept[pa];
            long long vb = 1LL * slope[pb] * (i + 1) + intercept[pb];
            if (va > vb) que.pop_front();
            else break;
        }
    }
    for (int i = 0; i < N; ++i) {
        if (seq[i] != inf) {
            seq[i] = A[i + 1] - A[seq[i]] + 1LL * (i + 1 - seq[i]) * (i + 1 - seq[i]);
        }
    }
    for (int i = N - 2; i >= mid - 1; --i) {
        seq[i] = min(seq[i], seq[i + 1]);
    }
    return seq;
}
vector<long long> solve(int N, vector<long long> A) {
    if (N == 1) return vector<long long>({ A[0] + 1 });
    int mid = N / 2;
    vector<long long> res1 = subsolve(N, A);
    reverse(A.begin(), A.end());
    vector<long long> res2 = subsolve(N, A);
    reverse(res2.begin(), res2.end());
    for (int i = 0; i < N; ++i) {
        res1[i] = min(res1[i], res2[i]);
    }
    reverse(A.begin(), A.end());
    vector<long long> res3 = solve(mid, vector<long long>(A.begin(), A.begin() + mid));
    vector<long long> res4 = solve(N - mid, vector<long long>(A.begin() + mid, A.end()));
    for (int i = 0; i < mid; ++i) {
        res1[i] = min(res1[i], res3[i]);
    }
    for (int i = mid; i < N; ++i) {
        res1[i] = min(res1[i], res4[i - mid]);
    }
    return res1;
}
vector<long long> solve_easy(int N, vector<long long> A) {
    vector<long long> ans(N, 1LL << 62);
    for (int i = 0; i < N; ++i) {
        for (int j = i + 1; j <= N; ++j) {
            long long sum = 1LL * (j - i) * (j - i);
            for (int k = i; k < j; ++k) {
                sum += A[k];
            }
            for (int k = i; k < j; ++k) {
                ans[k] = min(ans[k], sum);
            }
        }
    }
    return ans;
}
#include <random>
#include <string>
using namespace std;
mt19937 mt(1910182301);
int rand_rng(int l, int r) {
    uniform_int_distribution<int> p(l, r - 1);
    return p(mt);
}
string stringify(vector<long long> A) {
    string res = "[";
    for (int i = 0; i < A.size(); ++i) {
        if (i) res += ", ";
        res += to_string(A[i]);
    }
    res += "]";
    return res;
}
int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<long long> A(N);
    for (int i = 0; i < N; ++i) cin >> A[i];
    vector<long long> ans = solve(N, A);
    for (int i = 0; i < N; ++i) {
        cout << ans[i] << '\n';
    }
    /*
    int N = 3;
    for (int i = 1; i <= 10000; ++i) {
        vector<long long> A(N);
        for (int j = 0; j < N; ++j) {
            A[j] = rand_rng(-6, 7);
        }
        vector<long long> res1 = solve(N, A);
        vector<long long> res2 = solve_easy(N, A);
        if (res1 != res2) {
            cout << "Case #" << i << ":" << endl;
            cout << "N = " << N << ", A = " << stringify(A) << endl;
            cout << "Returns: " << stringify(res1) << endl;
            cout << "Answer: " << stringify(res2) << endl;
            cout << endl;
        }
    }
    */
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0