답안 #298399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
298399	2020-09-12T19:09:03 Z	eriksuenderhauf	Monochrome Points (JOI20_monochrome)	C++17	35 / 100	2000 ms	8724 KB

monochrome

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
int a[4*N], nxt[3*N][2];

ll solve(int n, int i) {
  int ptr[2] = {i+n, i+n}, cnt[4] = {0, 0, 0, 0};
  ll val = 0;
  for (int j = i, c = a[i]; j < i+n; c = a[++j]) {
    cnt[c+2] += nxt[ptr[c]][c] - ptr[c];
    ptr[c] = nxt[ptr[c]][c] + 1;
    val += min(cnt[c+2], cnt[c^1]) + cnt[c]++;
  }
  return val;
}

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] = a[i+2*n] = s[i] == 'B';
  nxt[3*n][0] = nxt[3*n][1] = 3*n;
  for (int i = 3*n-1; i >= 0; i--) {
    nxt[i][0] = nxt[i+1][0], nxt[i][1] = nxt[i+1][1];
    nxt[i][a[i]^1] = i;
  }
  ll ans = 0;
  int i = 0;
  // for (int i = 1; i < n; i++)// if (s[i] != s[i+n])
  //   ans = max(ans, solve(n, i));
  while (i < n) {
    ans = max(ans, solve(n, i++));
    while (i < n && s[i-1] != s[i+n-1])
      i++;
  }
  cout << ans << "\n";
}

Compilation message

monochrome.cpp: In function 'int main()':
monochrome.cpp:20:8: warning: unused variable 'cur_t' [-Wunused-variable]
   20 |   auto cur_t = clock();
      |        ^~~~~

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 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	1 ms	384 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	0 ms	384 KB	Output is correct
29	Correct	0 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	0 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 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	1 ms	384 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	0 ms	384 KB	Output is correct
29	Correct	0 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	0 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	10 ms	384 KB	Output is correct
35	Correct	10 ms	384 KB	Output is correct
36	Correct	9 ms	384 KB	Output is correct
37	Correct	9 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	12 ms	384 KB	Output is correct
40	Correct	17 ms	384 KB	Output is correct
41	Correct	9 ms	384 KB	Output is correct
42	Correct	10 ms	384 KB	Output is correct
43	Correct	9 ms	384 KB	Output is correct
44	Correct	13 ms	384 KB	Output is correct
45	Correct	3 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	3 ms	384 KB	Output is correct
48	Correct	14 ms	504 KB	Output is correct
49	Correct	12 ms	384 KB	Output is correct
50	Correct	1 ms	384 KB	Output is correct
51	Correct	0 ms	384 KB	Output is correct
52	Correct	17 ms	384 KB	Output is correct

Subtask #4
0.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 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	1 ms	384 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	0 ms	384 KB	Output is correct
29	Correct	0 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	0 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	10 ms	384 KB	Output is correct
35	Correct	10 ms	384 KB	Output is correct
36	Correct	9 ms	384 KB	Output is correct
37	Correct	9 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	12 ms	384 KB	Output is correct
40	Correct	17 ms	384 KB	Output is correct
41	Correct	9 ms	384 KB	Output is correct
42	Correct	10 ms	384 KB	Output is correct
43	Correct	9 ms	384 KB	Output is correct
44	Correct	13 ms	384 KB	Output is correct
45	Correct	3 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	3 ms	384 KB	Output is correct
48	Correct	14 ms	504 KB	Output is correct
49	Correct	12 ms	384 KB	Output is correct
50	Correct	1 ms	384 KB	Output is correct
51	Correct	0 ms	384 KB	Output is correct
52	Correct	17 ms	384 KB	Output is correct
53	Execution timed out	2074 ms	8724 KB	Time limit exceeded
54	Halted	0 ms	0 KB	-

답안 #298399

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