# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
898609 | AdamGS | Monochrome Points (JOI20_monochrome) | C++17 | 1 ms | 452 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
string s;
cin >> n >> s;
ll b=0, w=n, p=-1;
rep(i, 2*n) {
if(s[i]=='B') ++b; else --w;
if(b==w) {
p=i;
break;
}
}
vector<pair<int,int>>V;
int l=2*n-1;
for(int i=p; i>=0; --i) if(s[i]=='B') {
while(s[l]=='B') --l;
V.pb({i, l});
--l;
}
l=0;
for(int i=p+1; i<2*n; ++i) if(s[i]=='B') {
while(s[l]=='B') ++l;
V.pb({l, i});
++l;
}
ll ans=0;
rep(i, V.size()) rep(j, i) if((V[i].st<V[j].st && V[i].nd<V[j].nd) || (V[j].st<V[i].st && V[j].nd<V[i].nd)) ++ans;
cout << ans << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |