제출 #536359

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

monochrome

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<numeric>
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;

const int N = 25 + 8, inf = 0x80808080;
int n, n2;
char s[N << 1];
vector<int> B, W;

bool inside(int l, int r, int p) {
    return (p - l) * (ll)(p - r) < 0;
}
int p[N];
int calc() {
    // B[i], W[p[i]]
    int ans(0);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < i; ++j)
            ans += inside(B[i], W[p[i]], B[j]) ^ inside(B[i], W[p[i]], W[p[j]]);
    return ans;
}

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n >> (s + 1);
    n2 = n << 1;
    for (int i = 1; i <= n2; ++i) {
        if (s[i] == 'B')
            B.push_back(i);
        else W.push_back(i);
    }

    iota(p, p + n, 0);
    int ans(0);
    do {
        ans = max(ans, calc());
    } while (next_permutation(p, p + n));

    cout << ans << '\n';
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/

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