Reading order and time budgets

Questions 1 to 5 of 8

1. 1. A competitor starts coding the first problem they read and spends 90 minutes on it. What does the opening scan do differently?

   It makes you code the easiest-looking problem first, which always scores the most pointsIt takes 10 to 15 minutes to read every statement, tag each problem and write an attack order before any codingIt asks you to solve each problem in full before you read the next oneIt replaces the time budget, so no budget is needed once the scan is done
2. 2. The contest lasts 200 minutes and the reserve is 20 minutes. Six problems are 2 easy (weight 1), 2 medium (weight 2) and 2 hard (weight 3). What is the budget for one hard problem, in minutes?

   Type a number.

3. 3. At minute 20 one problem has 10 solves and another has zero. Which reading is right?

   Zero solves at minute 20 proves the problem is the hardest in the setTen solves at minute 20 means that problem will end with the most solvesThe counts so far mostly show the fastest competitors' choices, so use them only as a weak tie-breakerMove the problem with the highest count to the top of your attack order
4. 4. You solve a problem at minute 90 after three wrong submissions. Under standard ICPC-style penalty rules, how many penalty minutes does this problem add?

   150 minutes120 minutes90 minutes180 minutes
5. 5. Which thoughts are signs of sunk-cost bias during a contest?

   Pick every answer that is true.

   I have put 50 minutes into this problem, so I cannot waste that timeCompare the points per future minute of each problem and pick the higher rateI will try one more idea here, because leaving now makes the first 50 minutes look wastedIf I started this problem fresh now with this time left, would I still choose it?