Contest.uni-smr.ac.ru :: соревнования по программированию
Русская версия || English version
Login:
Password:
Забыли пароль?
 пример поиска: Вася Пупкин
 






Задача А для тренировки в сентябре

Первоисточник: ACM ICPC 2009 -2010, NEERC, Northern Subregional Contest St Petersburg, October 17, 2009

Задачу добавил: elena

Успешно сдано решений: 8

Problem B. Bureaucracy

Time limit: 3 seconds
Memory limit: 256 megabytes

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.

Input
The first line of the input file contains an integer number n (1 <= n <= 100 000) - 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.

Output
The first line of the output file must contain the number of active laws. Following lines must contain numbers of these laws listed in increasing order.

Example

input.txt
5
declare
cancel 1
declare
cancel 2
cancel 3

output.txt
3
1 4 5

Сдать задачу

Задать вопрос жюри по этой задаче