Competitive-Programming-Problem-Solutions/Is-A-Has-A.cpp at master · ahochheiden/Competitive-Programming-Problem-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include <iostream>
#include <string>
#include <map>
#include <assert.h>

using namespace std;

const int MAX_N = 501;

bool isA[MAX_N][MAX_N];
bool hasA[MAX_N][MAX_N];

const string isAString = "is-a";
const string hasAString = "has-a";

map<string, int> idMap;

void prepare()
{
	for(int i = 0; i < MAX_N; i++)
	{
		for(int j = 0; j < MAX_N; j++)
		{
			isA[i][j] = false;
		}
	}

	for(int i = 0; i < MAX_N; i++)
	{
		isA[i][i] = true;
	}
}

int classNameToID(const string& className)
{
	static int count = 0;

	if(!(idMap.count(className)))
	{
		idMap.insert(pair<string, int>(className, count++));
	}

	return idMap[className];
}

int main()
{
	prepare();

	// parse input
	int n, m;

	cin >> n >> m;

	string class1, class2, relationship;

	int id1, id2;

	for(int i = 0; i < n; i++)
	{
		cin >> class1 >> relationship >> class2;

		id1 = classNameToID(class1);
		id2 = classNameToID(class2);

		if(relationship == isAString)
		{
			isA[id1][id2] = true;
		}
		else
		{
			if(relationship == hasAString)
			{
				hasA[id1][id2] = true;
			}
			else
			{
				// programming error, should never happen
				assert(false);
			}
		}
	}

	// process isA
	for(int k = 0; k < MAX_N; ++k)
	{
		for(int i = 0; i < MAX_N; ++i)
		{
			for(int j = 0; j < MAX_N; ++j)
			{
				isA[i][j] = isA[i][j] || (isA[i][k] && isA[k][j]);
			}
		}
	}

	// process hasA
	for(int k = 0; k < MAX_N; ++k)
	{
		for(int i = 0; i < MAX_N; ++i)
		{
			for(int j = 0; j < MAX_N; ++j)
			{
				hasA[i][j] = hasA[i][j] || (hasA[i][k] && hasA[k][j]);
				hasA[i][j] = hasA[i][j] || (isA[i][k] && hasA[k][j]);
				hasA[i][j] = hasA[i][j] || (hasA[i][k] && isA[k][j]);
			}
		}
	}

	bool queryStatus;

	// output
	for(int i = 1; i <= m; i++)
	{
		cin >> class1 >> relationship >> class2;

		id1 = classNameToID(class1);
		id2 = classNameToID(class2);

		if(relationship == isAString)
		{
			queryStatus = isA[id1][id2];
		}
		else
		{
			if(relationship == hasAString)
			{
				queryStatus = hasA[id1][id2];
			}
			else
			{
				// programming error, should never happen
				assert(false);
			}
		}

		cout << "Query " << i << ": " << (queryStatus ? "true" : "false") << endl;
	}

	return 0;
}