oj.uz

답안 #542201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542201 2022-03-25T16:23:48 Z Alex_tz307 Colouring a rectangle (eJOI19_colouring) C++17
100 / 100
 508 ms 23796 KB 
#include <bits/stdc++.h>

using namespace std;

const int kN = 2e5;
const int64_t INF = 2e18L;
int a[2 * kN], v[1 + kN];
tuple<int, int, int> intervals[2 * kN];
vector<pair<int, int>> rEnd[1 + kN];

void minSelf(int64_t &x, int64_t y) {
  if (y < x) {
    x = y;
  }
}

struct ST {
  int n;
  vector<int64_t> t, lazy;

  ST(int N) : n(N) {
    int dim = 1;
    while (dim < n + 1) {
      dim *= 2;
    }
    dim *= 2;
    t.resize(dim);
    lazy.resize(dim);
  }

  void push(int x) {
    if (lazy[x] == 0) {
      return;
    }
    for (int y = 2 * x; y <= 2 * x + 1; ++y) {
      t[y] += lazy[x];
      lazy[y] += lazy[x];
    }
    lazy[x] = 0;
  }

  void rangeAdd(int x, int lx, int rx, int st, int dr, int64_t v) {
    if (st <= lx && rx <= dr) {
      t[x] += v;
      lazy[x] += v;
      return;
    }
    push(x);
    int mid = (lx + rx) / 2;
    if (st <= mid) {
      rangeAdd(x * 2, lx, mid, st, dr, v);
    }
    if (mid < dr) {
      rangeAdd(x * 2 + 1, mid + 1, rx, st, dr, v);
    }
    t[x] = min(t[x * 2], t[x * 2 + 1]);
  }

  void rangeAdd(int st, int dr, int64_t v) {
    rangeAdd(1, 0, n, st, dr, v);
  }

  int64_t query(int x, int lx, int rx, int st, int dr) {
    if (st <= lx && rx <= dr) {
      return t[x];
    }
    push(x);
    int mid = (lx + rx) / 2;
    int64_t ans = INF;
    if (st <= mid) {
      minSelf(ans, query(x * 2, lx, mid, st, dr));
    }
    if (mid < dr) {
      minSelf(ans, query(x * 2 + 1, mid + 1, rx, st, dr));
    }
    return ans;
  }

  int64_t query(int st, int dr) {
    return query(1, 0, n, st, dr);
  }
};

int64_t solve(int n) {
  ST t(n);
  for (int i = 1; i <= n; ++i) {
    t.rangeAdd(i, i, t.query(0, i - 1));
    t.rangeAdd(0, i - 1, v[i]);
    for (auto it : rEnd[i]) {
      int start, cost;
      tie(start, cost) = it;
      t.rangeAdd(start, i, cost);
    }
  }
  return t.t[1];
}

void testCase() {
  int n, m;
  cin >> n >> m;
  int N = n + m - 1;
  for (int i = 1; i <= N; ++i) {
    cin >> a[i];
  }
  int cost;
  for (int i = 1; i <= N; ++i) {
    cin >> cost;
    int y = min(i - 1, m - 1);
    int x = i - 1 - y;
    int index = x - y + m;
    int len = min(y + 1, n - x);
    intervals[i] = {index, len, cost};
  }
  int64_t ans = 0;
  for (int par = 0; par <= 1; ++par) {
    int p = get<0>(intervals[2 - par]) % 2;
    int M = (N + p) / 2;
    for (int i = 2 - p; i <= N; i += 2) {
      v[(i + p) / 2] = a[i];
    }
    for (int i = 1; i <= M; ++i) {
      rEnd[i].clear();
    }
    for (int i = 2 - par; i <= N; i += 2) {
      int index, len, cost;
      tie(index, len, cost) = intervals[i];
      index = (index + 1) / 2;
      rEnd[index + len - 1].emplace_back(index, cost);
    }
    ans += solve(M);
  }
  cout << ans << '\n';
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4960 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4936 KB Output is correct
14 Correct 3 ms 5032 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4960 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4936 KB Output is correct
14 Correct 3 ms 5032 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5028 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 5028 KB Output is correct
24 Correct 3 ms 5152 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 5024 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4960 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4936 KB Output is correct
14 Correct 3 ms 5032 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5028 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 5028 KB Output is correct
24 Correct 3 ms 5152 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 5024 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 8 ms 5168 KB Output is correct
31 Correct 6 ms 5284 KB Output is correct
32 Correct 7 ms 5252 KB Output is correct
33 Correct 6 ms 5168 KB Output is correct
34 Correct 7 ms 5164 KB Output is correct
35 Correct 5 ms 5076 KB Output is correct
36 Correct 4 ms 5076 KB Output is correct
37 Correct 4 ms 5172 KB Output is correct
38 Correct 4 ms 5076 KB Output is correct
39 Correct 4 ms 5076 KB Output is correct
40 Correct 5 ms 5076 KB Output is correct
41 Correct 4 ms 5216 KB Output is correct
42 Correct 4 ms 5204 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 16048 KB Output is correct
2 Correct 183 ms 16036 KB Output is correct
3 Correct 164 ms 16048 KB Output is correct
4 Correct 160 ms 16036 KB Output is correct
5 Correct 170 ms 15988 KB Output is correct
6 Correct 215 ms 16048 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 428 ms 23700 KB Output is correct
2 Correct 508 ms 23660 KB Output is correct
3 Correct 409 ms 23664 KB Output is correct
4 Correct 502 ms 23752 KB Output is correct
5 Correct 413 ms 23672 KB Output is correct
6 Correct 470 ms 23712 KB Output is correct
7 Correct 422 ms 23796 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4960 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4936 KB Output is correct
14 Correct 3 ms 5032 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5028 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 5028 KB Output is correct
24 Correct 3 ms 5152 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 5024 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 8 ms 5168 KB Output is correct
31 Correct 6 ms 5284 KB Output is correct
32 Correct 7 ms 5252 KB Output is correct
33 Correct 6 ms 5168 KB Output is correct
34 Correct 7 ms 5164 KB Output is correct
35 Correct 5 ms 5076 KB Output is correct
36 Correct 4 ms 5076 KB Output is correct
37 Correct 4 ms 5172 KB Output is correct
38 Correct 4 ms 5076 KB Output is correct
39 Correct 4 ms 5076 KB Output is correct
40 Correct 5 ms 5076 KB Output is correct
41 Correct 4 ms 5216 KB Output is correct
42 Correct 4 ms 5204 KB Output is correct
43 Correct 162 ms 16048 KB Output is correct
44 Correct 183 ms 16036 KB Output is correct
45 Correct 164 ms 16048 KB Output is correct
46 Correct 160 ms 16036 KB Output is correct
47 Correct 170 ms 15988 KB Output is correct
48 Correct 215 ms 16048 KB Output is correct
49 Correct 428 ms 23700 KB Output is correct
50 Correct 508 ms 23660 KB Output is correct
51 Correct 409 ms 23664 KB Output is correct
52 Correct 502 ms 23752 KB Output is correct
53 Correct 413 ms 23672 KB Output is correct
54 Correct 470 ms 23712 KB Output is correct
55 Correct 422 ms 23796 KB Output is correct
56 Correct 181 ms 16024 KB Output is correct
57 Correct 177 ms 15944 KB Output is correct
58 Correct 175 ms 15992 KB Output is correct
59 Correct 162 ms 16036 KB Output is correct
60 Correct 199 ms 15996 KB Output is correct
61 Correct 186 ms 16040 KB Output is correct
62 Correct 180 ms 16172 KB Output is correct
63 Correct 179 ms 15952 KB Output is correct
64 Correct 205 ms 16092 KB Output is correct
65 Correct 209 ms 16356 KB Output is correct
66 Correct 244 ms 16664 KB Output is correct
67 Correct 309 ms 17212 KB Output is correct
68 Correct 426 ms 23756 KB Output is correct
69 Correct 445 ms 23780 KB Output is correct
70 Correct 345 ms 21912 KB Output is correct