oj.uz

Submission #818983

# Submission time Handle Problem Language Result Execution time Memory
818983 2023-08-10T07:31:30 Z vjudge1 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
0 / 100
 1 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define endl "\n"
#define pii pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define pque priority_queue
#define pqueg priority_queue<ll,vector<ll>,greater<ll>>
#define que queue<ll>
#define FOR(m,i,n) for(int i=(m); i<=(n); i++)
#define FORM(m,i,n) for(int i=(m); i>=(n); i--)
#define all(v) sort(v.begin(),v.end())
ll n,ans,r,g;
string s;
int main() {
//	char c = 'R' ^ 'L' ^ 'R';
//	cout << c << endl;
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> s;
	s = '!' + s;
	FOR(1,i,n) {
		if(s[i] == 'R') r++;
		else g++;
	}
	if(abs(r-g) > 1) {
		cout << -1 << endl;
		return 0;
	}
	if(r == g || (r > g && s[1] == 'R') || (g > r && s[1] == 'G')) {
		FOR(2,i,n) {
			if(s[i] == s[i-1]) {
				FOR(i+1,j,n) {
					if(s[j] != s[i]) {
						FORM(j,k,i+1) {
							swap(s[k],s[k-1]);
							ans++;
						}
						break;
					}
				}
			}
		}
	}
	else {
		char now = 'R' ^ 'G' ^ s[1];
		FOR(1,i,n) {
			if(s[i] != now) {
				FOR(i+1,j,n) {
					if(s[j] == now) {
						FORM(j,k,i+1) {
							swap(s[k],s[k-1]);
							ans++;
						}
						break;
					}
				}
			}
			now = s[i] ^ 'R' ^ 'G';
		}
	}
	cout << ans << endl;
}

/*
5
GGGRR

7
GGRRGRR
*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -