HihoCoder - 1631 Cats and Fish (2017ICPC北京站 模拟)
2017-11-25 18:36
411 查看
#1631 : Cats and Fish
时间限制:1000ms单点时限:1000ms
内存限制:256MB
描述
There are many homeless cats in PKU campus. They are all happy because the students in the cat club of PKU take good care of them. Li lei is one of the members of the cat club. He loves those cats very much. Lastweek, he won a scholarship and he wanted to share his pleasure with cats. So he bought some really tasty fish to feed them, and watched them eating with great pleasure. At the same time, he found an interesting question:
There are m fish and n cats, and it takes ci minutes for the ith cat
to eat out one fish. A cat starts to eat another fish (if it can get one) immediately after it has finished one fish. A cat never shares its fish with other cats. When there are not enough fish left, the cat which eats quicker has higher priority to get a
fish than the cat which eats slower. All cats start eating at the same time. Li Lei wanted to know, after x minutes, how many fish would be left.
输入
There are no more than 20 test cases.For each test case:
The first line contains 3 integers: above mentioned m, n and x (0 < m <= 5000, 1 <= n <= 100, 0 <= x <= 1000).
The second line contains n integers c1,c2 …
cn, ci means that it takes the ith
cat ci minutes to eat out a fish ( 1<= ci <= 2000).
输出
For each test case, print 2 integers p and q, meaning that there are p complete fish(whole fish) and q incomplete fish left after x minutes.样例输入
2 1 1 1 8 3 5 1 3 4 4 5 1 5 4 3 2 1
样例输出
1 0 0 1 0 3
题意:给你一堆鱼,让一堆猫去吃,吃的速度不一样,求特定时间剩下多少鱼。
解题思路:模拟即可……慢慢模拟都不急……复杂度很低
#include<iostream>
#include<algorithm>
using namespace std;
int c[10000];
int mi[10000];
int vis[10000];
bool cmp(int a,int b)
{
return a>b;
}
int main(){
int m,n,x;
while(cin>>m>>n>>x){
for(int i=0;i<n;i++){
cin>>c[i];
mi[i]=0;
vis[i]=0;
}
sort(c,c+n);
for(int i=1;i<=x;i++)
for(int j=0;j<n;j++)
if(vis[j]==1){
mi[j]++;
if(mi[j]==c[j]){
vis[j]=0;
mi[j]=0;
}
}
else{
if(m>0){
m--;
mi[j]++;
vis[j]=1;
if(mi[j]==c[j]){
vis[j]=0;
mi[j]=0;
}
}
}
int in=0;
for(int i=0;i<n;i++)
if(vis[i]==1)
in+=vis[i];
if(m<0)
m=0;
cout<<m<<" "<<in<<endl;
}
return 0;
}
相关文章推荐
- Hihocoder #1631 : Cats and Fish 模拟
- hihocoder 1631 Cats and Fish
- HihoCoder - 1632 Secret Poems (2017ICPC北京站 模拟)
- Cats and Fish 2017ACM-ICPC北京赛区/hihoCoder 1631
- Cats and Fish(模拟)
- ACM-ICPC北京赛区2017网络同步赛 题目5 : Cats and Fish【模拟】
- #1631 : Cats and Fish
- icpc-beijing-cats and fish
- 2017 ICPC beijing E - Cats and Fish
- codeforces A Karen and Morning 傻瓜模拟
- Codeforces Round 389 Div.2 B. Santa Claus and Keyboard Check(模拟)
- Codeforce_832B_Petya and Exam_字符串模拟
- ACM--模拟--Inna and Choose Options--水
- 821C - Okabe and Boxes ——优先队列+手动模拟栈
- HDU 1006 Tick and Tick 模拟
- hihocoder 1228 大模拟
- HDU 5463 Clarke and minecraft(模拟)
- 【hihocoder1039】字符消除——模拟
- codeforces 677 B Vanya and Food Processor (模拟)
- HDU 5113 Black And White (搜索DFS)2014ICPC北京站现场赛