oj.uz

Submission #565539

# Submission time Handle Problem Language Result Execution time Memory
565539 2022-05-21T05:25:45 Z Forested Split the sequence (APIO14_sequence) C++17
100 / 100
 1862 ms 31792 KB 
// ===== template.hpp =====
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

template <typename F, typename Comp = less<>>
Vec<i32> sort_index(i32 n, F f, Comp comp = Comp()) {
    Vec<i32> idx(n);
    iota(ALL(idx), 0);
    sort(ALL(idx), [&](i32 i, i32 j) -> bool {
        return comp(f(i), f(j));
    });
    return idx;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;

struct FastIO {
    FastIO() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(10);
    }
} fast_io;
// ===== template.hpp =====

#ifdef DEBUGF
#include "cpl/template/debug.hpp"
#else
#define DBG(x) (void) 0
#endif

// ===== utils.hpp =====

constexpr bool is_prime(unsigned n) {
    if (n == 0 || n == 1) {
        return false;
    }
    for (unsigned i = 2; i * i <= n; ++i) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

constexpr unsigned mod_pow(unsigned x, unsigned y, unsigned mod) {
    unsigned ret = 1, self = x;
    while (y != 0) {
        if (y & 1) {
            ret = static_cast<unsigned>(static_cast<unsigned long long>(ret) * self % mod);
        }
        self = static_cast<unsigned>(static_cast<unsigned long long>(self) * self % mod);
        y /= 2;
    }
    return ret;
}

template <unsigned mod>
constexpr unsigned primitive_root() {
    static_assert(is_prime(mod), "`mod` must be a prime number.");
    if (mod == 2) {
        return 1;
    }

    unsigned primes[32] = {};
    int it = 0;
    {
        unsigned m = mod - 1;
        for (unsigned i = 2; i * i <= m; ++i) {
            if (m % i == 0) {
                primes[it++] = i;
                while (m % i == 0) {
                    m /= i;
                }
            }
        }
        if (m != 1) {
            primes[it++] = m;
        }
    }
    for (unsigned i = 2; i < mod; ++i) {
        bool ok = true;
        for (int j = 0; j < it; ++j) {
            if (mod_pow(i, (mod - 1) / primes[j], mod) == 1) {
                ok = false;
                break;
            }
        }
        if (ok)
            return i;
    }
    return 0;
}

// y >= 1
template <typename T>
constexpr T safe_mod(T x, T y) {
    x %= y;
    if (x < 0) {
        x += y;
    }
    return x;
}

// y != 0
template <typename T>
constexpr T floor_div(T x, T y) {
    if (y < 0) {
        x *= -1;
        y *= -1;
    }
    if (x >= 0) {
        return x / y;
    } else {
        return -((-x + y - 1) / y);
    }
}

// y != 0
template <typename T>
constexpr T ceil_div(T x, T y) {
    if (y < 0) {
        x *= -1;
        y *= -1;
    }
    if (x >= 0) {
        return (x + y - 1) / y;
    } else {
        return -(-x / y);
    }
}
// ===== utils.hpp =====

// monotone
class CHT {
    deque<tuple<i64, i64, i32>> que;
    
    bool need(const tuple<i64, i64, i32> &a, const tuple<i64, i64, i32> &b, const tuple<i64, i64, i32> &c) const {
        i64 ab = floor_div(get<1>(b) - get<1>(a), get<0>(a) - get<0>(b));
        i64 bc = floor_div(get<1>(c) - get<1>(b), get<0>(b) - get<0>(c));
        return ab < bc;
    }
    
public:
    CHT() : que() {}
    
    void add(i64 a, i64 b, i32 idx) {
        if (!que.empty() && get<0>(que.back()) == a) {
            if (get<1>(que.back()) > b) {
                que.pop_back();
            } else {
                return;
            }
        }
        que.emplace_back(a, b, idx);
        while (que.size() >= 3) {
            if (!need(que[que.size() - 3], que[que.size() - 2], que[que.size() - 1])) {
                swap(que[que.size() - 2], que[que.size() - 1]);
                que.pop_back();
            } else {
                break;
            }
        }
    }
    
    i32 argmin(i64 x) {
        assert(!que.empty());
        while (que.size() >= 2) {
            i64 fi = get<0>(que[0]) * x + get<1>(que[0]);
            i64 se = get<0>(que[1]) * x + get<1>(que[1]);
            if (fi >= se) {
                que.pop_front();
            } else {
                break;
            }
        }
        return get<2>(que[0]);
    }
};

int main() {
    i32 n, k;
    cin >> n >> k;
    ++k;
    Vec<i64> a(n);
    REP(i, n) {
        cin >> a[i];
    }
    
    Vec<i64> sum(n + 1, 0), sqsum(n + 1, 0);
    REP(i, n) {
        sum[i + 1] = sum[i] + a[i];
        sqsum[i + 1] = sqsum[i] + a[i] * a[i];
    }
    const auto product_sum = [&](i32 l, i32 r) -> i64 {
        i64 s = sum[r] - sum[l], sq = sqsum[r] - sqsum[l];
        return (s * s - sq) / 2;
    };
    
    Vec<i64> dp(n + 1, INF64);
    dp[0] = 0;
    Vec<Vec<i64>> hist;
    const i32 interval = 10;
    REP(i, k) {
        if (i % interval == 0) {
            hist.push_back(dp);
        }
        Vec<i64> ndp(n + 1, INF64);
        CHT cht;
        REP(j, i + 1, n + 1) {
            cht.add(-sum[j - 1], dp[j - 1] + (sum[j - 1] * sum[j - 1] + sqsum[j - 1]) / 2, j - 1);
            i32 arg = cht.argmin(sum[j]);
            ndp[j] = dp[arg] + product_sum(arg, j);
        }
        dp = move(ndp);
    }
    hist.push_back(dp);
    
    i64 ans = product_sum(0, n) - dp[n];
    
    Vec<i64> prevs;
    prevs.reserve(k);
    i32 now = n;
    PER(i, hist.size() - 1) {
        i32 l = interval * i;
        i32 r = min(k, interval * (i + 1));
        Vec<i64> dp_ = hist[i];
        Vec<Vec<i64>> args(r - l, Vec<i64>(n + 1, -1));
        REP(j, r - l) {
            Vec<i64> ndp(n + 1, INF64);
            CHT cht;
            REP(m, l + j + 1, n + 1) {
                cht.add(-sum[m - 1], dp_[m - 1] + (sum[m - 1] * sum[m - 1] + sqsum[m - 1]) / 2, m - 1);
                i32 arg = cht.argmin(sum[m]);
                ndp[m] = dp_[arg] + product_sum(arg, m);
                args[j][m] = arg;
            }
            DBG(ndp);
            dp_ = move(ndp);
        }
        DBG(dp_);
        DBG(hist[i + 1]);
        PER(j, r - l) {
            now = args[j][now];
            prevs.push_back(now);
        }
    }
    reverse(ALL(prevs));
    
    cout << ans << '\n';
    REP(i, 1, k) {
        cout << prevs[i] << " \n"[i + 1 == k];
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 212 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 212 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 212 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 212 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 212 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 212 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 212 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 212 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 212 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 212 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 212 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 212 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 212 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 212 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 212 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 212 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 212 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 212 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 212 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 212 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 212 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 212 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 340 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 340 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 340 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 340 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 340 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 340 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 340 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 340 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 340 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 340 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 15 ms 596 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 340 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 15 ms 628 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 13 ms 596 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 19 ms 612 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 13 ms 596 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 5 ms 504 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 7 ms 536 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1236 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 1432 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 229 ms 3380 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 1364 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 107 ms 2772 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 123 ms 2836 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 167 ms 3000 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 109 ms 2752 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 148 ms 2912 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 148 ms 3400 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 10692 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 41 ms 10844 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1862 ms 31792 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 49 ms 11440 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1797 ms 31484 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1319 ms 26564 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1578 ms 27776 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 1330 ms 25328 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1272 ms 26732 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1607 ms 29916 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845