hdu 5933 ArcSoft's Office Rearrangement【模拟】
来源:互联网 发布:网络视频传输套接字 编辑:程序博客网 时间:2024/05/23 01:25
ArcSoft's Office Rearrangement
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
ArcSoft, Inc. is a leading global professional computer photography and computer vision technology company.
There areN working blocks in ArcSoft company, which form a straight line. The CEO of ArcSoft thinks that every block should have equal number of employees, so he wants to re-arrange the current blocks intoK new blocks by the following two operations:
- merge two neighbor blocks into a new block, and the new block's size is the sum of two old blocks'.
- split one block into two new blocks, and you can assign the size of each block, but the sum should be equal to the old block.
Now the CEO wants to know the minimum operations to re-arrange current blocks intoK block with equal size, please help him.
There are
- merge two neighbor blocks into a new block, and the new block's size is the sum of two old blocks'.
- split one block into two new blocks, and you can assign the size of each block, but the sum should be equal to the old block.
Now the CEO wants to know the minimum operations to re-arrange current blocks into
Input
First line contains an integer T , which indicates the number of test cases.
Every test case begins with one line which two integersN and K , which is the number of old blocks and new blocks.
The second line containsN numbers a1 ,a2 ,⋯ ,aN , indicating the size of current blocks.
Limits
1≤T≤100
1≤N≤105
1≤K≤105
1≤ai≤105
Every test case begins with one line which two integers
The second line contains
Limits
Output
For every test case, you should output 'Case #x: y', wherex indicates the case number and counts from 1 andy is the minimum operations.
If the CEO can't re-arrangeK new blocks with equal size, y equals -1.
If the CEO can't re-arrange
Sample Input
3
1 3
14
3 1
2 3 4
3 6
1 2 3
1 3
14
3 1
2 3 4
3 6
1 2 3
Sample Output
Case #1: -1
Case #2: 2
Case #3: 3
Case #2: 2
Case #3: 3
题目大意:
给你N个数,让你分成K个相等的数,操作有两种:
①合并相邻的两个数,得到的数为两个数的和。
②分开一个数,得到的两个数为那个数的拆分。
问最少需要操作多少次。
思路:
1、首先我们将所有数加在一起,如果其和是K的倍数,那么一定能够得到结果,否则输出-1、
2、如果有解,分析到合并操作只能合并相邻的两个数,那么我们对应这样处理:
①将所有数纳入双端队列中,每次取队头元素,直到处理队列为空为止。
②如果队头元素等于sum/k,那么这个数不需要进行处理,否则如果这个数大于sum/k,那么我们对应将这个数一直拆分,直到不能拆分为止。
③如果此时元素小于sum/k,那么对应将这个数累加下一个队头元素,一直进行下去,如果加到了sum/k,那么这个数就不需要继续处理了,否则如果大于sum/k,那么我们再将这个数重新纳入队头。重新进行操作2.
3、相对处理好一些代码细节即可。
Ac代码:
#include<stdio.h>#include<string.h>#include<queue>#include<deque>using namespace std;#define ll __int64ll a[100005];int main(){ int t; int kase=0; scanf("%d",&t); while(t--) { int n; ll kk; scanf("%d%I64d",&n,&kk); ll sum=0; deque<ll >s; for(int i=0;i<n;i++) { scanf("%I64d",&a[i]); sum+=a[i]; s.push_back(a[i]); } printf("Case #%d: ",++kase); if(sum%kk!=0) { printf("-1\n"); continue; } ll k=sum/kk; int output=0; while(!s.empty()) { ll u=s.front(); s.pop_front(); if(u==k)continue; else if(u>k) { output+=u/k; u%=k; if(u==0)output--; } if(u==0)continue; if(u<k) { while(1) { ll v=s.front(); s.pop_front(); u+=v; output++; if(u==k)break; if(u>k) { s.push_front(u); break; } } } } printf("%d\n",output); }}
0 0
- hdu 5933 ArcSoft's Office Rearrangement【模拟】
- HDU 5933 ArcSoft's Office Rearrangement (模拟)
- HDU 5933 ArcSoft's Office Rearrangement(模拟)
- HDU-5933-ArcSoft's Office Rearrangement-模拟(水)
- hdu 5933 ArcSoft's Office Rearrangement
- HDU-5933 ArcSoft's Office Rearrangement(思维)
- HDU 5933 ArcSoft's Office Rearrangement
- 【HDU 5933】 ArcSoft's Office Rearrangement 【贪心】
- HDU 5933 ArcSoft's Office Rearrangement
- hdu 5933 ArcSoft's Office Rearrangement
- hdu 5933 ArcSoft's Office Rearrangement 思维
- hdu 5933 ArcSoft's Office Rearrangement
- HDU-5933-ArcSoft's Office Rearrangement
- hdu 5933 ArcSoft's Office Rearrangement
- HDU 5933 ArcSoft's Office Rearrangement 贪心
- hdu 5933 ArcSoft's Office Rearrangement
- HDU 5933 ArcSoft's Office Rearrangement(贪心)
- HDU 5993 ArcSoft's Office Rearrangement 简单模拟
- I2C知识总结
- Unity3D 之 OnTriggerEnter和OnCollisionEnter的区别
- 给编程生涯充电的 10 本书
- Python神图
- Java中final的进一步理解
- hdu 5933 ArcSoft's Office Rearrangement【模拟】
- 程序设计基础(C&C++) 戴波、张东祥 第四章 数组与结构 编程作业
- canvas记录
- windows上python上传文件到linux服务器指定路径
- javascript之数组api
- JSP 九大内置对象及四个作用域
- 总线、设备、驱动模型
- java读取xslx
- Java中多继承下的super()用法