Submission #298745

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
298745	2020-09-13T22:59:33 Z	eriksuenderhauf	Monochrome Points (JOI20_monochrome)	C++11	4 / 100	1 ms	512 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 mncnt = N;
 
ll solve(int n, int i) {
  int ptr[2] = {i+n, i+n};
  ll val = 0;
  int cnt = 0;
  for (int j = i; j < i+n && cnt < mncnt; ++j) {
    ll x = min((ptr[a[j]] = nxt[ptr[a[j]]][a[j]] + 1) - n - i - 1, j - i);
    cnt += x != j - i;
    val += x;
  }
  mncnt = min(mncnt, cnt);
  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;
  }
  ll ans = solve(n, 0);
  for (int i = 0; i < n; i++) if (s[i] == s[i+n])
    ans = max(ans, solve(n, i));
  cout << ans << "\n";
}

Subtask #1

4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	512 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	512 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

0.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	512 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	512 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	Incorrect	1 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	512 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	512 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	Incorrect	1 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	512 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	512 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	Incorrect	1 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-