답안 #299302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299302	2020-09-14T16:43:18 Z	eriksuenderhauf	Monochrome Points (JOI20_monochrome)	C++17	100 / 100	60 ms	16148 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];
int idx[4*N][2], vis[2*N];
vector<int> pos;

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

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  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;
  }
  idx[0][a[0]] = 1, idx[0][a[0]^1] = 0;
  for (int i = 1; i < 4*n; i++) {
    idx[i][0] = idx[i-1][0], idx[i][1] = idx[i-1][1];
    idx[i][a[i]]++;
  }
  ll ans = solve(n, 0);
  for (int i = 0; i < n; i++) if (s[i] == s[i+n] && a[i])
    vis[idx[nxt[i+n][0]][1] - idx[nxt[i][1]][0]] = i+1;
  for (int i = 0; i < n; i++) if (s[i] == s[i+n] && !a[i])
    vis[idx[nxt[i+n][0]][1] - idx[i][0]] = i+1;
  for (int i = 0; i < n; i++) if (vis[i])
    pos.push_back(vis[i] - 1);
  int lo = 0, hi = pos.size() - 1;
  while (lo <= hi) {
    int mi = (lo + hi) / 2;
    ll x1 = solve(n, pos[mi]);
    ans = max(ans, x1);
    if (lo == hi)
      break;
    if (x1 < solve(n, pos[mi+1]))
      lo = mi + 1;
    else
      hi = mi - 1;
  }
  cout << ans << "\n";
}

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	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	512 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

#	결과	실행 시간	메모리	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	512 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	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	1 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	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	1 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	512 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	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	512 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	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	1 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	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	1 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	512 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	512 KB	Output is correct
34	Correct	1 ms	512 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	1 ms	512 KB	Output is correct
37	Correct	1 ms	512 KB	Output is correct
38	Correct	1 ms	512 KB	Output is correct
39	Correct	1 ms	512 KB	Output is correct
40	Correct	1 ms	512 KB	Output is correct
41	Correct	1 ms	512 KB	Output is correct
42	Correct	1 ms	512 KB	Output is correct
43	Correct	1 ms	512 KB	Output is correct
44	Correct	1 ms	512 KB	Output is correct
45	Correct	1 ms	512 KB	Output is correct
46	Correct	1 ms	512 KB	Output is correct
47	Correct	1 ms	512 KB	Output is correct
48	Correct	1 ms	512 KB	Output is correct
49	Correct	1 ms	512 KB	Output is correct
50	Correct	1 ms	512 KB	Output is correct
51	Correct	1 ms	512 KB	Output is correct
52	Correct	1 ms	512 KB	Output is correct

Subtask #4
65.0 / 65.0

#	결과	실행 시간	메모리	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	512 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	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	1 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	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	1 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	512 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	512 KB	Output is correct
34	Correct	1 ms	512 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	1 ms	512 KB	Output is correct
37	Correct	1 ms	512 KB	Output is correct
38	Correct	1 ms	512 KB	Output is correct
39	Correct	1 ms	512 KB	Output is correct
40	Correct	1 ms	512 KB	Output is correct
41	Correct	1 ms	512 KB	Output is correct
42	Correct	1 ms	512 KB	Output is correct
43	Correct	1 ms	512 KB	Output is correct
44	Correct	1 ms	512 KB	Output is correct
45	Correct	1 ms	512 KB	Output is correct
46	Correct	1 ms	512 KB	Output is correct
47	Correct	1 ms	512 KB	Output is correct
48	Correct	1 ms	512 KB	Output is correct
49	Correct	1 ms	512 KB	Output is correct
50	Correct	1 ms	512 KB	Output is correct
51	Correct	1 ms	512 KB	Output is correct
52	Correct	1 ms	512 KB	Output is correct
53	Correct	35 ms	15380 KB	Output is correct
54	Correct	36 ms	15380 KB	Output is correct
55	Correct	32 ms	14612 KB	Output is correct
56	Correct	33 ms	14740 KB	Output is correct
57	Correct	22 ms	14868 KB	Output is correct
58	Correct	60 ms	15764 KB	Output is correct
59	Correct	50 ms	14740 KB	Output is correct
60	Correct	52 ms	14868 KB	Output is correct
61	Correct	36 ms	14996 KB	Output is correct
62	Correct	46 ms	14996 KB	Output is correct
63	Correct	30 ms	14868 KB	Output is correct
64	Correct	45 ms	14996 KB	Output is correct
65	Correct	26 ms	14100 KB	Output is correct
66	Correct	35 ms	14612 KB	Output is correct
67	Correct	34 ms	14612 KB	Output is correct
68	Correct	33 ms	13972 KB	Output is correct
69	Correct	57 ms	16148 KB	Output is correct
70	Correct	50 ms	14484 KB	Output is correct
71	Correct	22 ms	15380 KB	Output is correct
72	Correct	19 ms	15380 KB	Output is correct
73	Correct	19 ms	15380 KB	Output is correct

답안 #299302

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 21.0 / 21.0

Subtask #3 10.0 / 10.0

Subtask #4 65.0 / 65.0

Subtask #1
4.0 / 4.0

Subtask #2
21.0 / 21.0

Subtask #3
10.0 / 10.0

Subtask #4
65.0 / 65.0