BUREAU - Bureaucracy
Long ago, in a kingdom far, far away the king decided to keep a record of all laws of his kingdom. From that moment whenever a new law was passed, a corresponding record was added to the law archive.
Many centuries later lawyers discovered that there were only two types of laws in the kingdom:
- direct law, that states a new norm;
- canceling law, that cancels one of the previous laws.
The law is considered active if and only if there is no active law that cancels it.
You are to write program that finds out which laws are still active.
The first line of the input contains T, the number of test cases. T test cases follow.
The first line of each test case contains an integer number n (1 <= n <= 100000) - the number of passed laws.
The following n lines describe one law each. Each description has one of the following formats:
- "declare", meaning that a direct law was passed.
- "cancel i", where i is the number of law being cancelled by this one.
The laws are numbered from one.
For each test case your output must contain a line with the number of active laws. The following line must contain numbers of these laws listed in increasing order.
Input: 1 5 declare cancel 1 declare cancel 2 cancel 3 Output: 3 1 4 5
Any tricky case plz....my code gives perfect o/p but still wa.... :(
cin gives tle . Use scanf :D
cin cout ...
Last edit: 2014-08-21 19:16:36
just print and count => AC nothing new
STL is perfectly fine... just be careful with that particular function, check reserve for vector.Last edit: 2013-02-03 03:35:57
Use scanf + avoid STL functions like push_back() .. will be easy to do then :D
piece of cake.....:)
can any give me ans of this sol as i m not getting problem statement
Note that the following is possible