#include <bits/stdc++.h>
using namespace std;
#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t);
#define forr(i, l, r) for(int i=l; i<r; i++)
#define frange(i, l) forr(i, 0, l)
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef long long lli;
typedef vector<vi> vvi;
typedef vector<lli> vll;
typedef vector<bool> vb;
typedef set<int> seti;
void usaco() {
freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
}
int n;
lli dist(string &st1, string &st2) {
seti r, g, y;
lli tot = 0;
frange(i, n) {
if(st1[i] == 'R') r.insert(i);
else if(st1[i] == 'G') g.insert(i);
else y.insert(i);
if(st2[i] == 'R') {
if(!r.size()) continue;
tot += i - *r.begin();
r.erase(r.begin());
}
else if(st2[i] == 'G') {
if(!g.size()) continue;
tot += i - *g.begin();
g.erase(g.begin());
}
else {
if(!y.size()) continue;
tot += i - *y.begin();
y.erase(y.begin());
}
}
return tot;
}
int main() {
// usaco();
string str;
cin >> n >> str;
int rc = 0;
int gc = 0;
frange(i, n) {
if(str[i] == 'R') rc++;
else gc++;
}
if(rc == gc) {
string str1, str2;
frange(i, n) {
if(i % 2) {
str1 += 'R';
str2 += 'G';
}
else {
str1 += 'G';
str2 += 'R';
}
}
printf("%lld", min(dist(str, str1), dist(str, str2)));
}
else if(rc == gc+1) {
string str1;
frange(i, n) {
if(i % 2==0) str1 += 'R';
else str1 += 'G';
}
printf("%lld", dist(str, str1));
}
else if(rc == gc-1) {
string str1;
frange(i, n) {
if(i % 2) str1 += 'R';
else str1 += 'G';
}
printf("%lld", dist(str, str1));
}
else printf("-1");
}
Compilation message
joi2019_ho_t3.cpp: In function 'void usaco()':
joi2019_ho_t3.cpp:25:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
25 | freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |