oj.uz

Submission #298134

# Submission time Handle Problem Language Result Execution time Memory
298134 2020-09-12T12:29:17 Z eriksuenderhauf Monochrome Points (JOI20_monochrome) C++17
35 / 100
 2000 ms 3988 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
int a[2*N];
ll dp[N];

ll solve(int n, int i) {
  //if (dp[i] != 0)
  //  return dp[i];
  int ptr[2] = {i+n, i+n}, cnt[4] = {0, 0, 0, 0};
  // auto next = [&](int& j) {
  //   j = j+1 < 2*n ? j+1 : j+1-2*n;
  // };
  #define next(x) x = x+1 < 2*n ? x+1 : x+1-2*n
  ll val = 0;
  for (int j = i, c = a[i]; j < i+n; c = a[++j]) {
    while (ptr[c] != i && a[ptr[c]] == c)
      cnt[c+2]++, next(ptr[c]);
    next(ptr[c]);
    val += min(cnt[c+2], cnt[c^1]) + cnt[c]++;
  }
  return dp[i] = val;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int get(int l, int r) {
  return uniform_int_distribution<int>(l, r)(rng);
}

int ord[N];

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  auto cur_t = clock();
  int n; cin >> n;
  string s; cin >> s;
  for (int i = 0; i < 2*n; i++)
    a[i] = s[i] == 'B', ord[i] = i;
  shuffle(ord, ord+n, rng);
  ll ans = 0;
  int i = 0;
  while (clock() - cur_t < 1980000 && i < n)
    ans = max(ans, solve(n, ord[i++]));
  cout << ans << "\n";
}

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 288 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 66 ms 384 KB Output is correct
35 Correct 64 ms 384 KB Output is correct
36 Correct 62 ms 504 KB Output is correct
37 Correct 57 ms 448 KB Output is correct
38 Correct 22 ms 384 KB Output is correct
39 Correct 25 ms 464 KB Output is correct
40 Correct 26 ms 504 KB Output is correct
41 Correct 27 ms 384 KB Output is correct
42 Correct 53 ms 384 KB Output is correct
43 Correct 24 ms 384 KB Output is correct
44 Correct 25 ms 384 KB Output is correct
45 Correct 30 ms 384 KB Output is correct
46 Correct 32 ms 384 KB Output is correct
47 Correct 33 ms 504 KB Output is correct
48 Correct 27 ms 384 KB Output is correct
49 Correct 27 ms 384 KB Output is correct
50 Correct 23 ms 384 KB Output is correct
51 Correct 23 ms 384 KB Output is correct
52 Correct 22 ms 384 KB Output is correct

Subtask #4
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 288 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 66 ms 384 KB Output is correct
35 Correct 64 ms 384 KB Output is correct
36 Correct 62 ms 504 KB Output is correct
37 Correct 57 ms 448 KB Output is correct
38 Correct 22 ms 384 KB Output is correct
39 Correct 25 ms 464 KB Output is correct
40 Correct 26 ms 504 KB Output is correct
41 Correct 27 ms 384 KB Output is correct
42 Correct 53 ms 384 KB Output is correct
43 Correct 24 ms 384 KB Output is correct
44 Correct 25 ms 384 KB Output is correct
45 Correct 30 ms 384 KB Output is correct
46 Correct 32 ms 384 KB Output is correct
47 Correct 33 ms 504 KB Output is correct
48 Correct 27 ms 384 KB Output is correct
49 Correct 27 ms 384 KB Output is correct
50 Correct 23 ms 384 KB Output is correct
51 Correct 23 ms 384 KB Output is correct
52 Correct 22 ms 384 KB Output is correct
53 Execution timed out 2089 ms 3988 KB Time limit exceeded
54 Halted 0 ms 0 KB -