oj.uz

답안 #807530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807530 2023-08-04T19:02:23 Z dong_liu 서열 (APIO23_sequence) C++17
100 / 100
 1792 ms 72764 KB 
#pragma GCC optimize("Ofast")
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <iostream>
#include <random>
#include <vector>
using namespace std;

typedef vector<int> vi;

const int N = 5e5, N_ = 1 << 19;

namespace D1 {

struct node {
  int minL, minR, maxL, maxR, sum;
};

node operator+(const node &u, const node &v) {
  return {min(u.minL, u.sum + v.minL), min(v.minR, v.sum + u.minR),
          max(u.maxL, u.sum + v.maxL), max(v.maxR, v.sum + u.maxR),
          u.sum + v.sum};
}

const node id = {0, 0, 0, 0, 0};

node st[N_ * 2];
int n_;

void activate(int i) {
  st[i += n_] = {-1, -1, 0, 0, -1};
  while (i /= 2) st[i] = st[i * 2] + st[i * 2 + 1];
}
node qry(int l, int r) {
  node u = id, v = id;
  for (l += n_, r += n_; l <= r; l /= 2, r /= 2) {
    if (l & 1) u = u + st[l++];
    if (~r & 1) v = st[r--] + v;
  }
  return u + v;
}
}  // namespace D1

const int M_ = 1 << 20, offset = N_, INF = 1e8;

int mx[M_ * 2];
vi reset;

void upd(int i, int x) {
  reset.push_back(i);
  i += offset;
  i += M_;
  while (i) mx[i] = max(mx[i], x), i /= 2;
}
int qry(int l, int r) {
  l += offset;
  r += offset;
  int x = -INF;
  for (l += M_, r += M_; l <= r; l /= 2, r /= 2) {
    if (l & 1) x = max(x, mx[l++]);
    if (~r & 1) x = max(x, mx[r--]);
  }
  return x;
}
void clr() {
  for (int i : reset) {
    i += offset;
    i += M_;
    while (i) mx[i] = -INF, i /= 2;
  }
  vi().swap(reset);
}

int minL[N], maxL[N], minR[N], maxR[N], sumL[N], sumR[N], ans;

void dnc(int l, int r) {
  if (l < r) {
    int m = (l + r) / 2;
    dnc(l, m);
    dnc(m + 1, r);
    int sum = 0;
    vector<array<int, 3>> left, right;
    for (int i = m; i >= l; i--) {
      if (i < m) sum += sumR[i];
      int v = maxL[i] + sum + (m - i + 1);
      int u = minL[i] + sum - (m - i + 1) + 1;
      v *= -1;
      left.push_back({v, u, (m - i + 1)});
    }
    sum = 0;
    for (int i = m + 1; i <= r; i++) {
      sum += sumL[i];
      int v = maxR[i] + sum + (i - m);
      int u = minR[i] + sum - (i - m);
      u *= -1;
      right.push_back({v, u, i - m});
    }
    sort(left.begin(), left.end());
    sort(right.begin(), right.end());
    int p = 0;
    for (auto [u, v, k] : right) {
      while (p < int(left.size()) && left[p][0] <= u) {
        upd(left[p][1], left[p][2]);
        p++;
      }
      ans = max(ans, k + qry(-offset, v));
    }
    clr();
  }
}

void solve(int n, vi a) {
  vector<vi> ii(n);
  for (int i = 0; i < n; i++) ii[a[i]].push_back(i);
  D1::n_ = 1;
  while (D1::n_ < n) D1::n_ *= 2;
  for (int i = 0; i < n; i++) D1::st[D1::n_ + i] = {0, 0, 1, 1, 1};
  for (int i = D1::n_ - 1; i > 0; i--)
    D1::st[i] = D1::st[i * 2] + D1::st[i * 2 + 1];
  for (int x = 0; x < n; x++) {
    if (ii[x].empty()) continue;
    int m = ii[x].size();
    for (int p = 0; p < m; p++) {
      D1::node u = D1::qry(p == 0 ? 0 : ii[x][p - 1] + 1, ii[x][p] - 1);
      D1::node v = D1::qry(ii[x][p] + 1, p == m - 1 ? n - 1 : ii[x][p + 1] - 1);
      sumL[p] = u.sum;
      sumR[p] = v.sum;
      minL[p] = u.minR;
      maxL[p] = u.maxR;
      minR[p] = v.minL;
      maxR[p] = v.maxL;
    }
    dnc(0, m - 1);
    for (int i : ii[x]) {
      D1::activate(i);
    }
  }
}

int sequence(int n, vi a) {
  for (int i = 0; i < M_ * 2; i++) mx[i] = -INF;
  for (int i = 0; i < n; i++) a[i]--;
  ans = 1;
  solve(n, a);
  for (int i = 0; i < n; i++) a[i] = n - a[i] - 1;
  solve(n, a);
  return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 3 ms 8532 KB Output is correct
3 Correct 3 ms 8532 KB Output is correct
4 Correct 3 ms 8532 KB Output is correct
5 Correct 4 ms 8532 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 3 ms 8532 KB Output is correct
8 Correct 3 ms 8532 KB Output is correct
9 Correct 4 ms 8532 KB Output is correct
10 Correct 3 ms 8532 KB Output is correct
11 Correct 3 ms 8532 KB Output is correct
12 Correct 3 ms 8532 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 3 ms 8532 KB Output is correct
3 Correct 3 ms 8532 KB Output is correct
4 Correct 3 ms 8532 KB Output is correct
5 Correct 4 ms 8532 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 3 ms 8532 KB Output is correct
8 Correct 3 ms 8532 KB Output is correct
9 Correct 4 ms 8532 KB Output is correct
10 Correct 3 ms 8532 KB Output is correct
11 Correct 3 ms 8532 KB Output is correct
12 Correct 3 ms 8532 KB Output is correct
13 Correct 7 ms 8660 KB Output is correct
14 Correct 5 ms 8660 KB Output is correct
15 Correct 6 ms 8732 KB Output is correct
16 Correct 7 ms 8732 KB Output is correct
17 Correct 9 ms 8748 KB Output is correct
18 Correct 5 ms 8660 KB Output is correct
19 Correct 5 ms 8660 KB Output is correct
20 Correct 5 ms 8660 KB Output is correct
21 Correct 5 ms 8660 KB Output is correct
22 Correct 5 ms 8660 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 497 ms 56068 KB Output is correct
3 Correct 560 ms 56156 KB Output is correct
4 Correct 1523 ms 52768 KB Output is correct
5 Correct 559 ms 55196 KB Output is correct
6 Correct 494 ms 55196 KB Output is correct
7 Correct 1198 ms 49164 KB Output is correct
8 Correct 1175 ms 49204 KB Output is correct
9 Correct 1574 ms 56428 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 1777 ms 62332 KB Output is correct
3 Correct 1656 ms 56264 KB Output is correct
4 Correct 1666 ms 56240 KB Output is correct
5 Correct 1792 ms 62444 KB Output is correct
6 Correct 1611 ms 60152 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 720 ms 61864 KB Output is correct
2 Correct 674 ms 61856 KB Output is correct
3 Correct 703 ms 61408 KB Output is correct
4 Correct 698 ms 61292 KB Output is correct
5 Correct 632 ms 57952 KB Output is correct
6 Correct 611 ms 57932 KB Output is correct
7 Correct 561 ms 56776 KB Output is correct
8 Correct 540 ms 56460 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 3 ms 8532 KB Output is correct
3 Correct 3 ms 8532 KB Output is correct
4 Correct 3 ms 8532 KB Output is correct
5 Correct 4 ms 8532 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 3 ms 8532 KB Output is correct
8 Correct 3 ms 8532 KB Output is correct
9 Correct 4 ms 8532 KB Output is correct
10 Correct 3 ms 8532 KB Output is correct
11 Correct 3 ms 8532 KB Output is correct
12 Correct 3 ms 8532 KB Output is correct
13 Correct 7 ms 8660 KB Output is correct
14 Correct 5 ms 8660 KB Output is correct
15 Correct 6 ms 8732 KB Output is correct
16 Correct 7 ms 8732 KB Output is correct
17 Correct 9 ms 8748 KB Output is correct
18 Correct 5 ms 8660 KB Output is correct
19 Correct 5 ms 8660 KB Output is correct
20 Correct 5 ms 8660 KB Output is correct
21 Correct 5 ms 8660 KB Output is correct
22 Correct 5 ms 8660 KB Output is correct
23 Correct 100 ms 17108 KB Output is correct
24 Correct 102 ms 17100 KB Output is correct
25 Correct 118 ms 17124 KB Output is correct
26 Correct 182 ms 16212 KB Output is correct
27 Correct 163 ms 16212 KB Output is correct
28 Correct 162 ms 16200 KB Output is correct
29 Correct 212 ms 16460 KB Output is correct
30 Correct 211 ms 16524 KB Output is correct
31 Correct 240 ms 19480 KB Output is correct
32 Correct 75 ms 18004 KB Output is correct
33 Correct 144 ms 17388 KB Output is correct
34 Correct 121 ms 17336 KB Output is correct
35 Correct 153 ms 17364 KB Output is correct
36 Correct 122 ms 17384 KB Output is correct
37 Correct 119 ms 17348 KB Output is correct
38 Correct 124 ms 17424 KB Output is correct

Subtask #7
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 3 ms 8532 KB Output is correct
3 Correct 3 ms 8532 KB Output is correct
4 Correct 3 ms 8532 KB Output is correct
5 Correct 4 ms 8532 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 3 ms 8532 KB Output is correct
8 Correct 3 ms 8532 KB Output is correct
9 Correct 4 ms 8532 KB Output is correct
10 Correct 3 ms 8532 KB Output is correct
11 Correct 3 ms 8532 KB Output is correct
12 Correct 3 ms 8532 KB Output is correct
13 Correct 7 ms 8660 KB Output is correct
14 Correct 5 ms 8660 KB Output is correct
15 Correct 6 ms 8732 KB Output is correct
16 Correct 7 ms 8732 KB Output is correct
17 Correct 9 ms 8748 KB Output is correct
18 Correct 5 ms 8660 KB Output is correct
19 Correct 5 ms 8660 KB Output is correct
20 Correct 5 ms 8660 KB Output is correct
21 Correct 5 ms 8660 KB Output is correct
22 Correct 5 ms 8660 KB Output is correct
23 Correct 497 ms 56068 KB Output is correct
24 Correct 560 ms 56156 KB Output is correct
25 Correct 1523 ms 52768 KB Output is correct
26 Correct 559 ms 55196 KB Output is correct
27 Correct 494 ms 55196 KB Output is correct
28 Correct 1198 ms 49164 KB Output is correct
29 Correct 1175 ms 49204 KB Output is correct
30 Correct 1574 ms 56428 KB Output is correct
31 Correct 1777 ms 62332 KB Output is correct
32 Correct 1656 ms 56264 KB Output is correct
33 Correct 1666 ms 56240 KB Output is correct
34 Correct 1792 ms 62444 KB Output is correct
35 Correct 1611 ms 60152 KB Output is correct
36 Correct 720 ms 61864 KB Output is correct
37 Correct 674 ms 61856 KB Output is correct
38 Correct 703 ms 61408 KB Output is correct
39 Correct 698 ms 61292 KB Output is correct
40 Correct 632 ms 57952 KB Output is correct
41 Correct 611 ms 57932 KB Output is correct
42 Correct 561 ms 56776 KB Output is correct
43 Correct 540 ms 56460 KB Output is correct
44 Correct 100 ms 17108 KB Output is correct
45 Correct 102 ms 17100 KB Output is correct
46 Correct 118 ms 17124 KB Output is correct
47 Correct 182 ms 16212 KB Output is correct
48 Correct 163 ms 16212 KB Output is correct
49 Correct 162 ms 16200 KB Output is correct
50 Correct 212 ms 16460 KB Output is correct
51 Correct 211 ms 16524 KB Output is correct
52 Correct 240 ms 19480 KB Output is correct
53 Correct 75 ms 18004 KB Output is correct
54 Correct 144 ms 17388 KB Output is correct
55 Correct 121 ms 17336 KB Output is correct
56 Correct 153 ms 17364 KB Output is correct
57 Correct 122 ms 17384 KB Output is correct
58 Correct 119 ms 17348 KB Output is correct
59 Correct 124 ms 17424 KB Output is correct
60 Correct 1033 ms 59456 KB Output is correct
61 Correct 989 ms 59448 KB Output is correct
62 Correct 1031 ms 59464 KB Output is correct
63 Correct 1311 ms 51452 KB Output is correct
64 Correct 1294 ms 51356 KB Output is correct
65 Correct 1300 ms 51332 KB Output is correct
66 Correct 1582 ms 53980 KB Output is correct
67 Correct 1591 ms 54016 KB Output is correct
68 Correct 1734 ms 72764 KB Output is correct
69 Correct 483 ms 65196 KB Output is correct
70 Correct 1124 ms 60932 KB Output is correct
71 Correct 1063 ms 61548 KB Output is correct
72 Correct 1135 ms 61428 KB Output is correct
73 Correct 1125 ms 61440 KB Output is correct
74 Correct 1070 ms 61780 KB Output is correct
75 Correct 1063 ms 61496 KB Output is correct