oj.uz

Submission #631131

# Submission time Handle Problem Language Result Execution time Memory
631131 2022-08-17T17:43:42 Z cadmiumsky Cake 3 (JOI19_cake3) C++14
100 / 100
 3051 ms 24500 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;

#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;
const int nmax = 2e5 + 5;
const ll inf = 2e15 + 5;

int n, m;

namespace DS {
  multiset<int> vals;
  ll sum;
  vector<pii> rollback;
  
  void print() {cerr << "#"; for(auto x : vals) cerr << x << ' '; cerr << "== " << sum << "# "; }
  int gettime() {return rollback.size(); }
  void insert(int x) {
    vals.insert(x);
    sum += x;
    rollback.emplace_back(x, -1);
    if(vals.size() > m)
      sum -= (rollback.back().second = *vals.begin()),
      vals.erase(vals.begin());
    return;
  }
  void pop() {
    if(rollback.back().second != -1)
      sum += rollback.back().second,
      vals.insert(rollback.back().second);
    sum -= rollback.back().first;
    vals.erase(vals.find(rollback.back().first));
    rollback.pop_back();
    return;
  }
  ll query() {return vals.size() != m? -2 * inf : sum;} 
}

ll dp[nmax];
ll atr[nmax], v[nmax], c[nmax];

void divide(int l, int r, int optl, int optr) { // (r, optl), optl - optr, de unde poti sa iei fillere. mereu iei pozitia dupa opt_i
  if(r < l) return;
  int mid = l + r >> 1;
  int T0 = DS::gettime();
  int start;
  if(r < optl) {
    start = optl;
    for(int i = mid + 1; i <= r; i++) {
      DS::insert(v[i]);
    }
  }
  else
    start = mid + 1;
  
  dp[mid] = -inf;
  atr[mid] = -1;
  //cerr << mid << ": ";
  for(int i = start; i <= optr; i++) {
    DS::insert(v[i]);
    ll f_i = -(c[i + 1] - c[mid]) * 2 + v[mid] + v[i + 1] + DS::query();
    //cerr << i << "/ ";
    //DS::print();
    //cerr << f_i << "    ";
    if(dp[mid] <= f_i)
      dp[mid] = f_i,
      atr[mid] = i;
  }
  //cerr << '\n';
  assert(atr[mid] != -1);
  
  while(DS::gettime() > T0) DS::pop();
  for(int i = mid; i <= min(r, optl - 1); i++) DS::insert(v[i]);
  divide(l, mid - 1, optl, atr[mid]);
  
  while(DS::gettime() > T0) DS::pop();
  for(int i = max(r + 1, optl); i < atr[mid]; i++) DS::insert(v[i]);
  divide(mid + 1, r, atr[mid], optr);
  return;
}

signed main() {
  cin >> n >> m;
  m -= 2;
  vector<pii> dummy(n);
  for(auto &[a, b] : dummy) cin >> b >> a;
  sort(dummy.begin(), dummy.end());
  
  //for(auto [a, b] : dummy) cerr << a << '\t' << b << '\n';
  //cerr << '\n';
  
  for(int i = 0; i < n; i++)
    dp[i] = -inf,
    tie(c[i], v[i]) = dummy[i]; 
  
  for(int i = n - m - 1; i < m; i++) DS::insert(v[i]);
  
  divide(0, n - m - 2, m, n - 2);
  
  ll mx = dp[0];
  for(int i = 0; i < n; i++) mx = max(mx, dp[i]);
  //for(int i = 0; i < n; i++) cerr << atr[i] << ' ';
  //cerr << '\n';
  
  cout << mx << '\n';
}

/**
  De-atâtea nopți aud plouând,
  Aud materia plângând..
  Sînt singur, și mă duce un gând
  Spre locuințele lacustre.

  Și parcă dorm pe scânduri ude,
  În spate mă izbește-un val --
  Tresar prin somn și mi se pare
  Că n-am tras podul de la mal.

  Un gol istoric se întinde,
  Pe-același vremuri mă găsesc..
  Și simt cum de atâta ploaie
  Pilonii grei se prăbușesc.

  De-atâtea nopți aud plouând,
  Tot tresărind, tot așteptând..
  Sînt singur, și mă duce-un gând
  Spre locuințele lacustre.
-- George Bacovia, Lacustră
*/

Compilation message

cake3.cpp: In function 'void DS::insert(ll)':
cake3.cpp:28:20: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   28 |     if(vals.size() > m)
      |        ~~~~~~~~~~~~^~~
cake3.cpp: In function 'll DS::query()':
cake3.cpp:42:34: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   42 |   ll query() {return vals.size() != m? -2 * inf : sum;}
      |                      ~~~~~~~~~~~~^~~~
cake3.cpp: In function 'void divide(ll, ll, ll, ll)':
cake3.cpp:50:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   50 |   int mid = l + r >> 1;
      |             ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:92:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   92 |   for(auto &[a, b] : dummy) cin >> b >> a;
      |             ^

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 9 ms 468 KB Output is correct
39 Correct 11 ms 468 KB Output is correct
40 Correct 7 ms 500 KB Output is correct
41 Correct 7 ms 468 KB Output is correct
42 Correct 5 ms 468 KB Output is correct
43 Correct 6 ms 468 KB Output is correct
44 Correct 8 ms 468 KB Output is correct
45 Correct 9 ms 468 KB Output is correct
46 Correct 9 ms 476 KB Output is correct
47 Correct 10 ms 480 KB Output is correct
48 Correct 8 ms 476 KB Output is correct
49 Correct 7 ms 468 KB Output is correct
50 Correct 8 ms 468 KB Output is correct
51 Correct 10 ms 468 KB Output is correct
52 Correct 7 ms 468 KB Output is correct
53 Correct 8 ms 468 KB Output is correct
54 Correct 5 ms 468 KB Output is correct
55 Correct 4 ms 468 KB Output is correct
56 Correct 4 ms 468 KB Output is correct
57 Correct 5 ms 492 KB Output is correct
58 Correct 4 ms 468 KB Output is correct
59 Correct 6 ms 468 KB Output is correct
60 Correct 7 ms 480 KB Output is correct
61 Correct 7 ms 480 KB Output is correct
62 Correct 6 ms 468 KB Output is correct
63 Correct 8 ms 468 KB Output is correct
64 Correct 8 ms 468 KB Output is correct
65 Correct 9 ms 476 KB Output is correct
66 Correct 10 ms 476 KB Output is correct
67 Correct 9 ms 468 KB Output is correct
68 Correct 8 ms 468 KB Output is correct
69 Correct 7 ms 484 KB Output is correct
70 Correct 7 ms 492 KB Output is correct
71 Correct 7 ms 480 KB Output is correct
72 Correct 5 ms 468 KB Output is correct
73 Correct 8 ms 468 KB Output is correct
74 Correct 2 ms 468 KB Output is correct
75 Correct 2390 ms 14608 KB Output is correct
76 Correct 2277 ms 16948 KB Output is correct
77 Correct 2242 ms 19336 KB Output is correct
78 Correct 2301 ms 19116 KB Output is correct
79 Correct 242 ms 23284 KB Output is correct
80 Correct 517 ms 22116 KB Output is correct
81 Correct 2577 ms 17088 KB Output is correct
82 Correct 2671 ms 15792 KB Output is correct
83 Correct 2810 ms 17128 KB Output is correct
84 Correct 3051 ms 16788 KB Output is correct
85 Correct 2640 ms 17140 KB Output is correct
86 Correct 1792 ms 19276 KB Output is correct
87 Correct 2023 ms 18868 KB Output is correct
88 Correct 2626 ms 16456 KB Output is correct
89 Correct 2317 ms 18876 KB Output is correct
90 Correct 1991 ms 20644 KB Output is correct
91 Correct 1319 ms 20476 KB Output is correct
92 Correct 1428 ms 20276 KB Output is correct
93 Correct 1565 ms 20544 KB Output is correct
94 Correct 1175 ms 21692 KB Output is correct
95 Correct 1933 ms 20800 KB Output is correct
96 Correct 1330 ms 16460 KB Output is correct
97 Correct 1368 ms 18500 KB Output is correct
98 Correct 1457 ms 17040 KB Output is correct
99 Correct 1286 ms 18840 KB Output is correct
100 Correct 1116 ms 18800 KB Output is correct
101 Correct 1133 ms 18536 KB Output is correct
102 Correct 2125 ms 15516 KB Output is correct
103 Correct 2083 ms 15616 KB Output is correct
104 Correct 2174 ms 15576 KB Output is correct
105 Correct 2264 ms 18748 KB Output is correct
106 Correct 2235 ms 19244 KB Output is correct
107 Correct 1980 ms 19356 KB Output is correct
108 Correct 2566 ms 19352 KB Output is correct
109 Correct 2129 ms 21820 KB Output is correct
110 Correct 1677 ms 18436 KB Output is correct
111 Correct 2184 ms 15208 KB Output is correct
112 Correct 1640 ms 16432 KB Output is correct
113 Correct 241 ms 24500 KB Output is correct