Sliding Token-Budget Admission

Problem

Apply an exact sliding-window token admission budget. arrivals is an ordered list of [timestamp,cost]. For an arrival at time t, expire previously accepted costs with timestamp ≤ t−window, then accept if the sum still active plus cost is ≤ budget. Rejected costs are never added.

Return one boolean per arrival. Equal timestamps are processed in input order. The active interval is (t−window,t], so costs exactly on the left boundary have expired.

def sliding_token_admission(budget, window, arrivals):

Constraints

• 0 ≤ budget ≤128; window is a positive finite number.
• 0..64 arrivals with finite nondecreasing timestamps and nonnegative integer costs ≤128.
• Inputs satisfy these constraints; invalid-input handling is not graded. Use only Python standard library and NumPy.

Examples

Arguments: [
  5,
  10,
  [
    [
      0,
      3
    ],
    [
      1,
      3
    ],
    [
      10,
      3
    ]
  ]
]
Expected result: [
  true,
  false,
  true
]

Arguments: [
  5,
  10,
  [
    [
      0,
      2
    ],
    [
      0,
      3
    ],
    [
      0,
      1
    ]
  ]
]
Expected result: [
  true,
  true,
  false
]