200D - Programming Language - CodeForces Solution

#include<iostream>
#include<map>
#include<string>
#include<vector>

using namespace std;

int main() {
    int n;
    cin >> n;
    map<string, vector<vector<char>>> f;
    for(int i = 0; i < n; i++) {
        string s; // function name
        cin >> s; // read "void"
        s.clear();
        for (char c; cin.get(c);) {
            if (c == ' ')
                continue; // spaces is not a part of the name
            else if (c == '(')
                break;
            else
                s.push_back(c);
        }

        vector<char> a;
        string t;
        for (char c; cin.get(c);) {
            if (c == ' ')
                continue;
            else if (c == ')') {
                a.push_back(t[0]);
                break;
            }
            else if (c == ',') {
                a.push_back(t[0]);
                t.clear();
            }
            else
                t.push_back(c);
        }
        
        f[s].push_back(a);
    }

    int m;
    cin >> m;
    map<string, char> v;
    for(int i = 0; i < m; i++) {
        string t, s;
        cin >> t >> s;
        v[s] = t[0];
    }

    int k;
    cin >> k;
    for(int i = 0; i < k; i++) {
        string s;
        for (char c; cin.get(c);) {
            if (c == ' ')
                continue;
            if(c == '\n')
                continue; // line reading ends at ')' so line break become unread
            else if (c == '(')
                break;
            else
                s.push_back(c);
        }

        vector<char> a;
        string t;
        for (char c; cin.get(c);) {
            if (c == ' ')
                continue;
            else if (c == ')') {
                a.push_back(v[t]);
                break;
            }
            else if (c == ',') {
                a.push_back(v[t]);
                t.clear();
            }
            else
                t.push_back(c);
        }

        int c = 0; // number of suitable functions
        for (auto t : f[s]) {
            if (t.size() != a.size())
                continue;

            for (int j = 0; j < a.size(); j++) {
                if (t[j] != 'T' && t[j] != a[j])
                    goto next;
            }
            c++;
        next:;
        }

        cout << c << endl;
    }
}/*1691106019.359995*/