Recently, Valery have come across an entirely new programming language. Most of all the language attracted him with template functions and procedures. Let us remind you that templates are tools of a language, designed to encode generic algorithms, without reference to some parameters (e.g., data types, buffer sizes, default values).
Valery decided to examine template procedures in this language in more detail. The description of a template procedure consists of the procedure name and the list of its parameter types. The generic type T parameters can be used as parameters of template procedures.
A procedure call consists of a procedure name and a list of variable parameters. Let's call a procedure suitable for this call if the following conditions are fulfilled:
- its name equals to the name of the called procedure;
- the number of its parameters equals to the number of parameters of the procedure call;
- the types of variables in the procedure call match the corresponding types of its parameters. The variable type matches the type of a parameter if the parameter has a generic type T or the type of the variable and the parameter are the same.
You are given a description of some set of template procedures. You are also given a list of variables used in the program, as well as direct procedure calls that use the described variables. For each call you need to count the number of procedures that are suitable for this call.
Input
The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of template procedures. The next n lines contain the description of the procedures specified in the following format:
"void procedureName (type_1, type_2, ..., type_t)" (1 ≤ t ≤ 5), where void is the keyword, procedureName is the procedure name, type_i is the type of the next parameter. Types of language parameters can be "int", "string", "double", and the keyword "T", which denotes the generic type.
The next line contains a single integer m (1 ≤ m ≤ 1000) — the number of used variables. Next m lines specify the description of the variables in the following format:
"type variableName", where type is the type of variable that can take values "int", "string", "double", variableName — the name of the variable.
The next line contains a single integer k (1 ≤ k ≤ 1000) — the number of procedure calls. Next k lines specify the procedure calls in the following format:
"procedureName (var_1, var_2, ..., var_t)" (1 ≤ t ≤ 5), where procedureName is the name of the procedure, var_i is the name of a variable.
The lines describing the variables, template procedures and their calls may contain spaces at the beginning of the line and at the end of the line, before and after the brackets and commas. Spaces may be before and after keyword void. The length of each input line does not exceed 100 characters. The names of variables and procedures are non-empty strings of lowercase English letters and numbers with lengths of not more than 10 characters. Note that this is the only condition at the names. Only the specified variables are used in procedure calls. The names of the variables are distinct. No two procedures are the same. Two procedures are the same, if they have identical names and identical ordered sets of types of their parameters.
OutputOn each of k lines print a single number, where the i-th number stands for the number of suitable template procedures for the i-th call.
Examples4
void f(int,T)
void f(T, T)
void foo123 ( int, double, string,string )
void p(T,double)
3
int a
string s
double x123
5
f(a, a)
f(s,a )
foo (a,s,s)
f ( s ,x123)
proc(a)
2
1
0
1
0
6
void f(string,double,int)
void f(int)
void f ( T )
void procedure(int,double)
void f (T, double,int)
void f(string, T,T)
4
int a
int x
string t
double val
5
f(t, a, a)
f(t,val,a)
f(val,a, val)
solve300(val, val)
f (x)
1
3
0
0
2
OJ-ID：
CodeForces-200D
author：
Caution_X
date of submission：
20191029
tags：
字符串匹配
description modelling：
输入n个函数模型
输入m个变量
输入k个函数
问：输入的k个函数有几个符合函数模型
major steps to solve it：
用结构体存函数的函数名和变量，然后暴力匹配
warnings：
一道阅读题，题目看起来十分吓人，实际上只是个字符串匹配问题
AC code:
#include <iostream> #include <cstring> #include <cstdio> #include <algorithm> #include <map> #include <string> #define rep(i, j, k) for(int i = j; i <= k; i++) #define maxn 1000009 #define ll long long using namespace std; int n, m, k; map <string, string> mp; struct cadongllas { int num; string var[7]; string name; }ask[1009], funk[1009]; bool equal (cadongllas x, cadongllas y) { if (x.num != y.num) return 0; if (x.name != y.name) return 0; rep (i, 1, x.num) if (x.var[i] != y.var[i] && x.var[i] != "T") return 0; return 1; } int main () { cin >> n; rep (i, 1, n) { char blank[1009]; scanf ("%s", blank); //if (blank[strlen (blank) - 1] == '(') blank[ strlen (blank) - 1] = 0; ask[i].name = string (blank); cout << ask[i].name << endl; while (1) { char ch = getchar (); if (ch == '(') break; if (ch != ' ') ask[i].name += ch; } //cout << ask[i].name << endl; string s; getline (cin, s); int len = s.length (); int now = 0; while (1) { while ((s[now] == ')' || s[now] == ',' || s[now] == ' ' ) && now < len) now++; if (now >= len) break; string nex; while (1) { nex += s[now++]; if (s[now] == ')' || s[now] == ',' || s[now] == ' ' || now >= len) break; } ask[i].var[ ++ ask[i].num] = nex; //cout << "----" << nex << endl; if (s[now] == ')') break; } } //rep (i, 1, n) { printf ("%d %d\n", i, ask[i].num); rep (j, 1, ask[i].num) cout << ask[i].var[j] << endl; } cin >> m; rep (i, 1, m) { string sa, sb; cin >> sa >> sb; mp[sb] = sa; } cin >> k; getchar (); rep (i, 1, k) { while (1) { char ch = getchar (); if (ch == '(') break; if (ch != ' ') funk[i].name += ch; } //cout << "name" << funk[i].name << endl; string s; getline (cin, s); int len = s.length (), now = 0; while (1) { while ((s[now] == ')' || s[now] == ',' || s[now] == ' ' ) && now < len) now++; if (now >= len) break; string nex; while (1) { nex += s[now++]; if (s[now] == ')' || s[now] == ',' || s[now] == ' ' || now >= len) break; } funk[i].var[ ++ funk[i].num] = mp[nex]; //cout << "----" << nex << endl; if (s[now] == ')') break; } //rep (p, 1, funk[i].num) cout << "===" << funk[i].var[p] << "===" << endl; int ans = 0; rep (j, 1, n) if (equal (ask[j], funk[i])) ans++; cout << ans << endl; } return 0; }