A15231 | Schedule Management
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
The workers work in parallel, independently of each other. Each worker can only work on one task at once.
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?
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.
The workers work in parallel, independently of each other. Each worker can only work on one task at once.
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?
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of testcases.
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.
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.
The sum of $m$ over all testcases doesn't exceed $2 \cdot 10^5$ .
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.
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.
The sum of $m$ over all testcases doesn't exceed $2 \cdot 10^5$ .
输出格式
For each testcase, print a single integer — the minimum time all tasks can be completed by.
输入输出样例
输入 #1
4 2 4 1 2 1 2 2 4 1 1 1 1 5 5 5 1 3 2 4 1 1 1
输出 #1
2 3 1 1
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.
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).
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.
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).
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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted