提出 #462617

---

ソースコード 拡げる

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

int main() {
	int n;
	cin >> n;
	map<string, int> m;
	vector<pair<string, int>> val;
	for (size_t i = 0; i < n; i++)
	{
		string s;
		cin >> s;
		val.push_back(make_pair(s, -1));
		m[s] = i;
	}
	bool bad = false;
	for (size_t i = 0; i < n; i++)
	{
		string u, v, s;
		cin >> u >> s >> s >> v >> s;
		auto& iti = val[i];
		auto& itu = val[m[u]];
		if (iti.second == -1)iti.second = i;
		if (itu.second == -1)itu.second = m[u];
		if (v == "good") {
			int uni = itu.second;
			int unito = iti.second;
			if (uni < unito)swap(uni, unito);
			for (pair<string, int>& p : val)
			{
				if (p.second == uni) {
					p.second = unito;
				}
			}
		}
		else if (v == "bad") {
			if (iti.second == itu.second)bad = true;
		}
	}
	vector<string> goods;
	vector<string> zero, one;
	int zn = -1, on = -1;
	for (pair<string, int>& p : val)
	{
		if (p.second == -1) {
			goods.push_back(p.first);
		}
		else {
			if (zn == -1 || zn == p.second) {
				zn = p.second;
				zero.push_back(p.first);
			}
			else if (on == -1 || on == p.second) {
				on = p.second;
				one.push_back(p.first);
			}
			else {
				bad = true;
			}
		}
	}
	if (bad)cout << "No answers" << endl;
	else {
		bool zeroisbad = false;
		if (zero.size() == one.size()) {
			if (zero.size() != 0) {
				auto z = min_element(zero.begin(), zero.end());
				auto o = min_element(one.begin(), one.end());
				if (*z > *o)zeroisbad = true;
			}
		}
		else {
			if (zero.size() < one.size()) {
				zeroisbad = true;
			}
		}
		if (zeroisbad)swap(zero, one);
		goods.assign(zero.begin(), zero.end());
		if (goods.size() == 0) {
			cout << "No answers" << endl;
		}
		else {
			sort(goods.begin(), goods.end());
			for (string s : goods) {
				cout << s << endl;
			}
		}
	}
	return 0;
}

提出情報

ジャッジ結果