Google Code Jam 2010 Round 1B Problem B. Picking Up Chicks
2014-04-22 16:23
671 查看
https://code.google.com/codejam/contest/635101/dashboard#s=p1
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.
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.
0 ≤ K ≤ min(3, N);
0 ≤ K ≤ N;
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 5 3 10 5 0 2 5 6 7 1 1 1 1 4 5 3 10 5 0 2 3 5 7 2 1 1 1 4 5 3 10 5 0 2 3 4 7 2 1 1 1 4 | Case #1: 0 Case #2: 2 Case #3: IMPOSSIBLE |
Solution
vector<int>X; vector<int>V; vector<pair<int, int>>ck; int solve(int N, int K, int B, int T1) { int sw = 0; int slow = 0; for (int i = N - 1; i >= 0; i--) { if (ck[i].first + T1 * ck[i].second >= B) { K--; sw += slow; if (!K) break; } else { slow++; } } if (K) return -1; 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(0); } for (int t = 1; 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 = 0; i < N; i++) { int x; scanf("%d", &x); X.push_back(x); } for (int i = 0; i < N; i++) { int v; scanf("%d", &v); V.push_back(v); } for (int i = 0; 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 >= 0) { printf("Case #%d: %d\n", t, result); } else { printf("Case #%d: IMPOSSIBLE\n", t); } } fclose(stdin); if (WRITE_OUT_FILE) fclose(stdout); return 0; }
相关文章推荐
- Google Code Jam 2010 Round 1C Problem A. Rope Intranet
- Google Code Jam Africa 2010 Qualification Round Problem A. Store Credit
- Google Code Jam Africa 2010 Qualification Round Problem B. Reverse Words
- google code jam exercise——Picking Up Chicks
- Google Code Jam 2010 Round 1B Problem A. File Fix-it
- Google Code Jam 2010 Round 1C Problem B. Load Testing
- Google Code Jam 2010 Round 1A Problem A. Rotate
- Google Code Jam 2016 Round 1B Problem C. Technobabble
- Google Code Jam 2014 Round 1 A:Problem A Charging Chaos
- dp - Google Code jam Qualification Round 2015 --- Problem B. Infinite House of Pancakes
- Google Code Jam 2015 Round 1A: Problem B. Haircut
- Google codejam 2010 Round 2 :: Grazing Google Goats
- Google Code Jam 2014 Round 1 A:Problem B. Full Binary Tree
- Google Code Jam 2010 Qualification Round 资格赛 Problem A. Snapper Chain 问题A.按扣链条
- Google Code Jam 2014 Round 1 A:Problem C. Proper Shuffle
- [C++]Store Credit——Google Code Jam Qualification Round Africa 2010
- Google Code Jam 2009 Qualification Round Problem A. Alien Language
- Google Code Jam Round 1C 2015 Problem A. Brattleship
- Google Code Jam 2009 Qualification Round Problem B. Watersheds
- Google Code Jam 2009 Qualification Round Problem C. Welcome to Code Jam