Submission #844756

#	Time	Username	Problem	Language	Result	Execution time	Memory
844756		Hakiers	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	0 / 100	0 ms	344 KiB

joi2019_ho_t3

#include <bits/stdc++.h>
using namespace std;
string s, t;
int n;
int moves;




int solve(){
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(i > 0 && i < n && s[i] == s[i-1] && s[i+1] != s[i]){
				swap(s[i], s[i+1]);
				moves++;
			}
			else if(i > 0 && i < n && s[i] == s[i+1] && s[i-1] != s[i]){
				swap(s[i], s[i-1]);
				moves++;
			}
		}
	}

	for(int i = 1; i < n; i++)
		if(s[i] == s[i-1]) return - 1;
		
	return moves;

}



int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> s;
	

	
	cout << solve() << "\n";
	
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 55
• Subtask 3: 0 / 15
• Subtask 4: 0 / 25