Reviewing a round

Questions 1 to 5 of 8

1. 1. Round 2 has five problems and 100 minutes. What budget does the lesson give each problem, and what should you do when that budget ends without an accepted submission?

   10 minutes each, then submit whatever you have20 minutes each, then keep going until the solution is accepted20 minutes each, then write one line about what you tried and move on25 minutes each, then ask a teammate for the idea
2. 2. Which two statements are part of the round 2 skip rule?

   Pick every answer that is true.

   Submit the first idea you have, so the judge can show you the mistakeIf you have no new idea for 10 minutes, write one line about what you tried and move to the next problemIf a problem has already taken 40 minutes, keep going because you have invested so much timeCome back to a skipped problem only after the other four are accepted or skipped, and only if time is left
3. 3. In the two pointers example with the sorted values 1 2 4 6 and the limit S = 7, how many pairs of positions i < j have a[i] + a[j] <= 7?

   Type a number.

4. 4. Put these checks in the order the round 2 checklist gives before a submission.

   Use the arrows to put the steps in order.

   1. 1.Run the stress test against the brute force on 300 random small inputs↑↓
   2. 2.Count the steps for the largest input and look for an O(n^2) loop↑↓
   3. 3.Submit the solution↑↓
   4. 4.Compile with g++ -std=c++17 -O2 and run the sample↑↓
5. 5. Match each term from the lesson to its meaning.

   Choose the matching item for each row.

   O(n^2) trapChoose…runs your solution and a brute force on many random small inputs and compares the outputsthe number of minutes you allow yourself on one problemwhat you do when the budget for a problem ends without an accepted submissiona loop that passes the sample but takes about n times n steps, too slow for n = 200000Stress testChoose…runs your solution and a brute force on many random small inputs and compares the outputsthe number of minutes you allow yourself on one problemwhat you do when the budget for a problem ends without an accepted submissiona loop that passes the sample but takes about n times n steps, too slow for n = 200000Skip ruleChoose…runs your solution and a brute force on many random small inputs and compares the outputsthe number of minutes you allow yourself on one problemwhat you do when the budget for a problem ends without an accepted submissiona loop that passes the sample but takes about n times n steps, too slow for n = 200000BudgetChoose…runs your solution and a brute force on many random small inputs and compares the outputsthe number of minutes you allow yourself on one problemwhat you do when the budget for a problem ends without an accepted submissiona loop that passes the sample but takes about n times n steps, too slow for n = 200000