oj.uz

답안 #299105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299105 2020-09-14T13:40:32 Z eriksuenderhauf Monochrome Points (JOI20_monochrome) C++17
0 / 100
 1 ms 384 KB 
#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]]++;
  }
  for (int i = 0; i < n; i++) if (s[i] == s[i+n]) {
    int hi = idx[nxt[i+n][a[i]^1]][a[i]] - idx[nxt[i][a[i]]][a[i]^1];
    if (!vis[hi] && 2*hi <= n)
      vis[hi] = i+1;
  }
  for (int i = 0; 2 * i <= n; i++) if (vis[i])
    pos.push_back(vis[i] - 1);
  ll ans = solve(n, 0);
  int lo = 0, hi = pos.size() - 1;
  while (lo <= hi) {
    int m1 = (2 * lo + hi) / 3;
    int m2 = (lo + 2 * hi) / 3;
    ll x1 = solve(n, pos[m1]);
    ll x2 = solve(n, pos[m2]);
    if (x1 == x2)
      lo = m1 + 1, hi = m2 - 1;
    else if (x1 > x2)
      hi = m2 - 1;
    else
      lo = m1 + 1;
    ans = max({ans, x1, x2});
  }
  cout << ans << "\n";
}

Subtask #1
0.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 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Incorrect 1 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0.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 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Incorrect 1 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0.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 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Incorrect 1 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

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 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Incorrect 1 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -