oj.uz

Submission #233245

# Submission time Handle Problem Language Result Execution time Memory
233245 2020-05-20T06:46:12 Z AlexLuchianov Cake 3 (JOI19_cake3) C++14
100 / 100
 2836 ms 30312 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <map>
#include <unordered_map>

using namespace std;

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 200000;
ll const inf = 1000000000000000000;

pair<int,int> v[5 + nmax];

unordered_map<int,int> code;
int decode[1 + nmax];

void normalize(int n){
  vector<int> temp;
  for(int i = 1;i <= n; i++)
    temp.push_back(v[i].second);
  sort(temp.begin(), temp.end());
  temp.erase(unique(temp.begin(), temp.end()), temp.end());
  for(int i = 0; i < temp.size(); i++) {
    code[temp[i]] = 1 + i;
    decode[i + 1] = temp[i];
  }
  for(int i = 1;i <= n; i++)
    v[i].second = code[v[i].second];
}

class SegmentTree{
private:
  vector<pair<int, ll>> aint;
  pair<int, ll> _add(pair<int, ll> f1, pair<int,ll> f2){
    return {f1.first + f2.first, f1.second + f2.second};
  }
public:
  SegmentTree(int n){
    aint.resize(1 + 4 * n);
  }

  void computenode(int node, int from, int to){
    aint[node] = _add(aint[node * 2], aint[node * 2 + 1]);
  }

  void update(int node, int from, int to, int x, pair<int, ll> val){
    aint[node] = _add(aint[node], val);
    if(from < to){
      int mid = (from + to) / 2;
      if(x <= mid)
        update(node * 2, from, mid, x, val);
      else
        update(node * 2 + 1, mid + 1, to, x, val);
    }
  }

  ll query(int node, int from, int to, int k){
    if(aint[node].first < k)
      return -inf;
    if(from < to){
      int mid = (from + to) / 2;
      if(k <= aint[node * 2 + 1].first)
        return query(node * 2 + 1, mid + 1, to, k);
      else
        return query(node * 2, from, mid , k - aint[node * 2 + 1].first) + aint[node * 2 + 1].second;
    } else
      return 1LL * decode[from] * k;
  }

  int _size(){
    return aint[1].first;
  }
};

int n, k;
ll result = -inf;

void _insert(SegmentTree &aint, int val){
  aint.update(1, 1, n, val, {1, decode[val]});
}
void _erase(SegmentTree &aint, int val){
  aint.update(1, 1, n, val, {-1, -decode[val]});
}

ll dp[1 + nmax], sol[1 + nmax];

ll extract(int start, int stop, SegmentTree &aint){
  return aint.query(1, 1, n, k) - (v[stop].first - v[start].first) * 2;
}

void eval(int pos, int x, int y, SegmentTree &aint){
  dp[pos] = -inf;
  sol[pos] = n;

  x = max(pos, x);
  for(int i = x; i <= y; i++){
    _insert(aint, v[i].second);
    ll result = extract(pos, i, aint);
    if(dp[pos] < result){
      dp[pos] = result;
      sol[pos] = i;
    }
  }

  for(int i = x; i <= y; i++)
    _erase(aint, v[i].second);
}

void divide(int from, int to, int x, int y, SegmentTree &aint){
  if(to < from)
    return ;
  int mid = (from + to) / 2;

  for(int i = mid; i <= min(x - 1, to); i++)
    _insert(aint, v[i].second);
  eval(mid, x, y, aint);
  divide(from, mid - 1, x, sol[mid], aint);
  for(int i = mid; i <= min(to, x - 1); i++)
    _erase(aint, v[i].second);

  for(int i = max(to + 1, x); i < sol[mid]; i++)
    _insert(aint, v[i].second);
  divide(mid + 1, to, sol[mid], y, aint);
  for(int i = max(to + 1, x); i < sol[mid]; i++)
    _erase(aint, v[i].second);
}

int main()
{
  ios::sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> k;
  for(int i = 1;i <= n; i++) {
    cin >> v[i].second >> v[i].first;
  }

  sort(v + 1, v + n + 1);
  normalize(n);
  SegmentTree aint(n);
  divide(1, n, 1, n, aint);
  ll result = -inf;
  for(int i = 1;i <= n; i++)
    result = max(result, dp[i]);
  cout << result;
  return 0;
}

Compilation message

cake3.cpp: In function 'void normalize(int)':
cake3.cpp:29:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < temp.size(); i++) {
                  ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 12 ms 640 KB Output is correct
39 Correct 13 ms 640 KB Output is correct
40 Correct 12 ms 640 KB Output is correct
41 Correct 12 ms 640 KB Output is correct
42 Correct 12 ms 640 KB Output is correct
43 Correct 12 ms 640 KB Output is correct
44 Correct 12 ms 640 KB Output is correct
45 Correct 12 ms 640 KB Output is correct
46 Correct 12 ms 640 KB Output is correct
47 Correct 12 ms 640 KB Output is correct
48 Correct 12 ms 640 KB Output is correct
49 Correct 12 ms 640 KB Output is correct
50 Correct 12 ms 640 KB Output is correct
51 Correct 12 ms 640 KB Output is correct
52 Correct 12 ms 640 KB Output is correct
53 Correct 12 ms 640 KB Output is correct
54 Correct 12 ms 640 KB Output is correct
55 Correct 13 ms 564 KB Output is correct
56 Correct 12 ms 640 KB Output is correct
57 Correct 12 ms 640 KB Output is correct
58 Correct 12 ms 640 KB Output is correct
59 Correct 7 ms 512 KB Output is correct
60 Correct 8 ms 512 KB Output is correct
61 Correct 7 ms 512 KB Output is correct
62 Correct 8 ms 512 KB Output is correct
63 Correct 8 ms 512 KB Output is correct
64 Correct 8 ms 512 KB Output is correct
65 Correct 11 ms 640 KB Output is correct
66 Correct 11 ms 640 KB Output is correct
67 Correct 11 ms 640 KB Output is correct
68 Correct 11 ms 640 KB Output is correct
69 Correct 11 ms 640 KB Output is correct
70 Correct 11 ms 768 KB Output is correct
71 Correct 8 ms 512 KB Output is correct
72 Correct 9 ms 512 KB Output is correct
73 Correct 11 ms 640 KB Output is correct
74 Correct 12 ms 640 KB Output is correct
75 Correct 2734 ms 24856 KB Output is correct
76 Correct 2633 ms 24180 KB Output is correct
77 Correct 2739 ms 24892 KB Output is correct
78 Correct 2683 ms 25172 KB Output is correct
79 Correct 2546 ms 29112 KB Output is correct
80 Correct 2463 ms 28252 KB Output is correct
81 Correct 1671 ms 21116 KB Output is correct
82 Correct 1772 ms 21884 KB Output is correct
83 Correct 1775 ms 21980 KB Output is correct
84 Correct 1770 ms 22004 KB Output is correct
85 Correct 1682 ms 21400 KB Output is correct
86 Correct 1596 ms 19856 KB Output is correct
87 Correct 1546 ms 19736 KB Output is correct
88 Correct 1575 ms 20256 KB Output is correct
89 Correct 1662 ms 20856 KB Output is correct
90 Correct 1686 ms 21464 KB Output is correct
91 Correct 1570 ms 19908 KB Output is correct
92 Correct 1548 ms 19620 KB Output is correct
93 Correct 1596 ms 20564 KB Output is correct
94 Correct 1707 ms 20852 KB Output is correct
95 Correct 1687 ms 21432 KB Output is correct
96 Correct 884 ms 19216 KB Output is correct
97 Correct 1128 ms 20692 KB Output is correct
98 Correct 1056 ms 20320 KB Output is correct
99 Correct 933 ms 20488 KB Output is correct
100 Correct 888 ms 19360 KB Output is correct
101 Correct 853 ms 19208 KB Output is correct
102 Correct 1052 ms 19320 KB Output is correct
103 Correct 1072 ms 18964 KB Output is correct
104 Correct 1122 ms 20076 KB Output is correct
105 Correct 1131 ms 19956 KB Output is correct
106 Correct 1128 ms 20444 KB Output is correct
107 Correct 1091 ms 19824 KB Output is correct
108 Correct 2681 ms 28632 KB Output is correct
109 Correct 2836 ms 30052 KB Output is correct
110 Correct 929 ms 18820 KB Output is correct
111 Correct 940 ms 19068 KB Output is correct
112 Correct 1233 ms 26064 KB Output is correct
113 Correct 2697 ms 30312 KB Output is correct