kick start Round C Wiggle Walk

分析：

1. 需要知道每一个小方块连着的4个方向最远的点
2. 在四个方向上做并查集就OK了

代码：

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

pii next(map<pii, pii> mp[], pii nd, int id)
{
    if (id == 0)
        return make_pair(mp[id][nd].first, mp[id][nd].second + 1);
    else if (id == 1)
        return make_pair(mp[id][nd].first - 1, mp[id][nd].second);
    else if (id == 2)
        return make_pair(mp[id][nd].first, mp[id][nd].second - 1);
    else
        return make_pair(mp[id][nd].first + 1, mp[id][nd].second);
}

pii findRt(map<pii, pii> mp[], pii nd, int id)
{
    if (mp[id].find(next(mp, nd, id)) == mp[id].end())
        return mp[id][nd];
    return mp[id][nd] = findRt(mp, next(mp, nd, id) , id);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T, tCase = 0;
    cin >> T;
    int N, R, C, Sr, Sc;
    string inf;
    map<pii, pii> mp[4];
    while (T--) {
        cin >> N >> R >> C >> Sr >> Sc;
        cin >> inf;
        pii nd = make_pair(Sr, Sc);
        for (int i = 0; i < 4; ++i)
            mp[i].clear();
        for (int i = 0; i < 4; ++i)
            mp[i][nd] = nd;
        for (int i = 0; i < N; ++i) {
            if (inf[i] == 'E')
                nd = next(mp, findRt(mp, nd, 0), 0);
            else if (inf[i] == 'N')
                nd = next(mp, findRt(mp, nd, 1), 1);
            else if (inf[i] == 'W')
                nd = next(mp, findRt(mp, nd, 2), 2);
            else
                nd = next(mp, findRt(mp, nd, 3), 3);
            // cout << nd.first << " " << nd.second << endl;
            for (int i = 0; i < 4; ++i) {
                mp[i][nd] = nd;
                mp[i][nd] = findRt(mp, nd, i);
                // cout << mp[i][nd].first << " " << mp[i][nd].second << endl;
            }
        }
        cout << "Case #" << ++tCase << ": " << nd.first << " "  << nd.second << "\n"; 
    }
    cout << flush;
    return 0;
}