Submission #1343449

#TimeUsernameProblemLanguageResultExecution timeMemory
1343449blacktulipMonochrome Points (JOI20_monochrome)C++20
100 / 100
16 ms7136 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 = 400005;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t;
lo cev;
lo PS[li];
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')a[i]++;
		else a[(i+n)%(2*n)]--;
	}
	for(int i=1;i<=n*2;i++){
		PS[i]=PS[i-1]+a[i-1];
		v.pb(PS[i]);
	}
	sort(v.begin(),v.end());
	lo at=v[n-1];
	for(int i=1;i<=n*2;i++){
		cev+=abs(PS[i]-at);
	}
	cout<<(n*((lo)n-1)-cev)/2<<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...