oj.uz

Submission #362909

# Submission time Handle Problem Language Result Execution time Memory
362909 2021-02-04T16:42:24 Z Lam_lai_cuoc_doi Cake 3 (JOI19_cake3) C++17
100 / 100
 3108 ms 19948 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

const bool typetest = 0;
const int N = 2e5 + 5;
const ll Inf = 1e17;
struct Pakage
{
    int c;
    ll v;
    bool operator<(const Pakage &a) const
    {
        return c < a.c;
    }
} a[N];
int n, m, id[N], now[N];
ll dp[N], ans(0);
struct node
{
    int v;
    ll sum;
    node()
    {
        v = sum = 0;
    }
    void combine(const node &a, const node &b)
    {
        v = a.v + b.v;
        sum = a.sum + b.sum;
    }
};
struct SegmentTree
{
    node st[N * 4];
    bool ck[N];
    SegmentTree()
    {
        memset(ck, 0, sizeof ck);
    }
    void Update(int id, int l, int r, int pos, ll v)
    {
        if (l > pos || r < pos)
            return;
        if (l == pos && l == r)
        {
            st[id].v ^= 1;
            st[id].sum += v;
            return;
        }
        Update(id << 1, l, (l + r) / 2, pos, v);
        Update(id << 1 | 1, (l + r) / 2 + 1, r, pos, v);
        st[id].combine(st[id << 1], st[id << 1 | 1]);
    }
    void Update(int v)
    {
        Update(1, 1, n, v, (ck[v] ? -1 : 1) * a[id[v]].v);
        ck[v] ^= 1;
    }
    ll Get(int id, int l, int r, int d)
    {
        if (l == r)
            return st[id].sum;
        if (st[id << 1].v >= d)
            return Get(id << 1, l, (l + r) / 2, d);
        else
            return st[id << 1].sum + Get(id << 1 | 1, (l + r) / 2 + 1, r, d - st[id << 1].v);
    }
    ll Get(int d)
    {
        if (d <= 0)
            return 0;
        return Get(1, 1, n, d);
    }
} f;

void Read()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i].v >> a[i].c;
        id[i] = i;
    }
    sort(a + 1, a + n + 1);
    sort(id + 1, id + n + 1, [&](const int &x, const int &y) {
        return a[x].v > a[y].v;
    });
}

template <class T>
void Max(T &x, const T &y)
{
    if (x < y)
        x = y;
}

void DAC(int l, int r, int optl, int optr)
{
    if (l > r)
        return;
    int mid = (l + r) / 2, optmid(-1);
    for (int i = r; i >= mid; --i)
        f.Update(now[i]);
    for (int i = optl; i <= optr && i < mid - (m - 2); ++i)
    {
        f.Update(now[i]);
        ll v = f.Get(m - 2);
        if (dp[mid] < a[mid].v - 2 * a[mid].c + a[i].v + 2 * a[i].c + v)
        {
            dp[mid] = a[mid].v - 2 * a[mid].c + a[i].v + 2 * a[i].c + v;
            optmid = i;
        }
    }
    Max(ans, dp[mid]);
    if (optmid != -1)
    {
        for (int i = optl; i <= optr && i < mid - (m - 2); ++i)
            f.Update(now[i]);
        DAC(l, mid - 1, optl, optmid);
        for (int i = r; i >= mid; --i)
            f.Update(now[i]);
        for (int i = optl; i < optmid; ++i)
            f.Update(now[i]);
        DAC(mid + 1, r, optmid, optr);
        for (int i = optl; i < optmid; ++i)
            f.Update(now[i]);
    }
    else
    {
        for (int i = r; i >= mid; --i)
            f.Update(now[i]);
        DAC(mid + 1, r, optl, optr);
    }
}

void Solve()
{
    for (int i = 1; i <= n; ++i)
        now[id[i]] = i,
        f.Update(i);
    fill_n(dp, N, -Inf);
    ans = -Inf;
    DAC(1, n, 1, n);
    cout << ans;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t(1);
    if (typetest)
        cin >> t;
    for (int _ = 1; _ <= t; ++_)
    {
        Read();
        Solve();
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14700 KB Output is correct
2 Correct 10 ms 14700 KB Output is correct
3 Correct 10 ms 14700 KB Output is correct
4 Correct 9 ms 14700 KB Output is correct
5 Correct 8 ms 14700 KB Output is correct
6 Correct 8 ms 14700 KB Output is correct
7 Correct 8 ms 14700 KB Output is correct
8 Correct 8 ms 14584 KB Output is correct
9 Correct 8 ms 14700 KB Output is correct
10 Correct 8 ms 14700 KB Output is correct
11 Correct 8 ms 14700 KB Output is correct
12 Correct 8 ms 14700 KB Output is correct
13 Correct 10 ms 14700 KB Output is correct
14 Correct 8 ms 14700 KB Output is correct
15 Correct 10 ms 14700 KB Output is correct
16 Correct 8 ms 14700 KB Output is correct
17 Correct 8 ms 14700 KB Output is correct
18 Correct 8 ms 14700 KB Output is correct
19 Correct 9 ms 14700 KB Output is correct
20 Correct 10 ms 14700 KB Output is correct
21 Correct 8 ms 14700 KB Output is correct
22 Correct 9 ms 14700 KB Output is correct
23 Correct 10 ms 14700 KB Output is correct
24 Correct 10 ms 14700 KB Output is correct
25 Correct 8 ms 14700 KB Output is correct
26 Correct 8 ms 14700 KB Output is correct
27 Correct 9 ms 14700 KB Output is correct
28 Correct 9 ms 14700 KB Output is correct
29 Correct 9 ms 14700 KB Output is correct
30 Correct 9 ms 14700 KB Output is correct
31 Correct 8 ms 14700 KB Output is correct
32 Correct 8 ms 14700 KB Output is correct
33 Correct 8 ms 14848 KB Output is correct
34 Correct 9 ms 14700 KB Output is correct
35 Correct 9 ms 14700 KB Output is correct
36 Correct 9 ms 14700 KB Output is correct
37 Correct 8 ms 14700 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14700 KB Output is correct
2 Correct 10 ms 14700 KB Output is correct
3 Correct 10 ms 14700 KB Output is correct
4 Correct 9 ms 14700 KB Output is correct
5 Correct 8 ms 14700 KB Output is correct
6 Correct 8 ms 14700 KB Output is correct
7 Correct 8 ms 14700 KB Output is correct
8 Correct 8 ms 14584 KB Output is correct
9 Correct 8 ms 14700 KB Output is correct
10 Correct 8 ms 14700 KB Output is correct
11 Correct 8 ms 14700 KB Output is correct
12 Correct 8 ms 14700 KB Output is correct
13 Correct 10 ms 14700 KB Output is correct
14 Correct 8 ms 14700 KB Output is correct
15 Correct 10 ms 14700 KB Output is correct
16 Correct 8 ms 14700 KB Output is correct
17 Correct 8 ms 14700 KB Output is correct
18 Correct 8 ms 14700 KB Output is correct
19 Correct 9 ms 14700 KB Output is correct
20 Correct 10 ms 14700 KB Output is correct
21 Correct 8 ms 14700 KB Output is correct
22 Correct 9 ms 14700 KB Output is correct
23 Correct 10 ms 14700 KB Output is correct
24 Correct 10 ms 14700 KB Output is correct
25 Correct 8 ms 14700 KB Output is correct
26 Correct 8 ms 14700 KB Output is correct
27 Correct 9 ms 14700 KB Output is correct
28 Correct 9 ms 14700 KB Output is correct
29 Correct 9 ms 14700 KB Output is correct
30 Correct 9 ms 14700 KB Output is correct
31 Correct 8 ms 14700 KB Output is correct
32 Correct 8 ms 14700 KB Output is correct
33 Correct 8 ms 14848 KB Output is correct
34 Correct 9 ms 14700 KB Output is correct
35 Correct 9 ms 14700 KB Output is correct
36 Correct 9 ms 14700 KB Output is correct
37 Correct 8 ms 14700 KB Output is correct
38 Correct 16 ms 14700 KB Output is correct
39 Correct 15 ms 14700 KB Output is correct
40 Correct 13 ms 14700 KB Output is correct
41 Correct 13 ms 14700 KB Output is correct
42 Correct 11 ms 14700 KB Output is correct
43 Correct 12 ms 14700 KB Output is correct
44 Correct 16 ms 14828 KB Output is correct
45 Correct 17 ms 14700 KB Output is correct
46 Correct 19 ms 14700 KB Output is correct
47 Correct 17 ms 14720 KB Output is correct
48 Correct 16 ms 14700 KB Output is correct
49 Correct 14 ms 14700 KB Output is correct
50 Correct 16 ms 14700 KB Output is correct
51 Correct 15 ms 14700 KB Output is correct
52 Correct 14 ms 14700 KB Output is correct
53 Correct 14 ms 14700 KB Output is correct
54 Correct 12 ms 14700 KB Output is correct
55 Correct 12 ms 14700 KB Output is correct
56 Correct 12 ms 14700 KB Output is correct
57 Correct 12 ms 14828 KB Output is correct
58 Correct 11 ms 14700 KB Output is correct
59 Correct 16 ms 14700 KB Output is correct
60 Correct 14 ms 14700 KB Output is correct
61 Correct 14 ms 14700 KB Output is correct
62 Correct 12 ms 14700 KB Output is correct
63 Correct 13 ms 14700 KB Output is correct
64 Correct 16 ms 14828 KB Output is correct
65 Correct 17 ms 14700 KB Output is correct
66 Correct 14 ms 14700 KB Output is correct
67 Correct 17 ms 14700 KB Output is correct
68 Correct 14 ms 14700 KB Output is correct
69 Correct 14 ms 14700 KB Output is correct
70 Correct 14 ms 14720 KB Output is correct
71 Correct 15 ms 14700 KB Output is correct
72 Correct 12 ms 14700 KB Output is correct
73 Correct 15 ms 14700 KB Output is correct
74 Correct 12 ms 14700 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14700 KB Output is correct
2 Correct 10 ms 14700 KB Output is correct
3 Correct 10 ms 14700 KB Output is correct
4 Correct 9 ms 14700 KB Output is correct
5 Correct 8 ms 14700 KB Output is correct
6 Correct 8 ms 14700 KB Output is correct
7 Correct 8 ms 14700 KB Output is correct
8 Correct 8 ms 14584 KB Output is correct
9 Correct 8 ms 14700 KB Output is correct
10 Correct 8 ms 14700 KB Output is correct
11 Correct 8 ms 14700 KB Output is correct
12 Correct 8 ms 14700 KB Output is correct
13 Correct 10 ms 14700 KB Output is correct
14 Correct 8 ms 14700 KB Output is correct
15 Correct 10 ms 14700 KB Output is correct
16 Correct 8 ms 14700 KB Output is correct
17 Correct 8 ms 14700 KB Output is correct
18 Correct 8 ms 14700 KB Output is correct
19 Correct 9 ms 14700 KB Output is correct
20 Correct 10 ms 14700 KB Output is correct
21 Correct 8 ms 14700 KB Output is correct
22 Correct 9 ms 14700 KB Output is correct
23 Correct 10 ms 14700 KB Output is correct
24 Correct 10 ms 14700 KB Output is correct
25 Correct 8 ms 14700 KB Output is correct
26 Correct 8 ms 14700 KB Output is correct
27 Correct 9 ms 14700 KB Output is correct
28 Correct 9 ms 14700 KB Output is correct
29 Correct 9 ms 14700 KB Output is correct
30 Correct 9 ms 14700 KB Output is correct
31 Correct 8 ms 14700 KB Output is correct
32 Correct 8 ms 14700 KB Output is correct
33 Correct 8 ms 14848 KB Output is correct
34 Correct 9 ms 14700 KB Output is correct
35 Correct 9 ms 14700 KB Output is correct
36 Correct 9 ms 14700 KB Output is correct
37 Correct 8 ms 14700 KB Output is correct
38 Correct 16 ms 14700 KB Output is correct
39 Correct 15 ms 14700 KB Output is correct
40 Correct 13 ms 14700 KB Output is correct
41 Correct 13 ms 14700 KB Output is correct
42 Correct 11 ms 14700 KB Output is correct
43 Correct 12 ms 14700 KB Output is correct
44 Correct 16 ms 14828 KB Output is correct
45 Correct 17 ms 14700 KB Output is correct
46 Correct 19 ms 14700 KB Output is correct
47 Correct 17 ms 14720 KB Output is correct
48 Correct 16 ms 14700 KB Output is correct
49 Correct 14 ms 14700 KB Output is correct
50 Correct 16 ms 14700 KB Output is correct
51 Correct 15 ms 14700 KB Output is correct
52 Correct 14 ms 14700 KB Output is correct
53 Correct 14 ms 14700 KB Output is correct
54 Correct 12 ms 14700 KB Output is correct
55 Correct 12 ms 14700 KB Output is correct
56 Correct 12 ms 14700 KB Output is correct
57 Correct 12 ms 14828 KB Output is correct
58 Correct 11 ms 14700 KB Output is correct
59 Correct 16 ms 14700 KB Output is correct
60 Correct 14 ms 14700 KB Output is correct
61 Correct 14 ms 14700 KB Output is correct
62 Correct 12 ms 14700 KB Output is correct
63 Correct 13 ms 14700 KB Output is correct
64 Correct 16 ms 14828 KB Output is correct
65 Correct 17 ms 14700 KB Output is correct
66 Correct 14 ms 14700 KB Output is correct
67 Correct 17 ms 14700 KB Output is correct
68 Correct 14 ms 14700 KB Output is correct
69 Correct 14 ms 14700 KB Output is correct
70 Correct 14 ms 14720 KB Output is correct
71 Correct 15 ms 14700 KB Output is correct
72 Correct 12 ms 14700 KB Output is correct
73 Correct 15 ms 14700 KB Output is correct
74 Correct 12 ms 14700 KB Output is correct
75 Correct 2257 ms 19072 KB Output is correct
76 Correct 2577 ms 19336 KB Output is correct
77 Correct 1955 ms 19464 KB Output is correct
78 Correct 2208 ms 19564 KB Output is correct
79 Correct 270 ms 19436 KB Output is correct
80 Correct 449 ms 19436 KB Output is correct
81 Correct 2550 ms 19564 KB Output is correct
82 Correct 3108 ms 19564 KB Output is correct
83 Correct 2919 ms 19832 KB Output is correct
84 Correct 3035 ms 19820 KB Output is correct
85 Correct 2552 ms 19564 KB Output is correct
86 Correct 1326 ms 19308 KB Output is correct
87 Correct 1449 ms 19436 KB Output is correct
88 Correct 2234 ms 19308 KB Output is correct
89 Correct 2132 ms 19616 KB Output is correct
90 Correct 1533 ms 19752 KB Output is correct
91 Correct 965 ms 19436 KB Output is correct
92 Correct 964 ms 19436 KB Output is correct
93 Correct 1189 ms 19564 KB Output is correct
94 Correct 760 ms 19820 KB Output is correct
95 Correct 1390 ms 19948 KB Output is correct
96 Correct 1319 ms 19440 KB Output is correct
97 Correct 1438 ms 19820 KB Output is correct
98 Correct 1485 ms 19820 KB Output is correct
99 Correct 1304 ms 19772 KB Output is correct
100 Correct 1036 ms 19508 KB Output is correct
101 Correct 1102 ms 19444 KB Output is correct
102 Correct 2079 ms 19444 KB Output is correct
103 Correct 2060 ms 19384 KB Output is correct
104 Correct 2426 ms 19692 KB Output is correct
105 Correct 1792 ms 19704 KB Output is correct
106 Correct 1909 ms 19720 KB Output is correct
107 Correct 1560 ms 19692 KB Output is correct
108 Correct 1911 ms 19564 KB Output is correct
109 Correct 1435 ms 19820 KB Output is correct
110 Correct 1139 ms 19564 KB Output is correct
111 Correct 1710 ms 19564 KB Output is correct
112 Correct 2252 ms 19320 KB Output is correct
113 Correct 275 ms 19820 KB Output is correct