提出 #461905

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

class judge
{
public:
	int ID;
	bool if_good;
};

int Max = -1;
int MaxAnswer = 0;
judge judge_list[20];
bool solve(vector<int> true_list, int n, int ID);

int main()
{
	int n;
	cin >> n;
	string name;
	vector<string> namelist;
	vector<string> prenamelist;
	for(int i = 0; i < n; i++)
	{
		cin >> name;
		namelist.push_back(name);
		prenamelist.push_back(name);
	}
	sort(namelist.begin(),namelist.end());
	for(int i = 0; i < n; i++)
	{
		int ID;
		for(int j =0 ;j <n; j++)
		{
			if(prenamelist[i] == namelist[j])
			{
				ID = j;
				break;
			}
		}
		cin >> name;
		for(int j = 0; j < n; j++)
			if(name == namelist[j])
				judge_list[ID].ID = j;
		cin >> name;
		cin >> name;
		cin >> name;
		if(name == "good")
			judge_list[ID].if_good = true;
		else
			judge_list[ID].if_good = false;
		cin >> name;
	}
	
	
	vector<int> true_list;
	for(int i = 0; i < n; i ++)
		true_list.push_back(-1);
	true_list[0] = true;
	solve(true_list,n,0);
	true_list[0] = false;
	solve(true_list,n,0);
	
	if(Max == -1)
	{
		cout << "No answers" << endl;
	}
	else
	{
		for(int i = 0 ; i < n; i++)
		{
			if(MaxAnswer % 2 == 1)
				true_list[n-i-1] = 1;
			else
				true_list[n-i-1] = 0;
			MaxAnswer /= 2;
		}
		for(int i = 0 ; i< n; i++)
			if(true_list[i])
				cout << namelist[i] << endl;
	}

}


bool solve(vector<int> true_list, int n, int ID)
{
	int nextID = -1;
	
	if(true_list[judge_list[ID].ID] != -1)
	{
		if(true_list[ID])
			if(true_list[judge_list[ID].ID] != judge_list[ID].if_good)
				return false;
		if(!true_list[ID])
			if(true_list[judge_list[ID].ID] == judge_list[ID].if_good)
				return false;
	}
	int answer_size = 0;
	int answer = 0;
	for(int i = 0; i < n; i++)
	{
		answer += true_list[i];
		answer *= 2;
		if(true_list[i] == -1)
		{
			if(nextID == -1)
				nextID = i;
			break;
		}
		if(true_list[i] == true)
			answer_size++;
		if(i == n-1)
		{
			answer /= 2;
			if(answer_size >= Max)
			{
				if(Max == answer_size)
				{
					if(MaxAnswer <= answer)
					{
						MaxAnswer = answer;
						
					}
				}
				else
				{
					MaxAnswer = answer;
					Max = answer_size;
				}
			}
			return 1;
		}
	}
	
	
	if(true_list[judge_list[ID].ID] == -1)
	{
		nextID = judge_list[ID].ID;

		if(true_list[ID] == true)
			true_list[judge_list[ID].ID] = judge_list[ID].if_good;
		if(true_list[ID] == false)
			true_list[judge_list[ID].ID] = !(judge_list[ID].if_good);
		solve(true_list,n,nextID);
	}
	else
	{
	
		true_list[nextID] = true;
		solve(true_list, n, nextID);
		true_list[nextID] = false;
		solve(true_list, n, nextID);
	}	
	
	

	
}

提出情報

ジャッジ結果