oj.uz

답안 #364185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364185 2021-02-08T11:02:26 Z cpp219 Cake 3 (JOI19_cake3) C++
100 / 100
 1925 ms 13548 KB 

#include <bits/stdc++.h>

using namespace std;

#define sz(x) (int)x.size()
#define fi first
#define se second

typedef long long lli;
typedef pair<int, int> pii;

const int maxn = 2e5 + 5;
const lli inf = 1e18;

int n, m;
pii cakes[maxn];

vector<int> vals;

lli f[maxn];

struct segment_tree
{
    lli total[maxn * 4];
    int cnt[maxn * 4];

    void update(int x, int l, int r, int p, int k)
    {
        if(l == r)
        {
            total[x] += vals[l - 1] * k;
            cnt[x] += k;
            return;
        }
        int mid = (l + r) / 2;
        if(p <= mid) update(x * 2, l, mid, p, k);
        else update(x * 2 + 1, mid + 1, r, p, k);
        total[x] = total[x * 2] + total[x * 2 + 1];
        cnt[x] = cnt[x * 2] + cnt[x * 2 + 1];
    }

    lli get(int x, int l, int r, int k)
    {
        if(l == r) return vals[l - 1] * 1LL * min(k, cnt[x]);
        int mid = (l + r) / 2;
        if(cnt[x * 2 + 1] <= k)
            return total[x * 2 + 1] + get(x * 2, l, mid, k - cnt[x * 2 + 1]);
        else return get(x * 2 + 1, mid + 1, r, k);
    }
} tree;

void read_input()
{
    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
        cin >> cakes[i].fi >> cakes[i].se;
}

void init()
{
    sort(cakes + 1, cakes + n + 1, [](pii p, pii q)
         {
             return p.se < q.se;
         });
    for(int i = 1; i <= n; ++i)
        vals.push_back(cakes[i].fi);
    sort(vals.begin(), vals.end());
    vals.erase(unique(vals.begin(), vals.end()), vals.end());
    for(int i = 1; i <= n; ++i)
        cakes[i].fi = lower_bound(vals.begin(), vals.end(), cakes[i].fi) - vals.begin() + 1;
}

lli query(int l, int r)
{
    static int curl = 1, curr = 0;
    while(curr < r)
    {
        ++curr;
        tree.update(1, 1, sz(vals), cakes[curr].fi, 1);
    }
    while(curr > r)
    {
        tree.update(1, 1, sz(vals), cakes[curr].fi, -1);
        --curr;
    }
    while(curl > l)
    {
        --curl;
        tree.update(1, 1, sz(vals), cakes[curl].fi, 1);
    }
    while(curl < l)
    {
        tree.update(1, 1, sz(vals), cakes[curl].fi, -1);
        ++curl;
    }
    return tree.get(1, 1, sz(vals), m);
}

void dnc(int l, int r, int optl, int optr)
{
    if(l > r) return;
    int mid = (l + r) / 2;
    lli best = -inf;
    int opt = 0;
    for(int i = max(mid + m - 1, optl); i <= optr; ++i)
    {
        lli k = query(mid, i) - 2LL * (cakes[i].se - cakes[mid].se);
        if(k > best)
        {
            best = k;
            opt = i;
        }
    }
    f[mid] = best;
    dnc(l, mid - 1, optl, opt);
    dnc(mid + 1, r, opt, optr);
}

void solve()
{
    dnc(1, n - m + 1, 1, n);
    lli ans = -inf;
    for(int i = 1; i <= n - m + 1; ++i)
        ans = max(ans, f[i]);
    cout << ans << '\n';
}

int main()
{
    #define task "test"
    if (fopen(task".INP","r")){
        freopen(task".INP","r",stdin);
        freopen(task".ans","w",stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    read_input();
    init();
    solve();
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:134:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  134 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:135:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  135 |         freopen(task".ans","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 7 ms 492 KB Output is correct
39 Correct 6 ms 492 KB Output is correct
40 Correct 4 ms 492 KB Output is correct
41 Correct 5 ms 492 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 5 ms 492 KB Output is correct
45 Correct 5 ms 508 KB Output is correct
46 Correct 6 ms 492 KB Output is correct
47 Correct 6 ms 492 KB Output is correct
48 Correct 6 ms 492 KB Output is correct
49 Correct 5 ms 492 KB Output is correct
50 Correct 5 ms 492 KB Output is correct
51 Correct 5 ms 620 KB Output is correct
52 Correct 4 ms 492 KB Output is correct
53 Correct 4 ms 492 KB Output is correct
54 Correct 3 ms 492 KB Output is correct
55 Correct 3 ms 492 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 3 ms 492 KB Output is correct
58 Correct 3 ms 492 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 2 ms 364 KB Output is correct
61 Correct 2 ms 396 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 5 ms 492 KB Output is correct
66 Correct 4 ms 492 KB Output is correct
67 Correct 5 ms 492 KB Output is correct
68 Correct 4 ms 492 KB Output is correct
69 Correct 4 ms 492 KB Output is correct
70 Correct 4 ms 492 KB Output is correct
71 Correct 2 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 5 ms 492 KB Output is correct
74 Correct 2 ms 492 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 7 ms 492 KB Output is correct
39 Correct 6 ms 492 KB Output is correct
40 Correct 4 ms 492 KB Output is correct
41 Correct 5 ms 492 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 5 ms 492 KB Output is correct
45 Correct 5 ms 508 KB Output is correct
46 Correct 6 ms 492 KB Output is correct
47 Correct 6 ms 492 KB Output is correct
48 Correct 6 ms 492 KB Output is correct
49 Correct 5 ms 492 KB Output is correct
50 Correct 5 ms 492 KB Output is correct
51 Correct 5 ms 620 KB Output is correct
52 Correct 4 ms 492 KB Output is correct
53 Correct 4 ms 492 KB Output is correct
54 Correct 3 ms 492 KB Output is correct
55 Correct 3 ms 492 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 3 ms 492 KB Output is correct
58 Correct 3 ms 492 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 2 ms 364 KB Output is correct
61 Correct 2 ms 396 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 5 ms 492 KB Output is correct
66 Correct 4 ms 492 KB Output is correct
67 Correct 5 ms 492 KB Output is correct
68 Correct 4 ms 492 KB Output is correct
69 Correct 4 ms 492 KB Output is correct
70 Correct 4 ms 492 KB Output is correct
71 Correct 2 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 5 ms 492 KB Output is correct
74 Correct 2 ms 492 KB Output is correct
75 Correct 1613 ms 9984 KB Output is correct
76 Correct 1925 ms 13396 KB Output is correct
77 Correct 1411 ms 13288 KB Output is correct
78 Correct 1470 ms 13548 KB Output is correct
79 Correct 168 ms 12520 KB Output is correct
80 Correct 279 ms 12648 KB Output is correct
81 Correct 990 ms 7444 KB Output is correct
82 Correct 1369 ms 8644 KB Output is correct
83 Correct 1188 ms 7920 KB Output is correct
84 Correct 1234 ms 8580 KB Output is correct
85 Correct 1022 ms 7444 KB Output is correct
86 Correct 538 ms 6760 KB Output is correct
87 Correct 590 ms 6888 KB Output is correct
88 Correct 878 ms 7068 KB Output is correct
89 Correct 801 ms 7160 KB Output is correct
90 Correct 586 ms 7260 KB Output is correct
91 Correct 366 ms 6248 KB Output is correct
92 Correct 386 ms 6248 KB Output is correct
93 Correct 455 ms 6760 KB Output is correct
94 Correct 306 ms 6504 KB Output is correct
95 Correct 539 ms 7276 KB Output is correct
96 Correct 76 ms 6248 KB Output is correct
97 Correct 79 ms 6760 KB Output is correct
98 Correct 81 ms 6696 KB Output is correct
99 Correct 77 ms 6632 KB Output is correct
100 Correct 70 ms 6120 KB Output is correct
101 Correct 70 ms 6120 KB Output is correct
102 Correct 663 ms 6632 KB Output is correct
103 Correct 610 ms 6632 KB Output is correct
104 Correct 740 ms 7100 KB Output is correct
105 Correct 508 ms 6632 KB Output is correct
106 Correct 507 ms 6636 KB Output is correct
107 Correct 437 ms 6376 KB Output is correct
108 Correct 1342 ms 13420 KB Output is correct
109 Correct 1040 ms 13416 KB Output is correct
110 Correct 140 ms 5608 KB Output is correct
111 Correct 194 ms 6120 KB Output is correct
112 Correct 1550 ms 12156 KB Output is correct
113 Correct 169 ms 12904 KB Output is correct