oj.uz

답안 #998446

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998446 2024-06-14T01:56:21 Z HUECTRUM Feast (NOI19_feast) C++14
100 / 100
 972 ms 27036 KB 
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_set>
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <set>
#include <stack>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bitset>
#include <sstream>
#include <ext/rope>
#include <ctime>
#include <random>
#include <cstdlib>
#include <complex>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

/* clang-format off */

/* TYPES  */
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vll vector<long long>
#define vpii vector<pair<int, int>>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vpll vector<pair<long long, long long>>
#define vvpll vector<vector<pair<long long, long long>>>
#define vvi vector<vector<int>>
#define vvll vector<vector<long long>>
#define mii map<int, int>
#define si set<int>
#define sc set<char>



/* FUNCTIONS */
#define feach(el, v) for(auto &el: v)
#define rep(i, n) for(int i=0;i<n;i++)
#define reprv(i, n) for(int i=n-1;i>=0;i--)
#define reps(i, s, e) for(int i=s;i<e;i++)
#define reprve(i, e, s) for(int i=e-1;i>=s;i--)
#define repe(x, y) for (auto &x: y)
#define repe2(x, a, y) for (auto &[x,a]: y)

typedef tree<int, null_type, less_equal<>, rb_tree_tag, tree_order_statistics_node_update> oSet;

const ll mod = 1e9 + 7;

template<ll mod = 1000000007>
struct ModInt {
    ll p;

    ModInt() : p(0) {}

    ModInt(ll x) { p = x >= 0 ? x % mod : x + (-x + mod - 1) / mod * mod; }

    ModInt &operator+=(const ModInt &y) {
        p = p + *y - ((p + *y) >= mod ? mod : 0);
        return *this;
    }

    ModInt &operator-=(const ModInt &y) {
        p = p - *y + (p - *y < 0 ? mod : 0);
        return *this;
    }

    ModInt &operator*=(const ModInt &y) {
        p = (p * *y) % mod;
        return *this;
    }

    ModInt &operator%=(const ModInt &y) {
        if (y)p %= *y;
        return *this;
    }

    ModInt operator+(const ModInt &y) const {
        ModInt x = *this;
        return x += y;
    }

    ModInt operator-(const ModInt &y) const {
        ModInt x = *this;
        return x -= y;
    }

    ModInt operator*(const ModInt &y) const {
        ModInt x = *this;
        return x *= y;
    }

    ModInt operator%(const ModInt &y) const {
        ModInt x = *this;
        return x %= y;
    }

    ModInt binpow(const ModInt &y, ll pow) const {
        pow %= mod - 1;
        ModInt res = 1, a = y;
        while (pow) {
            if (pow & 1) res *= a;
            a *= a, pow >>= 1;
        }
        return res;
    }

    ModInt inv() const { return binpow(*this, mod - 2); }

    ModInt &operator/=(const ModInt &y) {
        p = (p * y.inv().p) % mod;
        return *this;
    }

    ModInt operator/(const ModInt &y) const {
        ModInt x = *this;
        return x /= y;
    }

    friend istream &operator>>(istream &is, ModInt &a) {
        int v;
        is >> v;
        a = ModInt(v);
        return is;
    }

    friend ostream &operator<<(ostream &os, const ModInt &a) { return os << a.p; }

    ModInt &operator++() {
        p = (p + 1) % mod;
        return *this;
    }

    ModInt &operator--() {
        p = (p - 1 + mod) % mod;
        return *this;
    }

    bool operator==(const ModInt &y) const { return p == *y; }

    bool operator!=(const ModInt &y) const { return p != *y; }

    const ll &operator*() const { return p; }

    ll &operator*() { return p; }

};

using Mint = ModInt<>;
#define vmint vector<Mint>

#pragma GCC target("popcnt")

//////////////////////////////////////////////////////////////////////////
int n;
vll v;

pll solve(ll lambda) {
    vvpll dp(n, vpll(2));

    dp[0][0] = {0, 0}, dp[0][1] = {v[0] - lambda, 1};

    reps(i, 1, n) {
        dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
        dp[i][1] = max(
                make_pair(dp[i - 1][0].first + v[i] - lambda, dp[i - 1][0].second + 1),
                make_pair(dp[i - 1][1].first + v[i], dp[i - 1][1].second)
        );
    }

    return max(dp[n - 1][0], dp[n - 1][1]);
}

int main() {
    ll k; cin >> n >> k;

    v = vll(n); rep(i, n) cin >> v[i];

    ll l = 0, r = 1e18;
    while (r > l) {
        ll mid = (l + r + 1) / 2;
        pll sol = solve(mid);

        if (sol.second >= k) l = mid;
        else r = mid - 1;
    }

    pll sL = solve(l);
    cout << sL.first + k * l;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 833 ms 25524 KB Output is correct
2 Correct 877 ms 26224 KB Output is correct
3 Correct 913 ms 26808 KB Output is correct
4 Correct 966 ms 26320 KB Output is correct
5 Correct 869 ms 26208 KB Output is correct
6 Correct 844 ms 25572 KB Output is correct
7 Correct 911 ms 25556 KB Output is correct
8 Correct 877 ms 26288 KB Output is correct
9 Correct 845 ms 25660 KB Output is correct
10 Correct 854 ms 26216 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 842 ms 24520 KB Output is correct
2 Correct 846 ms 25116 KB Output is correct
3 Correct 847 ms 24480 KB Output is correct
4 Correct 837 ms 24700 KB Output is correct
5 Correct 846 ms 25584 KB Output is correct
6 Correct 784 ms 24468 KB Output is correct
7 Correct 826 ms 25340 KB Output is correct
8 Correct 836 ms 26548 KB Output is correct
9 Correct 768 ms 25492 KB Output is correct
10 Correct 785 ms 24920 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 862 ms 26272 KB Output is correct
2 Correct 833 ms 25968 KB Output is correct
3 Correct 878 ms 26200 KB Output is correct
4 Correct 787 ms 25976 KB Output is correct
5 Correct 821 ms 26200 KB Output is correct
6 Correct 843 ms 26372 KB Output is correct
7 Correct 918 ms 26384 KB Output is correct
8 Correct 909 ms 26212 KB Output is correct
9 Correct 918 ms 26932 KB Output is correct
10 Correct 917 ms 26904 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 4 ms 604 KB Output is correct
22 Correct 4 ms 604 KB Output is correct
23 Correct 4 ms 604 KB Output is correct
24 Correct 5 ms 604 KB Output is correct
25 Correct 4 ms 604 KB Output is correct
26 Correct 4 ms 604 KB Output is correct
27 Correct 4 ms 604 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 4 ms 604 KB Output is correct
30 Correct 4 ms 464 KB Output is correct

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 833 ms 25524 KB Output is correct
2 Correct 877 ms 26224 KB Output is correct
3 Correct 913 ms 26808 KB Output is correct
4 Correct 966 ms 26320 KB Output is correct
5 Correct 869 ms 26208 KB Output is correct
6 Correct 844 ms 25572 KB Output is correct
7 Correct 911 ms 25556 KB Output is correct
8 Correct 877 ms 26288 KB Output is correct
9 Correct 845 ms 25660 KB Output is correct
10 Correct 854 ms 26216 KB Output is correct
11 Correct 842 ms 24520 KB Output is correct
12 Correct 846 ms 25116 KB Output is correct
13 Correct 847 ms 24480 KB Output is correct
14 Correct 837 ms 24700 KB Output is correct
15 Correct 846 ms 25584 KB Output is correct
16 Correct 784 ms 24468 KB Output is correct
17 Correct 826 ms 25340 KB Output is correct
18 Correct 836 ms 26548 KB Output is correct
19 Correct 768 ms 25492 KB Output is correct
20 Correct 785 ms 24920 KB Output is correct
21 Correct 862 ms 26272 KB Output is correct
22 Correct 833 ms 25968 KB Output is correct
23 Correct 878 ms 26200 KB Output is correct
24 Correct 787 ms 25976 KB Output is correct
25 Correct 821 ms 26200 KB Output is correct
26 Correct 843 ms 26372 KB Output is correct
27 Correct 918 ms 26384 KB Output is correct
28 Correct 909 ms 26212 KB Output is correct
29 Correct 918 ms 26932 KB Output is correct
30 Correct 917 ms 26904 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 436 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 4 ms 604 KB Output is correct
52 Correct 4 ms 604 KB Output is correct
53 Correct 4 ms 604 KB Output is correct
54 Correct 5 ms 604 KB Output is correct
55 Correct 4 ms 604 KB Output is correct
56 Correct 4 ms 604 KB Output is correct
57 Correct 4 ms 604 KB Output is correct
58 Correct 4 ms 604 KB Output is correct
59 Correct 4 ms 604 KB Output is correct
60 Correct 4 ms 464 KB Output is correct
61 Correct 948 ms 26344 KB Output is correct
62 Correct 928 ms 27036 KB Output is correct
63 Correct 888 ms 26324 KB Output is correct
64 Correct 928 ms 26828 KB Output is correct
65 Correct 906 ms 26820 KB Output is correct
66 Correct 935 ms 26740 KB Output is correct
67 Correct 972 ms 26320 KB Output is correct
68 Correct 936 ms 26844 KB Output is correct
69 Correct 895 ms 26320 KB Output is correct
70 Correct 876 ms 26184 KB Output is correct