# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
962355 | 0npata | Monochrome Points (JOI20_monochrome) | C++17 | 1 ms | 428 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;
#define int long long
#define vec vector
#define pi pair<int, int>
#define fst first
#define snd second
#define pb push_back
int n;
string s;
int mes(vec<pi> p) {
int res = 0;
int j = p[0].fst;
int k = p[0].fst;
int cntw = 1;
int cntb = 0;
for(int i = 0; i<n; i++) {
while(k != p[i].fst) {
cntw -= s[k]=='W';
cntb -= s[k] == 'B';
k+=1;
k %= 2*n;
}
while(j != p[i].snd) {
j += 1;
j %= 2*n;
cntw += s[j]=='W';
cntb += s[j] == 'B';
}
int rw = cntw-1;
int orb = n-cntb;
res += min(rw, orb);
}
return res;
}
int32_t main() {
cin >> n;
cin >> s;
vec<int> b(0);
vec<int> w(0);
for(int i = 0; i<s.size(); i++) {
if(s[i] == 'W') {
w.pb(i);
}
else {
b.pb(i);
}
}
int ans = 0;
vec<int> cand(0);
int lc = n-1;
int rc = n;
for(int i = max(n/2-10,(int) 0); i<min(n/2+10, n); i++) {
// construct possible pairings
vec<pi> p;
for(int j = 0; j<n; j++) {
p.pb({w[j], b[(j+i)%n]});
}
int res = mes(p);
ans = max(res, 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... |