Leetcode 365. Water and Jug Problem[medium]

题目：
You are given two jugs with capacities x and y litres. There is an infinite amount of water supply available. You need to determine whether it is possible to measure exactly z litres using these two jugs.

If z liters of water is measurable, you must have z liters of water contained within one or both buckets by the end.

Operations allowed:

Fill any of the jugs completely with water.
Empty any of the jugs.
Pour water from one jug into another till the other jug is completely full or the first jug itself is empty.
Example 1: (From the famous “Die Hard” example)

Input: x = 3, y = 5, z = 4
Output: True
Example 2:

Input: x = 2, y = 6, z = 5
Output: False

---

这个题本来以为是个爆搜题，开个二维数字dfs一下就好的题。
最后还是被制裁了，这题的x,y会上万，dfs无论内存和时间都是不可接受的。
这个题自己没想出来，看了discuss。
利用gcd求解，ax+by=z，z<=x+y范围内有解则原问题有解，如果a或b是负数，则代表倒出过一整杯的x或y，正数则代表装满过一整杯的x或y。
自己弱，想不出来。

class Solution {
public:
    bool canMeasureWater(int x, int y, int z) {
        if (x + y < z) return false;
        if (x == 0 && y == z) return true;
        if (y == 0 && x == z) return true;
        if (z % exgcd(x, y) == 0) return true;
        return false;
    }

    int exgcd(int x, int y) {
        if (y == 0) return x;
        return exgcd(y, x % y);
    }
};

MLE的搜索：

class Solution {
public:
    int sx, sy;
    int sz;
    vector<vector<bool> > vis;
    bool canMeasureWater(int x, int y, int z) {
        vis.resize(x + 1);
        for (int i = 0; i <= x; ++i) vis[i].resize(y + 1);

        sx = x; 
        sy = y;
        sz = z;

        dfs(0, 0);
        bool ans = false;
        for (int i = 0; i <= sx; i++)
            if (z - i <= sy && z - i >= 0 && vis[i][z - i]) return true;
        for (int i = 0; i <= sy; i++)
            if (z - i <= sx && z - i >= 0 && vis[z - i][i]) return true;
        return false;
    }

    void dfs(int x, int y) {
        //cout << x << "    " << y << endl; 
        vis[x][y] = true;
        if (x < sx && !vis[sx][y]) dfs(sx, y);
        if (y < sy && !vis[x][sy]) dfs(x, sy);
        if (x > 0 && !vis[0][y]) dfs(0, y);
        if (y > 0 && !vis[x][0]) dfs(x, 0);
        if (x > 0 && x <= sy - y && !vis[0][y + x]) dfs(0, x + y);
        if (x > 0 && x > sy - y && !vis[x - (sy - y)][sy]) dfs(x - (sy - y), sy);
        if (y > 0 && y <= sx - x && !vis[x + y][0]) dfs(x + y, 0);
        if (y > 0 && y > sx - x && !vis[sx][y - (sx - x)]) dfs(sx, y - (sx - x));
    }
};