모든 챌린지
보통 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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.

코더마다 가장 좋은 통과 풀이입니다. 더 빠르고, 메모리를 덜 쓰고, 평가가 좋은 풀이가 위에 옵니다.

아직 통과한 풀이가 없습니다. 풀어서 1위를 차지하세요.

다른 사람의 풀이 보기

커뮤니티 솔루션

아직 공개된 풀이가 없습니다. 문제를 풀고 첫 풀이를 공유하세요.