Tutte le sfide
Media 0 risolte 0% di accettazione

Bank Queue Simulation

Simulate customers waiting in one line for several bank tellers and report the waiting times.

Cosa imparerai

  • Serve customers in first-come, first-served order
  • Track when each server becomes free
  • Collect summary statistics from a simulation

Problema

Mostra traduzione

A bank has tellers tellers and a single waiting line. Customer i arrives at minute arrivals[i] and needs service[i] minutes at a teller. Customers are served strictly in arrival order (the order of the lists). When a customer reaches the front of the line, they go to the teller who becomes free the earliest (the lowest numbered one on a tie), and start at the later of their arrival time and that teller's free time. A teller is free from minute 0.

A customer's wait is their start time minus their arrival time.

Implement bank_queue_simulation(arrivals, service, tellers).

Input

arrivals: Arrival minutes in non-decreasing order.

service: Service minutes for each customer, in the same order.

tellers: The number of tellers.

Output

Return [total_wait, longest_wait, last_finish]: the sum of all waits, the largest single wait, and the minute the last customer finishes. With no customers return [0, 0, 0].

Vincoli

0 ≤ number of customers ≤ 2,000

0 ≤ arrival ≤ 100,000

1 ≤ service ≤ 1,000

1 ≤ tellers ≤ 20

Esempi

Esempio 1
Input:
arrivals = [0, 1, 2, 3]
service = [5, 3, 4, 2]
tellers = 2

Output atteso:
expected = [4, 2, 8]
Input:
std::vector<long long> arrivals = {0, 1, 2, 3};
std::vector<long long> service = {5, 3, 4, 2};
long long tellers = 2;

Output atteso:
std::vector<long long> expected = {4, 2, 8};
Input:
long[] arrivals = new long[] {0, 1, 2, 3};
long[] service = new long[] {5, 3, 4, 2};
long tellers = 2;

Output atteso:
long[] expected = new long[] {4, 2, 8};

Spiegazione

Customers 1 and 2 start at once (0 and 1). Teller 2 frees at 4, so customer 3 waits 2; teller 1 frees at 5, so customer 4 waits 2. Last finish is max(8, 7) = 8: [4, 2, 8].

Esempio 2
Input:
arrivals = [0, 0, 0]
service = [4, 4, 4]
tellers = 1

Output atteso:
expected = [12, 8, 12]
Input:
std::vector<long long> arrivals = {0, 0, 0};
std::vector<long long> service = {4, 4, 4};
long long tellers = 1;

Output atteso:
std::vector<long long> expected = {12, 8, 12};
Input:
long[] arrivals = new long[] {0, 0, 0};
long[] service = new long[] {4, 4, 4};
long tellers = 1;

Output atteso:
long[] expected = new long[] {12, 8, 12};

Spiegazione

With one teller the waits are 0, 4 and 8, and the last customer finishes at 12: [12, 8, 12].

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

Keep an array with the minute each teller becomes free.

Suggerimento 2

For each customer pick the smallest free time (lowest index on a tie).

Suggerimento 3

Start time is the later of arrival and that free time; the wait is start minus arrival.

Complessità attesa

O(n × k) time, O(k) extra space

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.