Submission #298125

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
298125	2020-09-12T12:19:34 Z	eriksuenderhauf	Monochrome Points (JOI20_monochrome)	C++11	35 / 100	23 ms	2452 KB

monochrome

#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 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';
  ll ans = 0;
  while (clock() - cur_t < 19950) {
    ans = max(ans, solve(n, get(0, n-1)));
    // cerr << "HUH" << endl;
  }
  cout << ans << "\n";
}

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
0.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	384 KB	Output is correct
2	Correct	21 ms	384 KB	Output is correct
3	Correct	21 ms	384 KB	Output is correct
4	Correct	21 ms	384 KB	Output is correct
5	Correct	21 ms	384 KB	Output is correct
6	Correct	21 ms	384 KB	Output is correct
7	Correct	21 ms	384 KB	Output is correct
8	Correct	21 ms	384 KB	Output is correct
9	Correct	21 ms	384 KB	Output is correct
10	Correct	21 ms	384 KB	Output is correct
11	Correct	21 ms	384 KB	Output is correct
12	Correct	21 ms	384 KB	Output is correct
13	Correct	21 ms	384 KB	Output is correct
14	Correct	21 ms	384 KB	Output is correct
15	Correct	21 ms	384 KB	Output is correct
16	Correct	21 ms	384 KB	Output is correct
17	Correct	21 ms	384 KB	Output is correct
18	Correct	21 ms	384 KB	Output is correct
19	Correct	21 ms	512 KB	Output is correct
20	Correct	21 ms	384 KB	Output is correct
21	Correct	21 ms	384 KB	Output is correct
22	Correct	21 ms	384 KB	Output is correct
23	Correct	21 ms	384 KB	Output is correct
24	Correct	21 ms	384 KB	Output is correct
25	Correct	21 ms	384 KB	Output is correct
26	Correct	21 ms	512 KB	Output is correct
27	Correct	21 ms	408 KB	Output is correct
28	Correct	21 ms	416 KB	Output is correct
29	Correct	21 ms	384 KB	Output is correct
30	Correct	21 ms	308 KB	Output is correct
31	Correct	21 ms	384 KB	Output is correct
32	Correct	21 ms	384 KB	Output is correct
33	Correct	21 ms	384 KB	Output is correct
34	Correct	21 ms	384 KB	Output is correct
35	Correct	21 ms	384 KB	Output is correct
36	Correct	21 ms	384 KB	Output is correct
37	Correct	21 ms	384 KB	Output is correct
38	Correct	21 ms	384 KB	Output is correct
39	Correct	21 ms	384 KB	Output is correct
40	Correct	21 ms	384 KB	Output is correct
41	Correct	21 ms	384 KB	Output is correct
42	Correct	21 ms	384 KB	Output is correct
43	Correct	21 ms	384 KB	Output is correct
44	Correct	21 ms	384 KB	Output is correct
45	Correct	21 ms	384 KB	Output is correct
46	Correct	21 ms	384 KB	Output is correct
47	Correct	21 ms	384 KB	Output is correct
48	Correct	21 ms	384 KB	Output is correct
49	Correct	21 ms	512 KB	Output is correct
50	Correct	21 ms	384 KB	Output is correct
51	Correct	21 ms	384 KB	Output is correct
52	Correct	21 ms	384 KB	Output is correct
53	Incorrect	23 ms	2452 KB	Output isn't correct
54	Halted	0 ms	0 KB	-

Submission #298125

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 21.0 / 21.0

Subtask #3 10.0 / 10.0

Subtask #4 0.0 / 65.0

Subtask #1
4.0 / 4.0

Subtask #2
21.0 / 21.0

Subtask #3
10.0 / 10.0

Subtask #4
0.0 / 65.0