oj.uz

Submission #889526

# Submission time Handle Problem Language Result Execution time Memory
889526 2023-12-19T23:26:49 Z MilosMilutinovic Monochrome Points (JOI20_monochrome) C++14
35 / 100
 2000 ms 47156 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  string s;
  cin >> s;
  string t = "";
  for (int i = 0; i < 2 * n; i++) {
    if (s[i] == 'B') {
      for (int j = 0; j < 2 * n; j++) {
        t += s[(i + j) % (2 * n)];
      }
      break;
    }
  }
  s = t;
  vector<int> a;
  vector<int> b;
  for (int i = 0; i < 2 * n; i++) {
    if (s[i] == 'B') {
      a.push_back(i);
    } else {
      b.push_back(i);
    }
  }
  vector<int> fenw(2 * n);
  auto Modify = [&](int x, int v) {
    while (x < 2 * n) {
      fenw[x] += v;
      x |= (x + 1);
    }
  }; 
  auto Query = [&](int x) {
    int v = 0;
    while (x >= 0) {
      v += fenw[x];
      x = ((x & (x + 1))) - 1;
    }
    return v;
  };
  auto GetSum = [&](int L, int R) {
    return Query(R) - Query(L - 1);
  };
  auto Solve = [&](int k) {
    vector<vector<array<int, 3>>> qs(2 * n + 1);
    vector<int> to(2 * n + 1, -1);
    for (int i = 0; i < n; i++) {
      int L = a[i];
      int R = b[(i + k) % n];
      to[L] = R;
      if (L <= R) {
        qs[L].push_back({0, L - 1, -1});
        qs[L].push_back({R + 1, 2 * n - 1, -1});
        qs[R].push_back({0, L - 1, +1});
        qs[R].push_back({R + 1, 2 * n - 1, +1});
        qs[L].push_back({L + 1, R - 1, +1});
        qs[R].push_back({L + 1, R - 1, -1});
        qs[2 * n].push_back({L + 1, R - 1, +1});
      } else {
        swap(L, R);
        qs[L].push_back({L + 1, R - 1, +1});
        qs[R].push_back({L + 1, R - 1, -1});
        qs[2 * n].push_back({L + 1, R - 1, +1});
        qs[L].push_back({0, L - 1, -1});
        qs[L].push_back({R + 1, 2 * n - 1, -1});
        qs[R].push_back({0, L - 1, +1});
        qs[R].push_back({R + 1, 2 * n - 1, +1});
      }
    }
    fenw = vector<int>(2 * n, 0);
    long long ret = 0;
    for (int i = 0; i <= 2 * n; i++) {
      for (auto& p : qs[i]) {
        if (p[0] <= p[1]) {
          ret += GetSum(p[0], p[1]) * p[2];
        }
      }
      if (to[i] != -1) {
        Modify(to[i], 1);
      }
    }
    return ret / 2;
  };
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    ans = max(ans, Solve(i)); 
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 500 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 500 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 29 ms 348 KB Output is correct
15 Correct 29 ms 348 KB Output is correct
16 Correct 29 ms 344 KB Output is correct
17 Correct 35 ms 684 KB Output is correct
18 Correct 21 ms 348 KB Output is correct
19 Correct 24 ms 348 KB Output is correct
20 Correct 23 ms 348 KB Output is correct
21 Correct 21 ms 348 KB Output is correct
22 Correct 23 ms 344 KB Output is correct
23 Correct 12 ms 504 KB Output is correct
24 Correct 21 ms 516 KB Output is correct
25 Correct 21 ms 348 KB Output is correct
26 Correct 26 ms 348 KB Output is correct
27 Correct 24 ms 600 KB Output is correct
28 Correct 26 ms 344 KB Output is correct
29 Correct 20 ms 348 KB Output is correct
30 Correct 21 ms 348 KB Output is correct
31 Correct 25 ms 348 KB Output is correct
32 Correct 25 ms 348 KB Output is correct
33 Correct 28 ms 344 KB Output is correct
34 Correct 1390 ms 1104 KB Output is correct
35 Correct 1318 ms 900 KB Output is correct
36 Correct 1296 ms 1124 KB Output is correct
37 Correct 1182 ms 1032 KB Output is correct
38 Correct 972 ms 864 KB Output is correct
39 Correct 1104 ms 1104 KB Output is correct
40 Correct 981 ms 856 KB Output is correct
41 Correct 912 ms 892 KB Output is correct
42 Correct 1287 ms 892 KB Output is correct
43 Correct 1192 ms 968 KB Output is correct
44 Correct 1114 ms 1100 KB Output is correct
45 Correct 1076 ms 880 KB Output is correct
46 Correct 1181 ms 896 KB Output is correct
47 Correct 1181 ms 1012 KB Output is correct
48 Correct 1154 ms 900 KB Output is correct
49 Correct 952 ms 860 KB Output is correct
50 Correct 1120 ms 1108 KB Output is correct
51 Correct 1089 ms 896 KB Output is correct
52 Correct 1238 ms 1104 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 500 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 29 ms 348 KB Output is correct
15 Correct 29 ms 348 KB Output is correct
16 Correct 29 ms 344 KB Output is correct
17 Correct 35 ms 684 KB Output is correct
18 Correct 21 ms 348 KB Output is correct
19 Correct 24 ms 348 KB Output is correct
20 Correct 23 ms 348 KB Output is correct
21 Correct 21 ms 348 KB Output is correct
22 Correct 23 ms 344 KB Output is correct
23 Correct 12 ms 504 KB Output is correct
24 Correct 21 ms 516 KB Output is correct
25 Correct 21 ms 348 KB Output is correct
26 Correct 26 ms 348 KB Output is correct
27 Correct 24 ms 600 KB Output is correct
28 Correct 26 ms 344 KB Output is correct
29 Correct 20 ms 348 KB Output is correct
30 Correct 21 ms 348 KB Output is correct
31 Correct 25 ms 348 KB Output is correct
32 Correct 25 ms 348 KB Output is correct
33 Correct 28 ms 344 KB Output is correct
34 Correct 1390 ms 1104 KB Output is correct
35 Correct 1318 ms 900 KB Output is correct
36 Correct 1296 ms 1124 KB Output is correct
37 Correct 1182 ms 1032 KB Output is correct
38 Correct 972 ms 864 KB Output is correct
39 Correct 1104 ms 1104 KB Output is correct
40 Correct 981 ms 856 KB Output is correct
41 Correct 912 ms 892 KB Output is correct
42 Correct 1287 ms 892 KB Output is correct
43 Correct 1192 ms 968 KB Output is correct
44 Correct 1114 ms 1100 KB Output is correct
45 Correct 1076 ms 880 KB Output is correct
46 Correct 1181 ms 896 KB Output is correct
47 Correct 1181 ms 1012 KB Output is correct
48 Correct 1154 ms 900 KB Output is correct
49 Correct 952 ms 860 KB Output is correct
50 Correct 1120 ms 1108 KB Output is correct
51 Correct 1089 ms 896 KB Output is correct
52 Correct 1238 ms 1104 KB Output is correct
53 Execution timed out 2102 ms 47156 KB Time limit exceeded
54 Halted 0 ms 0 KB -