# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108749 | tictaccat | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++14 | 4 ms | 384 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;
const int INF = 1e9;
int N;
string S;
int inv(vector<int> v) {
int res = 0;
bool sorted = false;
while (!sorted) {
sorted = true;
for (int i = 0; i < v.size()-1; i++) {
if (v[i] > v[i+1]) {
swap(v[i],v[i+1]);
res++;
sorted = false;
}
}
}
return res;
}
int main() {
cin >> N >> S;
int cR = count(S.begin(),S.end(),'R'), cG = N-cR;
if (abs(cG-cR) <= 1) {
int distM = INF;
if (cG >= cR) {
int curR = 1, curG = 0;
vector<int> v(N);
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
v[i] = curR;
curR += 2;
}
else if (S[i] == 'G') {
v[i] = curG;
curG += 2;
}
}
distM = min(distM,inv(v));
}
if (cR >= cG) {
int curR = 0, curG = 1;
vector<int> v(N);
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
v[i] = curR;
curR += 2;
}
else if (S[i] == 'G') {
v[i] = curG;
curG += 2;
}
}
distM = min(distM,inv(v));
}
cout << distM << "\n";
}
else {
cout << "-1\n";
}
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... |