CheatingQuiz
SRM 526 · 2011-05-25 · by fushar
SRM 526 · 2011-05-25 · by fushar · Simulation
Problem Statement
Problem Statement
Mr. Dengklek is taking part in an online quiz. The quiz consists of N multiple-choice questions, conveniently numbered 0 through N-1. For each question there are three possible answers labeled A, B, and C. For each question, exactly one of the three possible answers is correct. You are given the information on correct answers as a String answers. More precisely, answers[i] is the correct answer to the i-th question. This is of course unknown to Mr. Dengklek.
Mr. Dengklek did not know the answer to any of the quiz questions. Being desperate, he hacked the website of the quiz. However, the only thing he could obtain was aggregate information on the answers that will be used. More precisely, thanks to the hack Mr. Dengklek now knows how many questions have the answer A, how many have the answer B, and how many have the answer C.
When taking the quiz, Mr. Dengklek will be given the questions one at a time, in the same order that is used in answers. For each of the questions, he will use his intuition to pick one of the answers that are still possible. After he picks the answer for a question, the quiz will always show him the correct answer for that question.
Mr. Dengklek has noticed that sometimes he can rule out some of the answers when answering a question. Your method must return aint[] containing N elements. The i-th element in this int[] must be the number of options Mr. Dengklek will choose from when answering the i-th question.
Mr. Dengklek did not know the answer to any of the quiz questions. Being desperate, he hacked the website of the quiz. However, the only thing he could obtain was aggregate information on the answers that will be used. More precisely, thanks to the hack Mr. Dengklek now knows how many questions have the answer A, how many have the answer B, and how many have the answer C.
When taking the quiz, Mr. Dengklek will be given the questions one at a time, in the same order that is used in answers. For each of the questions, he will use his intuition to pick one of the answers that are still possible. After he picks the answer for a question, the quiz will always show him the correct answer for that question.
Mr. Dengklek has noticed that sometimes he can rule out some of the answers when answering a question. Your method must return a
Constraints
- answers will contain between 1 and 50 characters, inclusive.
- Each character of answers will be 'A', 'B', or 'C'.
Examples
0)
"AAAAA"
Returns: {1, 1, 1, 1, 1 }
Mr. Dengklek knows that A is the correct answer to all questions. Therefore, for each question, he only has one choice: answering A.
1)
"AAABBB"
Returns: {2, 2, 2, 1, 1, 1 }
Mr. Dengklek knows that there will be three As and three Bs. For each of the first three questions he has two choices: answering A or B. After answering the third question, he will discover that all As have been used, so for each of the remaining questions he only has one choice: answering B.
2)
"CAAAAAC"
Returns: {2, 2, 2, 2, 2, 2, 1 }
3)
"BBCA"
Returns: {3, 3, 2, 1 }
4)
"BACACABCBBBBCAAAAACCCABBCAA"
Returns: {3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1 }
Submissions are judged against all 66 archived test cases, of which 5 are shown here. Case numbers match the judge’s.
Coding Area
Language: C++17 · define a public class CheatingQuiz with a public method vector<int> howMany(string answers) · 66 test cases · 2 s / 256 MB per case