题目:
Description
给出x1,x2,p,k,求一组非负整数解(p1,n1,p2,n2)满足:
p1+n1+p2+n2=k,(p1-n1)*x1+(p2-n2)*x2=p
Input
四个整数x1,x2,p,k(0< x1,x2< 40000,-40000< p< 40000,0<=k< 200000000)
Output
如果存在一组非负整数解则输出YES以及这组解,否则输出NO
Sample Input
2 3 -1 12
Sample Output
YES
1 0 5 6
分析:
首先是求一个可行解,这个简单,相当于解ax+by=c的方程,直接用扩展欧几里得就可以搞定,这里求出的x和y分别相当于P1-N1,P2-N2,剩下是怎么安排次数的问题……首先要把abs(x)+abs(y)的值变到最小,我们知道对于扩展欧几里得求出的解x0,y0来说,x=x0+k*(y0/d) y=y0-k*(x0/d)都是方程的解那么我们就可以通过这个来调整,令abs(x)+abs(y)的值最小,如果此时abs(x)+abs(y)还是大于k,那么说明无解。否则,看此时还需要走多少歩(也就是k-abs(x)+abs(y)),如果是偶数歩,那么简单,剩下的步数只要不断重复走P1,N1就行了。如果不行的话……我们知道通过上面寻找最小值的方法可以调整x和y的值,此时,如果(y0/d)和(x0/d)的奇偶性不同,那么分别对x和y增加(减少)这两个数就可以改变奇偶性了,否则就无解……
以上分析copy自:http://blog.csdn.net/qian99/article/details/18268733
代码:
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 1e3 + 9;
void gcd (ll a, ll b, ll& d, ll& x, ll& y) {
if (!b) {
d = a;
x = 1;
y = 0;
} else {
gcd (b, a % b, d, y, x);
y -= x * (a / b);
}
}
int main() {
//freopen("f.txt","r",stdin);
ll x1, x2, P, K;
cin >> x1 >> x2 >> P >> K;
if (P == 0 && K == 0) {
puts ("YES");
cout << "0 0 0 0" << endl;
return 0;
}
ll d, pn1, pn2;
gcd (x1, x2, d, pn1, pn2);
if (P % d) {
puts ("NO");
return 0;
}
ll t1 = x1 / d, t2 = x2 / d;
pn1 *= (P / d);
pn2 *= (P / d);
while (abs (pn1) + abs (pn2) > abs (pn1 - t2) + abs (pn2 + t1) ) pn1 -= t2, pn2 += t1;
while (abs (pn1) + abs (pn2) > abs (pn1 + t2) + abs (pn2 - t1) ) pn1 += t2, pn2 -= t1;
if (abs (pn1) + abs (pn2) > K) {
puts ("NO");
return 0;
}
ll n1 = 0, n2 = 0;
ll tmp = K - abs (pn1) - abs (pn2);
if (tmp & 1) {
if ( (t1 + t2) % 2 == 0) {
puts ("NO");
return 0;
}
if (abs (pn1 + t2) + abs (pn2 - t1) < abs (pn1 - t2) + abs (pn2 + t1) ) {
pn1 += t2;
pn2 -= t1;
} else {
pn1 -= t2;
pn2 += t1;
}
if (abs (pn1) + abs (pn2) > K) {
puts ("NO");
return 0;
}
}
K -= abs (pn1) + abs (pn2);
if (pn1 < 0) swap (pn1, n1), n1 = -n1;
if (pn2 < 0) swap (pn2, n2), n2 = -n2;
pn1 += K / 2;
n1 += K / 2;
puts ("YES");
cout << pn1 << ' ' << n1 << ' ' << pn2 << ' ' << n2 << endl;
return 0;
}
/*
Sample Input
2 3 -1 12
Sample Output
YES
1 0 5 6
*/