#4915. Good Set Query
Good Set Query
Good Set Query
题目描述
You are given triples of integers $(a_1, b_1, d_1), (a_2, b_2, d_2), \ldots, (a_Q, b_Q, d_Q)$. A subset of the set is defined to be a good set if there exists an integer sequence of length that satisfies:
$X_{a_i} - X_{b_i} = d_i$ for all $i \in S$.Starting with $S$ as an empty set, perform the following operation for $i = 1, 2, \ldots, Q$ in this order:
If $S \cup \lbrace i \rbrace$ is a good set, then replace $S$ with $S \cup \lbrace i \rbrace$.Print all elements of the final set $S$ in ascending order.
输入格式
The input is given from Standard Input in the following format:
输出格式
Print the sequence of all elements of the final set in ascending order, separated by spaces, in the following format:
3 5
1 2 2
3 2 -3
2 1 -1
3 3 0
1 3 5
1 2 4 5
200000 1
1 1 1
1 2 3 6 8 9 11 14 15 16 17 19
提示
All input values are integers. Starting with as an empty set, perform the operation described in the problem statement for in this order, as follows.
For , the set is a good set, because satisfies the condition in the problem statement, for example, so replace with . For , the set is a good set, because satisfies the condition in the problem statement, for example, so replace with . For , the set is not a good set. For , the set is a good set, because satisfies the condition in the problem statement, for example, so replace with . For , the set $S \cup \lbrace i \rbrace = \lbrace 1, 2, 4, 5 \rbrace$ is a good set, because satisfies the condition in the problem statement, for example, so replace with .
Therefore, the final set is .
The final set is empty.
标签: AtCoder|abc328F
来源
AtCoder|abc328F