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
Polynomial Division
Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie
View Solution →Costly Intervals
Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the
View Solution →The Strange Function
One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting
View Solution →Self-Driving Bus
Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever
View Solution →Unique Colors
You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti
View Solution →Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →