-
Notifications
You must be signed in to change notification settings - Fork 46
/
attributeparser.cpp
76 lines (76 loc) · 1.58 KB
/
attributeparser.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, q,i;
cin>>n>>q;
string temp;
vector<string> hrml;
vector<string> quer;
cin.ignore();
for(i=0;i<n;i++)
{
getline(cin,temp);
hrml.push_back(temp);
}
for(i=0;i<q;i++)
{
getline(cin,temp);
quer.push_back(temp);
}
map<string, string> m;
vector<string> tag;
for(i=0;i<n;i++)
{
temp=hrml[i];
temp.erase(remove(temp.begin(), temp.end(), '\"' ),temp.end());
temp.erase(remove(temp.begin(), temp.end(), '>' ),temp.end());
if(temp.substr(0,2)=="</")
{
tag.pop_back();
}
else
{
stringstream ss;
ss.str("");
ss<<temp;
string t1,p1,v1;
char ch;
ss>>ch>>t1>>p1>>ch>>v1;
string temp1="";
if(tag.size()>0)
{
temp1=*tag.rbegin();
temp1=temp1+"."+t1;
}
else
{
temp1=t1;
}
tag.push_back(temp1);
m[*tag.rbegin()+"~"+p1]=v1;
while(ss)
{
ss>>p1>>ch>>v1;
m[*tag.rbegin()+"~"+p1]=v1;
}
}
}
for(i=0;i<q;i++)
{
if (m.find(quer[i]) == m.end())
{
cout << "Not Found!\n";
}
else
{
cout<<m[quer[i]]<<endl;
}
}
return 0;
}