CF1829C.Mr. Perfectly Fine
入门
通过率:0%
时间限制:2.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Victor wants to become "Mr. Perfectly Fine". For that, he needs to acquire a certain set of skills. More precisely, he has 2 skills he needs to acquire.
Victor has n books. Reading book i takes him mi minutes and will give him some (possibly none) of the required two skills, represented by a binary string of length 2.
What is the minimum amount of time required so that Victor acquires all of the two skills?
Victor 想成为“完美先生”。为此,他需要掌握一套特定的技能。更准确地说,他需要掌握 2 种技能。
Victor 有 n 本书。阅读第 i 本书需要 mi 分钟,并会赋予他其中一些(可能为零)所需技能,用一个长度为 2 的二进制字符串表示。
Victor 掌握全部两种技能所需的最短时间是多少?
输入格式
The input consists of multiple test cases. The first line contains an integer t (1≤t≤1000) — the number of test cases. The description of the test cases follows.
The first line of each test case contains an integer n (1≤n≤2⋅105) — the number of books available.
Then n lines follow. Line i contains a positive integer mi (1≤mi≤2⋅105) and a binary string of length 2, where si1=1 if reading book i acquires Victor skill 1, and si1=0 otherwise, and si2=1 if reading book i acquires Victor skill 2, and si2=0 otherwise.
It is guaranteed that the sum of n over all test cases doesn't exceed 2⋅105.
输入包含多个测试用例。第一行包含一个整数 t(1≤t≤1000),表示测试用例的数量。随后是各测试用例的描述。
每个测试用例的第一行包含一个整数 n(1≤n≤2⋅105),表示可供阅读的书籍数量。
接下来是 n 行。第 i 行包含一个正整数 mi(1≤mi≤2⋅105)和一个长度为 2 的二进制字符串,其中:若阅读第 i 本书能使 Victor 获得技能 1,则 si1=1,否则 si1=0;若阅读第 i 本书能使 Victor 获得技能 2,则 si2=1,否则 si2=0。
保证所有测试用例的 n 值之和不超过 2⋅105。
输出格式
For each test case, output a single integer denoting the minimum amount of minutes required for Victor to obtain both needed skills and −1 in case it's impossible to obtain the two skills after reading any amount of books.
对于每个测试用例,输出一个整数,表示 Victor 获得两项所需技能所需的最少分钟数;若无论阅读多少本书都无法获得这两项技能,则输出 −1。
输入输出样例
输入#1
6 4 2 00 3 10 4 01 4 00 5 3 01 3 01 5 01 2 10 9 10 1 5 11 3 9 11 8 01 7 10 6 4 01 6 01 7 01 8 00 9 01 1 00 4 8 00 9 10 9 11 8 11
输出#1
7 5 5 9 -1 8
说明/提示
In the first test case, we can use books 2 and 3, with a total amount of minutes spent equal to 3+4=7.
In the second test case, we can use the books 1 and 4, with a total amount of minutes spent equal to 3+2=5.
In the third test case, we have only one option and that is reading book 1 for a total amount of minutes spent equal to 5.
在第一个测试用例中,我们可以使用第 2 本和第 3 本书,总共花费的时间为 3+4=7 分钟。
在第二个测试用例中,我们可以使用第 1 本和第 4 本书,总共花费的时间为 3+2=5 分钟。
在第三个测试用例中,我们只有一种选择,即阅读第 1 本书,总共花费的时间为 5 分钟。
输入解题思路,AI测评打分。不知道怎么写?