A865 | Cereal 2--Silver
来源USACO
时间限制1s
内存限制128MB
通过 / 提交0/0
题目描述
Farmer John's cows like nothing more than cereal for breakfast! In fact, the
cows have such large appetites that they will each eat an entire box of cereal
for a single meal.
The farm has recently received a shipment with $M$ different types of cereal
$(2\le M\le 10^5)$. Unfortunately, there is only one box of each cereal! Each
of the $N$ cows $(1\le N\le 10^5)$ has a favorite cereal and a second favorite
cereal. When given a selection of cereals to choose from, a cow performs the
following process:
1. If the box of her favorite cereal is still available, take it and leave.
2. Otherwise, if the box of her second-favorite cereal is still available, take it and leave.
3. Otherwise, she will moo with disappointment and leave without taking any cereal.
Find the minimum number of cows that go hungry if you permute them optimally.
Also, find any permutation of the $N$ cows that achieves this minimum.
cows have such large appetites that they will each eat an entire box of cereal
for a single meal.
The farm has recently received a shipment with $M$ different types of cereal
$(2\le M\le 10^5)$. Unfortunately, there is only one box of each cereal! Each
of the $N$ cows $(1\le N\le 10^5)$ has a favorite cereal and a second favorite
cereal. When given a selection of cereals to choose from, a cow performs the
following process:
1. If the box of her favorite cereal is still available, take it and leave.
2. Otherwise, if the box of her second-favorite cereal is still available, take it and leave.
3. Otherwise, she will moo with disappointment and leave without taking any cereal.
Find the minimum number of cows that go hungry if you permute them optimally.
Also, find any permutation of the $N$ cows that achieves this minimum.
输入格式
The first line contains two space-separated integers $N$ and $M.$
For each $1\le i\le N,$ the $i$-th line contains two space-separated integers
$f_i$ and $s_i$ ($1\le f_i,s_i\le M$ and $f_i\neq s_i$) denoting the favorite
and second-favorite cereals of the $i$-th cow.
For each $1\le i\le N,$ the $i$-th line contains two space-separated integers
$f_i$ and $s_i$ ($1\le f_i,s_i\le M$ and $f_i\neq s_i$) denoting the favorite
and second-favorite cereals of the $i$-th cow.
输出格式
Print the minimum number of cows that go hungry, followed by any permutation
of $1\ldots N$ that achieves this minimum. If there are multiple permutations,
any one will be accepted.
of $1\ldots N$ that achieves this minimum. If there are multiple permutations,
any one will be accepted.
输入输出样例
输入 #1
8 10 2 1 3 4 2 3 6 5 7 8 6 7 7 5 5 8
输出 #1
1 1 3 2 8 4 6 5 7
In this example, there are $8$ cows and $10$ types of cereal.
Note that we can effectively solve for the first three cows independently of
the last five, since they share no favorite cereals in common.
If the first three cows choose in the order $[1,2,3]$, then cow $1$ will
choose cereal $2$, cow $2$ will choose cereal $3$, and cow $3$ will go hungry.
If the first three cows choose in the order $[1,3,2]$, then cow $1$ will
choose cereal $2$, cow $3$ will choose cereal $3$, and cow $2$ will choose
cereal $4$; none of these cows will go hungry.
Of course, there are other permutations that result in none of the first three
cows going hungry. For example, if the first three cows choose in the order
$[3,1,2]$ then cow $3$ will choose cereal $2$, cow $1$ will choose cereal $1$,
and cow $2$ will choose cereal $3$; again, none of cows $[1,2,3]$ will go
hungry.
It can be shown that out of the last five cows, at least one must go hungry.
Note that we can effectively solve for the first three cows independently of
the last five, since they share no favorite cereals in common.
If the first three cows choose in the order $[1,2,3]$, then cow $1$ will
choose cereal $2$, cow $2$ will choose cereal $3$, and cow $3$ will go hungry.
If the first three cows choose in the order $[1,3,2]$, then cow $1$ will
choose cereal $2$, cow $3$ will choose cereal $3$, and cow $2$ will choose
cereal $4$; none of these cows will go hungry.
Of course, there are other permutations that result in none of the first three
cows going hungry. For example, if the first three cows choose in the order
$[3,1,2]$ then cow $3$ will choose cereal $2$, cow $1$ will choose cereal $1$,
and cow $2$ will choose cereal $3$; again, none of cows $[1,2,3]$ will go
hungry.
It can be shown that out of the last five cows, at least one must go hungry.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted