제출 #110441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
110441		pamaj	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	0 / 100	3 ms	384 KiB

joi2019_ho_t3

#include <bits/stdc++.h>
using namespace std;
const int maxn = 410;

int n;
long long ans = 1e18;
string s;

void generate(int a, int b, int c, string crct)
{
	if((int)crct.size() == n)
	{
		vector<int> v1r, v1g, v1y;
		vector<int> v2r, v2g, v2y;

		for(int i = 0; i < n; i++)
		{
			if(s[i] == 'R')
			{
				v1r.push_back(i);
			}
			if(s[i] == 'G')
			{
				v1g.push_back(i);
			}
			if(s[i] == 'Y')
			{
				v1y.push_back(i);
			}
			if(crct[i] == 'R')
			{
				v2r.push_back(i);
			}
			if(crct[i] == 'G')
			{
				v2g.push_back(i);
			}
			if(crct[i] == 'Y')
			{
				v2y.push_back(i);
			}
		}

		long long num_dif = 0;

		for(int i = 0; i < n; i++)
			if(s[i] != crct[i]) num_dif++;

		ans = min(ans, num_dif);

		return;
	}

	else
	{
		if((int)crct.size())
		{
			if(a)
			{
				char last = crct[crct.size() - 1];
				if(last != 'R') generate(a - 1, b, c, crct + "R");
			}
			if(b)
			{
				char last = crct[crct.size() - 1];
				if(last != 'G') generate(a, b - 1, c, crct + "G");
			}
			if(c)
			{
				char last = crct[crct.size() - 1];
				if(last != 'Y') generate(a, b, c - 1, crct + "Y");
			}
		}
		else if((int)crct.size() == 0)
		{
			if(a) generate(a - 1, b, c, crct + "R");
			if(b) generate(a, b - 1, c, crct + "G");
			if(c) generate(a, b, c - 1, crct + "Y");
		}
	}
}

string vazia;

int qt[4];

int main()
{
	cin >> n;
	

	for(int i = 0; i < n; i++)
	{
		char c;
		cin >> c;
		int tipo;
		if(c == 'R') tipo = 1;
		else if(c == 'G') tipo = 2;
		else tipo = 3;

		qt[tipo]++;

		s += c;	
	}

	string crct;

	generate(qt[1], qt[2], qt[3], vazia);

	cout << (ans == (long long)1e18 ? -1 : ans) << "\n";

}

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