中級 0件解決済み 正答率0%

Bank Queue Simulation

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

このチャレンジで学べること

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

問題

翻訳を表示

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].

制約

0 ≤ number of customers ≤ 2,000

0 ≤ arrival ≤ 100,000

1 ≤ service ≤ 1,000

1 ≤ tellers ≤ 20

例

例 1
入力:
arrivals = [0, 1, 2, 3]
service = [5, 3, 4, 2]
tellers = 2

期待される出力:
expected = [4, 2, 8]
入力:
std::vector<long long> arrivals = {0, 1, 2, 3};
std::vector<long long> service = {5, 3, 4, 2};
long long tellers = 2;

期待される出力:
std::vector<long long> expected = {4, 2, 8};
入力:
long[] arrivals = new long[] {0, 1, 2, 3};
long[] service = new long[] {5, 3, 4, 2};
long tellers = 2;

期待される出力:
long[] expected = new long[] {4, 2, 8};

解説

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].

例 2
入力:
arrivals = [0, 0, 0]
service = [4, 4, 4]
tellers = 1

期待される出力:
expected = [12, 8, 12]
入力:
std::vector<long long> arrivals = {0, 0, 0};
std::vector<long long> service = {4, 4, 4};
long long tellers = 1;

期待される出力:
std::vector<long long> expected = {12, 8, 12};
入力:
long[] arrivals = new long[] {0, 0, 0};
long[] service = new long[] {4, 4, 4};
long tellers = 1;

期待される出力:
long[] expected = new long[] {12, 8, 12};

解説

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

解き方のヒント

まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。

ヒント 1

Keep an array with the minute each teller becomes free.

ヒント 2

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

ヒント 3

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

目安の計算量

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

参考資料

この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。

ランキング

全体ランキング

コーダーごとのいちばん良い合格解答です。速く、メモリが少なく、評価が高い解答ほど上位になります。

まだ合格した解答はありません。解いて 1 位になりましょう。

他の人の解答から学ぶ

コミュニティの解答

まだ公開された解答がありません。この課題を解いて最初の解答を共有しましょう。