In this problem, you are initially given an empty multiset. You have to process two types of queries:
The first line contains one integer $$$m$$$ ($$$1 \le m \le 10^5$$$) — the number of queries.
Then $$$m$$$ lines follow, each of which contains two integers $$$t_i$$$, $$$v_i$$$, denoting the $$$i$$$-th query. If $$$t_i = 1$$$, then the $$$i$$$-th query is ADD $$$v_i$$$ ($$$0 \le v_i \le 29$$$). If $$$t_i = 2$$$, then the $$$i$$$-th query is GET $$$v_i$$$ ($$$0 \le v_i \le 10^9$$$).
For each GET query, print YES if it is possible to choose a subset with sum equal to $$$w$$$, or NO if it is impossible.
51 01 01 02 32 4
YES NO
71 01 11 21 102 42 62 7
YES YES YES
Name |
---|