UVA127 纸牌游戏 “Accordian“ Patience

难度：3
知识点：链表

用vector模拟链表，一共两个，一个储存每个牌堆，一个储存非空牌堆的编号，开一个while循环，每次都从前向后遍历，每次只移动一个，移动完就下次while循环从新还是遍历非空牌堆编号，其它的就是模拟了，注意细节含义即可，

总结：练习了vector模拟链式结构，

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(x) ((int) x.size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

bool check(pair<char, char> a, pair<char, char> b) {
    return (a.fi == b.fi || a.se == b.se);
}

int main() {
    string s;
    while (cin >> s && s != "#") {
        vector<pair<char, char> > v[55];
        v[1].pb(make_pair(s[0], s[1]));
        for (int i = 2; i <= 52; i++) { cin >> s; v[i].pb(make_pair(s[0], s[1])); }
        vi vec;
        for (int i = 1; i <= 52; i++) vec.pb(i);
        while (true) {
            int ok = 0;
            for (int i = 1; i < sz(vec); i++) {
                if (i >= 3) {
                    int t = vec[i], t1 = vec[i - 3];
                    int l = sz(v[t]), l1 = sz(v[t1]);
                    if (check(v[t][l - 1], v[t1][l1 - 1])) {
                        v[t1].pb(v[t][l - 1]);
                        v[t].erase(v[t].begin() + l - 1);
                        if (!sz(v[t])) vec.erase(vec.begin() + i);
                        ok = 1; break;
                    }
                }
                int t = vec[i], t1 = vec[i - 1];
                int l = sz(v[t]), l1 = sz(v[t1]);
                if (check(v[t][l - 1], v[t1][l1 - 1])) {
                    v[t1].pb(v[t][l - 1]);
                    v[t].erase(v[t].begin() + l - 1);
                    if (!sz(v[t])) vec.erase(vec.begin() + i);
                    ok = 1; break;
                }
            }
            if (!ok) break;
        }
        cout << sz(vec) << (sz(vec) > 1 ? " piles" : " pile") << " remaining:";
        for (int i = 0; i < sz(vec); i++) cout << " " << sz(v[vec[i]]);
        cout << endl;
    }
    return 0;
}