Checkers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 875 Accepted Submission(s): 250
Problem Description
Little X, Little Y and Little Z are playing checkers when Little Y is annoyed. So he wants to make the chessboard much bigger. Although Little Z insists the original version, Little X stands by Little Y. After they enlarge the chessboard, the chessboard turns to an infinite line.
The chessboard is like the Number Axes now, with each integer point able to hold a checker. At initial status there are three checkers on three different integer points , and through the game there always are three checkers. Every time, they can choose a checker A to jump across a pivot checker B to a new position(but the distance between old A and B equals to new A and B, and there should be no other checkers except B in the range [old A, new A]).
After playing for a while, they wonder whether an given status a,b,c can be transferred to x,y,z. obeying the rules. Since the checkers are considered the same, it is unnecessary for a must jump to x.
The chessboard is like the Number Axes now, with each integer point able to hold a checker. At initial status there are three checkers on three different integer points , and through the game there always are three checkers. Every time, they can choose a checker A to jump across a pivot checker B to a new position(but the distance between old A and B equals to new A and B, and there should be no other checkers except B in the range [old A, new A]).
After playing for a while, they wonder whether an given status a,b,c can be transferred to x,y,z. obeying the rules. Since the checkers are considered the same, it is unnecessary for a must jump to x.
Input
The first line is a,b,c.
The second line is x,y,z.
They are all integers in range (-10^9, 10^9) and the two status are valid.
The second line is x,y,z.
They are all integers in range (-10^9, 10^9) and the two status are valid.
Output
The first line is YES or NO, showing whether the transfer can be achieved.
If it is YES, then output the least steps in the second line.
If it is YES, then output the least steps in the second line.
Sample Input
1 2 3 0 3 5
Sample Output
YES 2HintThe middle checker jumps to position 0, and the status is 0 1 3 Then , the middle one jumps to 5.
Source
2011 Multi-University Training Contest 1 - Host by HNU
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#define ll long long
using namespace std;
const int MAXN = 10000 + 10;
const int INF = 1000000003;
int read();
struct data
{
long long a[4];
bool operator != (const data& rs)const
{
for(int i=1;i<=3;i++) if(a[i] != rs.a[i]) return 1;
return 0;
}
};
long long a[4], b[4];
long long dep;
data work(long long *a, long long k)
{
data ans;
long long t1 = a[2] - a[1], t2 = a[3] - a[2];
for(int i=1;i<=4;i++) ans.a[i] = a[i];
if(t1 == t2) return ans;
if(t1 < t2)
{
long long t = min(k, (t2 - 1) / t1);
k -= t; dep += t;
ans.a[2] += t * t1; ans.a[1] += t * t1;
}
else
{
long long t = min(k, (t1 - 1) / t2);
k -= t; dep += t;
ans.a[2] -= t * t2; ans.a[3] -= t * t2;
}
if(k) return work(ans.a, k);
else return ans;
}
int main()
{
while(scanf("%I64d%I64d%I64d", &a[1], &a[2], &a[3])!=EOF)
{
for(int i=1;i<=3;i++) scanf("%I64d", &b[i]);
sort(a + 1, a + 4); sort(b + 1, b + 4); dep = 0;
data t1 = work(a, INF); ll d1 = dep; dep = 0;
data t2 = work(b, INF); ll d2 = dep; dep = 0;
if(t1 != t2){puts("NO"); continue;}
if(d1 > d2)
{
swap(d1, d2);
for(int i=1;i<=3;i++) swap(a[i], b[i]);
}
int ans = d2 - d1;
t1 = work(b, ans);for(int i=1;i<=3;i++) b[i] = t1.a[i];
int l = 0, r = d1;
int rs;
while(l <= r)
{
int mid = (l + r) >> 1;
if(!(work(a, mid) != work(b, mid)))
{
rs = mid;
r = mid - 1;
}
else l = mid + 1;
}
puts("YES");
printf("%d\n", ans + 2 * rs);
}
return 0;
}