Editorial for LCC '25 Contest 1 J2 - Threatening Treats

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Emera1d

Problem Statement Simplified

Johnny starts K health points. He eats N candies, information is given in N lines. Each line is either

  • BOOST X, which increases Johnnys HP by integer X,
  • DAMAGE X, which decreases Johnnys HP by integer X.

Solution

To find whether Johnny survives the night, create a loop to read and update Johnnys health continuously. If within an iteration, you detect Johnnys health to fall to or under 0, exit the loop. Then output the final statement.

Time Complexity: O(N)

Java Solution

import java.util.*;

public class Main {
  public static void main(String[] args) {

    Scanner s = new Scanner(System.in);

    // Reading # of candies
    int N = s.nextInt();
    // Reading the initial health point of Johnny
    int K = s.nextInt();
    // Setting Johnny's health point
    int HP = K;

    // Looping through candies consumed
    for (int i = 0; i < N; i++){
      // Reading whether the candy boosts or harms
      String candy = s.next();
      // Reading X factor
      int X = s.nextInt();

      // Adjusting Johnny's health accordingly
      if (candy.equals("BOOST")){
        HP += X;
      } else {
        HP -= X;
      }

      // Exit loop if Johnny has passed
      if (HP <= 0){
        break;
      }

    }
    // Print conclusion
    if (HP <= 0){
      System.out.println("Johnny is cooked!"); 
    } else {
      System.out.println("Johnny will return next year!"); 
    }
  }
}

Comments

There are no comments at the moment.