Squirrel Research

Problem Statement

Squirrel Research Problem Description Researchers are studying squirrels that hide nuts in a forest and later come back to collect them. Build a tracker, the class SquirrelResearch , that simulates this behaviour. The tracker is created with a set of hiding locations and then processes a sequence of actions: a squirrel hides a nut, or a squirrel retrieves nuts. General rules: If any constraint of an operation is violated, that operation fails and changes nothing. A constraint marked guaranteed is never violated by the input. Every action carries a timestamp: seconds since the Unix epoch, given with at most 3 digits after the decimal point (millisecond precision). Timestamps are guaranteed to be positive, below 2^32 , and strictly increasing from one action to the next. Weights are in grams, given with at most 3 digits after the decimal point (milligram precision). Hiding locations Every location is shaped like a cone and is made of storage levels. The deepest level holds 1 nut, and the