模拟题,很简单的思路,按层次存起来然后查询,写的挺乱不精简,但也100分了
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
struct quan
{
string name;
int lv;
quan(int b,string c)
{
lv=b;
name=c;
}
};
struct jue
{
string name;
vector<quan> q;
};
struct user
{
string name;
vector<string> q;
};
map<string,jue> mj;
map<string,user> mu;
int p,r,u,q;
int main()
{
string s;
int t;
scanf("%d",&p);
for(int i=0;i<p;i++)
cin>>s;
scanf("%d",&r);
for(int i=0;i<r;i++)
{
cin>>s;
jue x;
x.name=s;
scanf("%d",&t);
string s0;
for(int j=0;j<t;j++)
{
cin>>s0;
int v=-1;
int l=s0.length();
if(s0[l-1]>='