CSP（三）

最新推荐文章于 2024-10-11 12:01:25 发布

mwwb

最新推荐文章于 2024-10-11 12:01:25 发布

阅读量100

点赞数

分类专栏：备战csp 文章标签：算法

本文链接：https://blog.csdn.net/qq_43278421/article/details/106572192

版权

备战csp 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

#include <bits/stdc++.h>
using namespace std;

unordered_map<string, int> parseFormulaEx(string::iterator s, string::iterator e) {
    unordered_map<string, int> cnt;
    // 计算系数
    int coef = 0;
    while (isdigit(*s)) {
        coef = coef * 10 + *s - '0';
        ++s;
    }
    coef = max(coef, 1);

    while (s != e) {
        unordered_map<string, int> temp;
        if (*s == '(') { // 找到匹配的')'
            auto p = s + 1;
            int cnt = 1;
            while (cnt != 0) {
                if (*p == '(')
                    ++cnt;
                else if (*p == ')')
                    --cnt;
                ++p;
            }
            temp = parseFormulaEx(s + 1, p - 1); // 去掉括号，递归
            s = p;
        } else {
            string element(1, *s);
            if (s + 1 != e && islower(*(s + 1))) {
                element.append(1, *(s + 1));
                ++s;
            }
            temp[element] = 1;
            ++s;
        }

        // 计算下标
        int subscript = 0;
        while (s != e && isdigit(*s)) {
            subscript = subscript * 10 + *s - '0';
            ++s;
        }
        subscript = max(subscript, 1);

        // 计入总量
        for (const auto& ele: temp) {
            cnt[ele.first] += subscript * ele.second;
        }
    }
    for (auto& ele: cnt) ele.second *= coef;
    return cnt;
}

unordered_map<string, int> parseExpr(string::iterator s, string::iterator e) {
    //cout << string(s, e) << endl;
    unordered_map<string, int> cnt;
    while (s != e) {
        auto p = find(s, e, '+');
        auto temp = parseFormulaEx(s, p);
        for (const auto& ele: temp) cnt[ele.first] += ele.second;
        if (p != e) ++p; // 跳过'+'
        s = p;
    }
    //for (const auto& ele: cnt) cout << ele.first << "\t" << ele.second << endl; cout << endl;
    return cnt;
}

bool isValid(string& equation) {
    auto eq = find(equation.begin(), equation.end(), '=');
    auto left = parseExpr(equation.begin(), eq);
    auto right = parseExpr(eq + 1, equation.end());
    if (left.size() != right.size()) return false;
    for (const auto& ele: left) {
        if (!right.count(ele.first) || right[ele.first] != ele.second) return false;
    }
    return true;
}

int main() {
    int n;
    cin >> n;
    string equation;
    while (n--) {
        cin >> equation;
        cout << (isValid(equation) ? "Y" : "N") << endl;
    }
    return 0;
}