Computing_Graph/main.cpp at master · FantasqueX/Computing_Graph · 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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
#include <iostream>
#include <string>
#include <cassert>
#include <iomanip>
#include <sstream>

#include <map>
#include "graph/node.h"
#include "graph/graph.h"

using namespace std;

map <string,float> placeholderMap;//placeholder的名字与数值一一对应，作为eval的参数
int main()
{
	Graph gra;//计算图
	int n,m,q;//样例中输入的三种操作的个数
	string name,type,tmp;//用到的临时字符串
	float value;//用到的临时float
	cin>>n;//C V P三种节点数
	for(int i=0; i<n; i++)
	{
		cin>>name;
		cin>>type;
		if(type=="C")
		{
			cin>>value;
			gra.pushNode(name,new Constant(value));
		}
		else if(type=="V")
		{
			cin>>value;
			gra.pushNode(name,new Variable(value));
		}
		else if(type=="P")
		{
			gra.pushNode(name,new Placeholder);
		}
		else assert(0);
	}

	cin>>m;//运算节点数
	for(int i=0; i<m; i++)
	{
		cin>>name;
		cin>>tmp;
		assert(tmp=="=");//断言
		string p1,p2,p3,p4;//处理输入
		cin>>p1;
		if(p1=="COND")
		{
			cin>>p2;
			cin>>p3;
			cin>>p4;
			gra.pushNode(name,new Cond(gra[p2],gra[p3],gra[p4]));
		}
		else if(p1=="PRINT")
		{
			cin>>p2;
			gra.pushNode(name,new Print(p2,gra[p2]));
		}
		else if(p1=="SIN")
		{
			cin>>p2;
			gra.pushNode(name,new Sin(gra[p2]));
		}
		else if(p1=="EXP")
		{
			cin>>p2;
			gra.pushNode(name,new Exp(gra[p2]));
		}
		else if(p1=="LOG")
		{
			cin>>p2;
			gra.pushNode(name,new Log(gra[p2]));
		}
		else if(p1=="TANH")
		{
			cin>>p2;
			gra.pushNode(name,new Tanh(gra[p2]));
		}
		else if(p1=="SIGMOID")
		{
			cin>>p2;
			gra.pushNode(name,new Sigmoid(gra[p2]));
		}
		else
		{
			cin>>type;
			cin>>p2;
			if(type=="+")
			{
				gra.pushNode(name,new Sum(gra[p1],gra[p2]));
			}
			else if(type=="-")
			{
				gra.pushNode(name,new Subtraction(gra[p1],gra[p2]));
			}
			else if(type=="*")
			{
				gra.pushNode(name,new Multiply(gra[p1],gra[p2]));
			}
			else if(type=="/")
			{
				gra.pushNode(name,new Division(gra[p1],gra[p2]));
			}
			else if(type==">")
			{
				gra.pushNode(name,new GTR(gra[p1],gra[p2]));
			}
			else if(type=="<")
			{
				gra.pushNode(name,new LSS(gra[p1],gra[p2]));
			}
			else if(type==">=")
			{
				gra.pushNode(name,new GEQ(gra[p1],gra[p2]));
			}
			else if(type=="<=")
			{
				gra.pushNode(name,new LEQ(gra[p1],gra[p2]));
			}
			else if(type=="==")
			{
				gra.pushNode(name,new EQU(gra[p1],gra[p2]));
			}
			else assert(0);
		}
	}

	cin>>q;
	for(int i=0; i<q; i++)
	{
		string command;
		getline(cin,command);
		if(command.empty())//跳过空行
		{
			i--;
			continue;
		}
		stringstream ss(command);
		ss>>type;
		if(type=="EVAL")
		{
			placeholderMap.clear();
			ss>>name;
			string phcountstr;
			ss>>phcountstr;
			int phcount=0;
			if(!phcountstr.empty())
			{
				phcount=stoi(phcountstr);
			}

			for(int j=0; j<phcount; j++)
			{
				string x;
				float y;
				ss>>x>>y;
				placeholderMap.insert(make_pair(x,y));
			}

			float ov = gra.eval(name,placeholderMap);
			if(!isnan(ov))
				cout << fixed << setprecision(4) <<ov<<endl;
		}
		else if(type=="SETCONSTANT")
		{
			ss>>name;
			ss>>value;
			gra.setVariable(name,value);
		}
		else if(type=="SETANSWER")
		{
			ss>>name;
			int t;
			ss>>t;
			gra.setAnswer(name,t);
		}
		else assert(0);
	}
}