Submission #1343428

#TimeUsernameProblemLanguageResultExecution timeMemory
1343428blacktulipMonochrome Points (JOI20_monochrome)C++20
25 / 100
2094 ms448 KiB
//Hello!..
//dört böler altı artı iki ama ne böler altı ne böler iki
//Başarı, Boş Duranın Hakkı Değil... Koşturanın Hakkıdır. Hakan?
//Ne yapayım, elimden gelen bu :(
//S'il vous plait
#include <bits/stdc++.h>
using namespace std;

typedef long long lo; 

#define fi first
#define se second
#define endl "\n"
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define setrandom mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define getrandom(a,b) uniform_int_distribution<int>(a,b)(rng)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
#define _ << " " <<

const lo inf = 1000000000;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t;
int cev;
string s;
vector<int> v,vv;

int32_t main(){
	fio();
	cin>>n>>s;
	for(int i=0;i<n*2;i++){
		if(s[i]=='B')v.pb(i);
		else vv.pb(i);
	}
	int mx=0;
	for(int k=0;k<n;k++){
		cev=0;
		for(int j=0;j<n;j++){
			for(int ii=0;ii<n;ii++){
				int l1=v[(ii)%n];
				int r1=vv[(ii+k)%n];
				int l2=v[(j)%n];
				int r2=vv[(j+k)%n];
				if(l1>r1)swap(l1,r1);
				if(l2>r2)swap(l2,r2);
				//~ cerr<<k _ j _ l1 _ r1 _ l2 _ r2 _ cev _ "AA\n";
				if(l1<l2 && l2<r1 && r1<r2)cev++;
				else if(l1>l2 && r2>l1 && r1>r2)cev++;
			}
		}
		//~ cerr<<k _ cev/2 _ "AA"<<endl;
		mx=max(mx,(cev)/2);
	}
	cout<<mx<<endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...