Determine reachability and optimize task scheduling
Overview
This question evaluates understanding of discrete reachability and resource-constrained scheduling, testing the ability to reason about iterative coordinate transformations and to optimize parallel task assignment under type and memory limits.
Question
LeetCode 780. Reaching Points: Given four integers a, b, c, d (1 <= a, b, c, d <= 1000). Starting from (a, b) you may repeatedly apply either operation (x, y) → (x + y, y) or (x, y) → (x, x + y). Determine whether you can reach exactly (c, d). Return True or False. Given an array taskMemory of n positive integers (memory per task), an array taskType of n positive integers (task type), and an integer maxMemory. Each task takes 1 unit of time. The server can process at most two tasks in parallel only if they are the same type and together require no more than maxMemory units. Find the minimum total time required to process all tasks.