मध्यम 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

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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

हर कोडर का सबसे अच्छा पास हुआ समाधान। तेज़, कम मेमोरी वाले और बेहतर रेटिंग वाले समाधान ऊपर रहते हैं।

अभी कोई पास हुआ समाधान नहीं है। इसे हल करें और पहला स्थान पाएँ।

दूसरों से सीखें

समुदाय समाधान

अभी तक कोई प्रकाशित समाधान नहीं। पहला साझा करने के लिए इस चुनौती को हल करें।