# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
516344 | qwerasdfzxcl | Monochrome Points (JOI20_monochrome) | C++14 | 1 ms | 296 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>
typedef long long ll;
using namespace std;
const ll INF = 1e18;
char a[5050];
vector<pair<int, int>> E;
int main(){
int n;
scanf("%d", &n);
scanf("%s", a+1);
n *= 2;
int ans = (n/2) * (n/2-1);
for (int i=1;i<=n;i++) if (a[i]=='B'){
int idx = -1, mx = -1;
for (int j=1;j<=n;j++) if (a[j]=='W'){
int val = min((n+j-i)%n, (n+i-j)%n);
if (mx<val) idx = j, mx = val;
}
ans -= (n/2 - mx);
E.emplace_back(i, idx);
if (i>idx) swap(E.back().first, E.back().second);
//a[idx] = 0;
}
printf("%d\n", ans/2);
return 0;
}
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... |