codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1701C.md (2171B)


      1 Source: https://codeforces.com/problemset/problem/1701/C
      2 
      3 C. Schedule Management
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 There are $n$ workers and $m$ tasks. The workers are numbered from $1$ to $n$. Each task $i$ has a value $a_i$ — the index of worker who is proficient in this task.
     22 
     23 Every task should have a worker assigned to it. If a worker is proficient in the task, they complete it in $1$ hour. Otherwise, it takes them $2$ hours.
     24 
     25 The workers work in parallel, independently of each other. Each worker can only work on one task at once.
     26 
     27 Assign the workers to all tasks in such a way that the tasks are completed as early as possible. The work starts at time $0$. What's the minimum time all tasks can be completed by?
     28 
     29 Input
     30 
     31 The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of testcases.
     32 
     33 The first line of each testcase contains two integers $n$ and $m$ ($1 \le n \le m \le 2 \cdot 10^5$) — the number of workers and the number of tasks.
     34 
     35 The second line contains $m$ integers $a_1, a_2, \dots, a_m$ ($1 \le a_i \le n$) — the index of the worker proficient in the $i$-th task.
     36 
     37 The sum of $m$ over all testcases doesn't exceed $2 \cdot 10^5$.
     38 
     39 Output
     40 
     41 For each testcase, print a single integer — the minimum time all tasks can be completed by.
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 4
     49 
     50 2 4
     51 
     52 1 2 1 2
     53 
     54 2 4
     55 
     56 1 1 1 1
     57 
     58 5 5
     59 
     60 5 1 3 2 4
     61 
     62 1 1
     63 
     64 1
     65 ```
     66 
     67 Output
     68 
     69 ```
     70 2
     71 3
     72 1
     73 1
     74 ```
     75 
     76 Note
     77 
     78 In the first testcase, the first worker works on tasks $1$ and $3$, and the second worker works on tasks $2$ and $4$. Since they both are proficient in the corresponding tasks, they take $1$ hour on each. Both of them complete $2$ tasks in $2$ hours. Thus, all tasks are completed by $2$ hours.
     79 
     80 In the second testcase, it's optimal to assign the first worker to tasks $1, 2$ and $3$ and the second worker to task $4$. The first worker spends $3$ hours, the second worker spends $2$ hours (since they are not proficient in the taken task).
     81 
     82 In the third example, each worker can be assigned to the task they are proficient at. Thus, each of them complete their task in $1$ hour.