Google Code Jam 2010 Round 1B Problem B. Picking Up Chicks
Problem
A flock of chickens are running east along a straight, narrow road. Each one is running with its own constant speed. Whenever a chick catches up to the one in front of it, it has to slow down and follow at the speed of the other chick. You are in a mobile crane behind the flock, chasing the chicks towards the barn at the end of the road. The arm of the crane allows you to pick up any chick momentarily, let the chick behind it pass underneath and place the picked up chick back down. This operation takes no time and can only be performed on a pair of chicks that are immediately next to each other, even if 3 or more chicks are in a row, one after the other.
Given the initial locations (Xi) at time 0 and natural speeds (Vi) of the chicks, as well as the location of the barn (B), what is the minimum number of swaps you need to perform with your crane in order to have at least K of the N chicks arrive at the barn no later than time T?
You may think of the chicks as points moving along a line. Even if 3 or more chicks are at the same location, next to each other, picking up one of them will only let one of the other two pass through. Any swap is instantaneous, which means that you may perform multiple swaps at the same time, but each one will count as a separate swap.
Input
The first line of the input gives the number of test cases, C. C test cases follow. Each test case starts with 4 integers on a line -- N, K, B and T. The next line contains the Ndifferent integers Xi, in increasing order. The line after that contains the N integers Vi. All distances are in meters; all speeds are in meters per second; all times are in seconds.
Output
For each test case, output one line containing "Case #x: S", where x is the case number (starting from 1) and S is the smallest number of required swaps, or the word "IMPOSSIBLE".
Limits
1 ≤ C ≤ 100;
1 ≤ B ≤ 1,000,000,000;
1 ≤ T ≤ 1,000;
0 ≤ Xi < B;
1 ≤ Vi ≤ 100;
All the Xi's will be distinct and in increasing order.
Small dataset
1 ≤ N ≤ 10;
0 ≤ K ≤ min(3, N);
Large dataset
1 ≤ N ≤ 50;
0 ≤ K ≤ N;
Sample
Input |
Output |
3 |
Case #1: 0 |
Solution
vector<int>X;
vector<int>V;
vector<pair<int, int>>ck; int solve(int N, int K, int B, int T1)
{
int sw = ;
int slow = ;
for (int i = N - ; i >= ; i--) {
if (ck[i].first + T1 * ck[i].second >= B) {
K--;
sw += slow; if (!K)
break; } else {
slow++;
}
} if (K)
return -; return sw;
} int main()
{
freopen("in.in", "r", stdin);
if (WRITE_OUT_FILE)
freopen("out.out", "w", stdout); int T;
scanf("%d\n", &T);
if (!T) {
cerr << "Check input!" << endl;
exit();
} for (int t = ; t <= T; t++) {
if (WRITE_OUT_FILE)
cerr << "Solving: #" << t << " / " << T << endl; int N, K, B, T1;
scanf("%d %d %d %d\n", &N, &K, &B, &T1); X.clear();
V.clear();
ck.clear(); for (int i = ; i < N; i++) {
int x;
scanf("%d", &x); X.push_back(x);
} for (int i = ; i < N; i++) {
int v;
scanf("%d", &v); V.push_back(v);
} for (int i = ; i < N; i++) {
ck.push_back(pair<int, int>(X[i], V[i]));
} sort(ck.begin(), ck.end()); auto result = solve(N, K, B, T1); if (result >= ) {
printf("Case #%d: %d\n", t, result);
} else {
printf("Case #%d: IMPOSSIBLE\n", t);
} } fclose(stdin);
if (WRITE_OUT_FILE)
fclose(stdout); return ;
}
最新文章
- 如何知道SQL Server机器上有多少个NUMA节点
- JavaScript基础知识汇总
- Objective-C( Foundation框架 一 数组(NSMutableArray))
- 个性二维码开源专题<;液化/圆角/效果>;
- linux下查看分区信息和剩余空间大小
- Ionic 弹出窗
- sockaddr_u详解
- Redis之PHP操作
- 11 吐司 Toast 代码案例
- FFmpeg源代码简单分析:内存的分配和释放(av_malloc()、av_free()等)
- rest-framework之解析器
- RDD
- 4.mycat部署
- 浅谈JS的数组遍历方法
- iptables为什么需要增加loopback回环的规则
- verilog实现中值滤波
- leetCode 557. Reverse Words in a String I
- python学习笔记12-深浅拷贝
- Linux-使用ctags、vim查看数据类型所在头文件
- install_github安装错误解决方法