[贪心] 2012 TCO Algorithm Round 1C - Division I, Level Three PasswordXPalindrome

$Solution$

如果是奇数先把中间swap好。把无解的判掉。
因为每个字母出现不超过2次。
考虑把字母$s_i$和$s_{n-i-1}$连起来。
显然会形成若干个环。
我们要把这个图调整成全部是自环的情况。
一个做法就是交换环上相邻的字母所在的位置。

// BEGIN CUT HERE

// END CUT HERE
#line 5 "PasswordXPalindrome.cpp"
#include <bits/stdc++.h>
using namespace std;

char s[60];
int n, ans;
vector<int> G[60];
int cnt[60], vis[60];
int size;

class PasswordXPalindrome {  
public:
    inline void dfs(int u) {
        ++size; vis[u] = 1;
        for (int to: G[u])
            if (!vis[to]) dfs(to);
    }
    int minSwaps(string password) {
        n = password.size();
        for (int i = 0; i < n; i++) s[i] = password[i];
        ans = 0;
        memset(cnt, 0, sizeof cnt);
        memset(vis, 0, sizeof vis);
        for (int i = 0; i < n; i++)
            cnt[s[i] - 'a'] ^= 1;
        if (n & 1) {
            int res = 0;
            for (int i = 0; i < 26; i++)
                res += cnt[i];
            if (res != 1) return -1;
            for (int i = 0; i < 26; i++)
                if (cnt[i] == 1) {
                    for (int j = 0; j < n; j++)
                        if (s[j] == i + 'a') {
                            swap(s[n / 2], s[j]);
                            if (s[n / 2] != s[j]) ++ans;
                            break;
                        }
                    break;
                }
            for (int i = n / 2; i < n - 1; i++)
                s[i] = s[i + 1];
            --n;
        } else {
            int res = 0;
            for (int i = 0; i < 26; i++)
                res += cnt[i];
            if (res != 0) return -1;
        }
        for (int i = 0; i < n; i++)
            G[s[i] - 'a'].push_back(s[n - i - 1] - 'a');
        for (int i = 0; i < 26; i++)
            if (!vis[i]) {
                size = 0; dfs(i);
                ans += size - 1;
            }
        for (int i = 0; i < 26; i++) G[i].clear();
        return ans;
    }

    // BEGIN CUT HERE
public:
    void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
private:
    template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
    void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
    void test_case_0() { string Arg0 = "levle"; int Arg1 = 1; verify_case(0, Arg1, minSwaps(Arg0)); }
    void test_case_1() { string Arg0 = "racecar"; int Arg1 = 0; verify_case(1, Arg1, minSwaps(Arg0)); }
    void test_case_2() { string Arg0 = "abcdadcb"; int Arg1 = 3; verify_case(2, Arg1, minSwaps(Arg0)); }
    void test_case_3() { string Arg0 = "msmscielciel"; int Arg1 = 5; verify_case(3, Arg1, minSwaps(Arg0)); }
    void test_case_4() { string Arg0 = "hicanyouguesstodaywriter"; int Arg1 = -1; verify_case(4, Arg1, minSwaps(Arg0)); }

    // END CUT HERE

};

// BEGIN CUT HERE
int main(void) {
    PasswordXPalindrome ___test;
    ___test.run_test(-1);
    system("pause");
}
// END CUT HERE