oj.uz

답안 #200862

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200862 2020-02-08T10:28:41 Z EntityIT Cake 3 (JOI19_cake3) C++14
100 / 100
 709 ms 10476 KB 
#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) ( (int)(x).size() )
using LL = long long;

template<class T>
inline bool asMn(T &a, const T &b) { return a > b ? a = b, true : false; }
template<class T>
inline bool asMx(T &a, const T &b) { return a < b ? a = b, true : false; }

const LL infLL = 1e18;
mt19937 rng( (uint32_t)chrono::steady_clock::now().time_since_epoch().count() );

template<class T>
struct Bit {
  vector<T> a;
  Bit(int nNode = 0) { a.assign(nNode, T() ); }
  void reset(int nNode = 0) { a.assign(nNode, T() ); }

  void upd(int pos, int val) {
    for (int i = pos; i < sz(a); i |= i + 1) a[i] += val;
  }
  T get(int pos) {
    T ret = 0;
    for (int i = pos; i >= 0; i = (i & (i + 1) ) - 1) ret += a[i];
    return ret;
  }
  int findPos(int val) {
    int ret = 0;
    for (int i = __lg(sz(a) ); i >= 0; --i) {
      ret ^= 1 << i;
      if (ret < sz(a) && a[ret - 1] <= val) val -= a[ret - 1];
      else ret ^= 1 << i;
    }
    return ret;
  }
};
Bit<int> cnt;
Bit<LL> sum;

int n, m;
vector<pair<int, int> > piece;
vector<int> lable;

int l = 1, r = 0;
LL get(int Left, int Right) {
  while (r < Right) cnt.upd(lable[++r], 1), sum.upd(lable[r], piece[r].second);
  while (l > Left) cnt.upd(lable[--l], 1), sum.upd(lable[l], piece[l].second);
  while (r > Right) cnt.upd(lable[r], -1), sum.upd(lable[r], -piece[r].second), --r;
  while (l < Left) cnt.upd(lable[l], -1), sum.upd(lable[l], -piece[l].second), ++l;

  return sum.get(cnt.findPos(m - 1) );
}

LL ans = -infLL;
void solve(int Left, int Right, int bestL, int bestR) {
  int Mid = (Left + Right) >> 1;

  LL ret = -infLL;
  int bestM = bestL;
  for (int i = bestL; i <= min(bestR, Mid - m - 1); ++i) {
    LL tmp = get(i + 1, Mid - 1) + piece[i].second + piece[Mid].second - ( (piece[Mid].first - piece[i].first) << 1);
    if (tmp > ret) {
      ret = tmp;
      bestM = i;
    }
  }
  asMx(ans, ret);

  if (Left < Mid) solve(Left, Mid - 1, bestL, bestM);
  if (Mid < Right) solve(Mid + 1, Right, bestM, bestR);
}

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

  #ifdef FourLeafClover
  freopen("input", "r", stdin);
  #endif // FourLeafCLover

  cin >> n >> m; m -= 2;

  piece.assign(n, {} );
  for (int i = 0; i < n; ++i) cin >> piece[i].second >> piece[i].first;
  sort(all(piece) );

  vector<pair<int, int> > com;
  for (int i = 0; i < n; ++i) com.emplace_back(piece[i].second, i);
  sort(all(com) );
  lable.assign(n, 0);
  for (int i = 0; i < n; ++i) lable[i] = n - 1 - (int)(lower_bound(all(com), make_pair(piece[i].second, i) ) - com.begin() );

  cnt.reset(n);
  sum.reset(n);
  solve(0, n - 1, 0, n - 1);

  cout << ans << '\n';

  return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 372 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 504 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 380 KB Output is correct
35 Correct 6 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 8 ms 376 KB Output is correct
39 Correct 8 ms 504 KB Output is correct
40 Correct 7 ms 376 KB Output is correct
41 Correct 7 ms 504 KB Output is correct
42 Correct 6 ms 376 KB Output is correct
43 Correct 7 ms 376 KB Output is correct
44 Correct 7 ms 504 KB Output is correct
45 Correct 7 ms 376 KB Output is correct
46 Correct 9 ms 504 KB Output is correct
47 Correct 8 ms 376 KB Output is correct
48 Correct 7 ms 376 KB Output is correct
49 Correct 7 ms 376 KB Output is correct
50 Correct 7 ms 376 KB Output is correct
51 Correct 7 ms 376 KB Output is correct
52 Correct 7 ms 376 KB Output is correct
53 Correct 7 ms 376 KB Output is correct
54 Correct 6 ms 376 KB Output is correct
55 Correct 6 ms 376 KB Output is correct
56 Correct 7 ms 376 KB Output is correct
57 Correct 6 ms 376 KB Output is correct
58 Correct 6 ms 376 KB Output is correct
59 Correct 6 ms 376 KB Output is correct
60 Correct 7 ms 376 KB Output is correct
61 Correct 7 ms 504 KB Output is correct
62 Correct 6 ms 380 KB Output is correct
63 Correct 7 ms 376 KB Output is correct
64 Correct 6 ms 508 KB Output is correct
65 Correct 8 ms 376 KB Output is correct
66 Correct 7 ms 380 KB Output is correct
67 Correct 8 ms 504 KB Output is correct
68 Correct 8 ms 380 KB Output is correct
69 Correct 7 ms 376 KB Output is correct
70 Correct 7 ms 504 KB Output is correct
71 Correct 7 ms 376 KB Output is correct
72 Correct 7 ms 376 KB Output is correct
73 Correct 6 ms 504 KB Output is correct
74 Correct 6 ms 504 KB Output is correct
75 Correct 535 ms 9964 KB Output is correct
76 Correct 582 ms 9580 KB Output is correct
77 Correct 461 ms 9836 KB Output is correct
78 Correct 500 ms 9964 KB Output is correct
79 Correct 139 ms 10096 KB Output is correct
80 Correct 175 ms 9708 KB Output is correct
81 Correct 500 ms 9068 KB Output is correct
82 Correct 709 ms 9324 KB Output is correct
83 Correct 587 ms 9580 KB Output is correct
84 Correct 608 ms 9452 KB Output is correct
85 Correct 525 ms 9192 KB Output is correct
86 Correct 294 ms 8812 KB Output is correct
87 Correct 317 ms 8812 KB Output is correct
88 Correct 458 ms 8684 KB Output is correct
89 Correct 441 ms 9196 KB Output is correct
90 Correct 322 ms 9580 KB Output is correct
91 Correct 238 ms 8940 KB Output is correct
92 Correct 230 ms 8812 KB Output is correct
93 Correct 273 ms 9324 KB Output is correct
94 Correct 213 ms 9452 KB Output is correct
95 Correct 304 ms 9580 KB Output is correct
96 Correct 326 ms 8812 KB Output is correct
97 Correct 345 ms 9580 KB Output is correct
98 Correct 356 ms 9452 KB Output is correct
99 Correct 323 ms 9452 KB Output is correct
100 Correct 260 ms 8940 KB Output is correct
101 Correct 256 ms 8944 KB Output is correct
102 Correct 507 ms 8940 KB Output is correct
103 Correct 489 ms 8808 KB Output is correct
104 Correct 545 ms 9376 KB Output is correct
105 Correct 429 ms 9196 KB Output is correct
106 Correct 482 ms 9452 KB Output is correct
107 Correct 380 ms 9196 KB Output is correct
108 Correct 451 ms 9708 KB Output is correct
109 Correct 375 ms 10348 KB Output is correct
110 Correct 244 ms 8424 KB Output is correct
111 Correct 333 ms 8556 KB Output is correct
112 Correct 242 ms 8044 KB Output is correct
113 Correct 153 ms 10476 KB Output is correct