Attribute Parser C++
Problem Statement :
This challenge works with a custom-designed markup language HRML. In HRML, each element consists of a starting and ending tag, and there are attributes associated with each tag. Only starting tags can have attributes. We can call an attribute by referencing the tag, followed by a tilde, '~' and the name of the attribute. The tags may also be nested. The opening tags follow the format: <tag-name attribute1-name = "value1" attribute2-name = "value2" ...> The closing tags follow the format: </tag-name> The attributes are referenced as: tag1~value tag1.tag2~name Given the source code in HRML format consisting of N lines, answer Q queries. For each query, print the value of the attribute specified. Print "Not Found!" if the attribute does not exist. Example HRML listing <tag1 value = "value"> <tag2 name = "name"> <tag3 another="another" final="final"> </tag3> </tag2> </tag1> Queries tag1~value tag1.tag2.tag3~name tag1.tag2~value Here, tag2 is nested within tag1, so attributes of tag2 are accessed as tag1.tag2~<attribute>. Results of the queries are: Query Value tag1~value "value" tag1.tag2.tag3~name "Not Found!" tag1.tag2.tag3~final "final" Input Format The first line consists of two space separated integers, N and Q. N specifies the number of lines in the HRML source program. Q specifies the number of queries. The following N lines consist of either an opening tag with zero or more attributes or a closing tag. There is a space after the tag-name, attribute-name, '=' and value.There is no space after the last value. If there are no attributes there is no space after tag name. Constraints 1 <= N <= 20 1 <= Q <= 20 Each line in the source program contains, at most, 200 characters. Every reference to the attributes in the Q queries contains at most 200 characters. All tag names are unique and the HRML source program is logically correct, i.e. valid nesting. A tag can may have no attributes. Output Format Print the value of the attribute for each query. Print "Not Found!" without quotes if the attribute does not exist.
Solution :
Solution in C :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
vector<string> tag_stack;
map<string, string> attrs;
void insert_attr(string & name, string & val) {
string full;
for(string & str : tag_stack)
full += str + ".";
full.pop_back();
full += "~" + name;
attrs[full] = val;
}
int main() {
int n, q;
cin >> n >> q;
for(int i = 0; i < n; ++i) {
char c; cin >> c;
if(cin.peek() == '/') { // close
string cn; cin >> cn;
tag_stack.pop_back();
}
else { //open'
string name;
cin >> name;
if(name.back() == '>') { //no attrs
name.pop_back();
tag_stack.push_back(name);
}
else {
tag_stack.push_back(name);
for(;;) {
string attr_name, attr_val, eq;
cin >> attr_name >> eq >> attr_val;
if(attr_val.back() == '>') { //last attr
attr_val.pop_back();
attr_val.pop_back();
attr_val = attr_val.substr(1);
insert_attr(attr_name, attr_val);
break;
}
else {
attr_val.pop_back();
attr_val = attr_val.substr(1);
insert_attr(attr_name, attr_val);
}
}
}
}
}
for(int i = 0; i < q; ++i) {
string quer;
cin >> quer;
if(attrs.find(quer) != attrs.end())
cout << attrs[quer] << endl;
else
cout << "Not Found!" << endl;
}
return 0;
}
View More Similar Problems
Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →Kitty's Calculations on a Tree
Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a
View Solution →Is This a Binary Search Tree?
For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a
View Solution →Square-Ten Tree
The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the
View Solution →Balanced Forest
Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a
View Solution →Jenny's Subtrees
Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .
View Solution →