제출 #569317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
569317		OttoTheDino	Monochrome Points (JOI20_monochrome)	C++17	25 / 100	2081 ms	340 KiB

monochrome

#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
#define len(a)                      (int)a.size()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n; cin >> n;
    string s; cin >> s;
    vi v[2];
    rep (i,0,2*n-1) v[s[i]=='B'].pb(i);

    ll ans = 0;
    rep (k,0,n-1) {
        ll cur = 0;
        rep (i,0,n-1) {
            rep (j,i+1,n-1) {
                int x1 = min(v[0][i], v[1][(i+k)%n]);
                int y1 = max(v[0][i], v[1][(i+k)%n]);
                int x2 = min(v[0][j], v[1][(j+k)%n]);
                int y2 = max(v[0][j], v[1][(j+k)%n]);
                if (x1<y2 && x1>x2 && y1>y2) ++cur;
                if (y1<y2 && y1>x2 && x1<x2) ++cur;
            }
        }
        ans = max(ans, cur);
    }

    cout << ans << "\n";

    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 21 / 21
• Subtask 3: 0 / 10
• Subtask 4: 0 / 65