CCF 201912-3 化学方程式

#include <cstring>
#include <string.h>
#include <iostream>
#include <stdio.h>
#include <unordered_map>
#include <map>
#define ll long long
#define PII pair<int, int>
#define MSI map<string,int>
#define TLE ios::sync_with_stdio(0),cin.tie(0)
#define mod 1000000007
const int INF = 0x3f3f3f3f;
using namespace std;
MSI ma1, ma2;
int GetCoef(string s, int* index) {
	int coef = 0, i = *index;
	while (s[i] >= 48 && s[i] <= 57)
		coef = coef * 10 + s[i++] - 48;
	*index = i;
	if (coef == 0) return 1;
	return coef;
}
void ProcessBra(string formula, MSI& mp1, int& index) {
	while (1) {
		string atom = string(1, formula[index++]);
		if (atom == "(") {
			MSI mp2;
			ProcessBra(formula, mp2, index);
			int num = GetCoef(formula, &index);
			for (MSI::iterator i = mp2.begin(); i != mp2.end(); i++)
				mp1[(*i).first] += (*i).second * num;
		}
		else if (atom == ")") return;
		else {
			if (formula[index] >= 'a' && formula[index] <= 'z')
				atom += string(1, formula[index++]);
			int num = GetCoef(formula, &index);
			mp1[atom] += num;
		}
	}
}
void f(string s, string cla) {
	int coef = 1, index = 0;
	coef = GetCoef(s, &index);
	string formula = s.substr(index);
	MSI mp1; index = 0;
	while (index < formula.size()) {
		string atom = string(1, formula[index++]);
		if (atom == "(") {
			MSI mp2;
			ProcessBra(formula, mp2, index);
			int num = GetCoef(formula, &index);
			for (MSI::iterator i = mp2.begin(); i != mp2.end(); i++)
				mp1[(*i).first] += (*i).second * num;
		}
		else {
			if (formula[index] >= 'a' && formula[index] <= 'z')
				atom += formula[index++];
			int num = 0;
			num = GetCoef(formula, &index);
			mp1[atom] += num;
		}
	}
	for (MSI::iterator i = mp1.begin(); i != mp1.end(); i++)
		if (cla == "left")
			ma1[(*i).first] += (*i).second * coef;
		else
			ma2[(*i).first] += (*i).second * coef;
}
void makestr(string s, string cla) {
	int len = s.length(), end = 0, start = 0;
	string e;
	while (1) {
		end = s.find('+', start);
		if (end == -1) {
			e = s.substr(start);
			f(e, cla);
			break;
		}
		e = s.substr(start, end - start);
		f(e, cla);
		start = end + 1;
	}
}
int main() {
	TLE;
	int T;
	cin >> T;
	while (T--) {
		ma1.clear(), ma2.clear();
		string s;
		cin >> s;
		int len = s.length(), flag = 0;
		while (s[flag] != '=') flag++;
		string l(begin(s), begin(s) + flag);
		string r(begin(s) + flag + 1, begin(s) + len);
		makestr(l, "left");
		makestr(r, "right");
		if (ma1 != ma2)
			puts("N");
		else
			puts("Y");
	}
}