Kickstart Round H 2019 Problem B. Diagonal Puzzle

有史以來打得最差的一次kickstart居然發生在winter camp出結果前的最後一次ks = = 感受本身的winter camp要涼了
究其緣由，無非本身太眼高手低，好好作B, C的小數據，也不至於最後才AC了第一題吧

B題，我花了兩個小時也沒AC = =，個人作法和題解大數據的第一種相似。

1. 咱們能夠發現，每一個點只由兩個diagonal決定，而後每一個diagonal至多作一次，作兩次至關於白作嘛。

2. 而後咱們發現若是先討論最長正對角線是否取，也就是從(0,0)到 (n-1,n-1)，能夠直接討論出其中一半的diagonal和一半點的取捨問題，以5*5爲例，如圖所示。對於最長的正對角線上的每一個元素，若是是'.', 那麼必要動用他們所對應的反對角線才能翻過來，反之比不會動用這些反對角線。以後，若是這些被討論到的反對角線上若是存在'.'，那麼咱們就須要動用他們所對用的正對角線進行翻轉。以後咱們再判斷是否全部點都被翻轉了(圖中最右邊一張圖重的全部黃色點)
   

3. 上步咱們發現咱們只討論一半的點和對角線的操做。對於 另外一半，偶數長度邊和奇數長度邊的討論是有些許不一樣的(以下圖所示，奇數長度邊的反最長對角線不在這一半中)。可是大方向同樣，尋找剩下點中反對角線最長的一條，而後作和第二步相似的操做。要注意2，3兩步都要先討論對角線翻不翻轉
   

細節仍是看下代碼 = = 寫的有點長

#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <complex>
#include <cassert>
#include <random>
#include <cstring>
#include <numeric>
#define mp make_pair
#define ll long long
#define ld long double
#define null NULL
#define all(a) a.begin(), a.end()
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(a) (int)a.size()
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define bitCount(a)  __builtin_popcount(a)
template<class T> int gmax(T &a, T b) { if (b > a) { a = b; return 1; } return 0; }
template<class T> int gmin(T &a, T b) { if (b < a) { a = b; return 1; } return 0; }
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A>
string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int INF = 0x3f3f3f3f;
char seq[105][105];
int n;
int id1[105][105];
int id2[105][105];
int tmp[105][105];

vector<vector<pair<int, int> > > s1;
vector<vector<pair<int, int> > > s2;
void init() {
    s1.clear(); s2.clear();
    int cnt = 0;
    for(int i = n-1; i >= 0; --i) {
        int x = i; int y = 0;
        vector<pair<int, int> > tmp;
        while(1) {
            id1[x][y] = cnt;
            tmp.push_back(make_pair(x, y));
            x ++; y ++;
            if(x < 0 || x >= n || y < 0 || y >= n) break;
        }
        s1.push_back(tmp);
        cnt ++;
    }

    for(int i = 1; i <= n-1; ++i) {
        int x = 0; int y = i;
        vector<pair<int, int> > tmp;
        while(1) {
            id1[x][y] = cnt;
            tmp.push_back(make_pair(x, y));
            x ++; y ++;
            if(x < 0 || x >= n || y < 0 || y >= n) break;
        }
        s1.push_back(tmp);
        cnt ++;
    }

    cnt = 0;
    for(int i = 0; i <= n-1; ++i) {
        int x = i; int y = 0;
        vector<pair<int, int> > tmp;
        while(1) {
            id2[x][y] = cnt;
            tmp.push_back(make_pair(x, y));
            x --; y ++;
            if(x < 0 || x >= n || y < 0 || y >= n) break;
        }
        s2.push_back(tmp);
        cnt ++;
    }

    for(int i = 1; i <= n-1; ++i) {
        int x = n-1; int y = i;
        vector<pair<int, int> > tmp;
        while(1) {
            id2[x][y] = cnt;
            tmp.push_back(make_pair(x, y));
            x --; y ++;
            if(x < 0 || x >= n || y < 0 || y >= n) break;
        }
        s2.push_back(tmp);
        cnt ++;
    }

    // debug(s1, s2);
}


int solve1(int ty) {
    // debug(ty);
    
    int cnt = ty == 1; bool suc = true;
    map<int, int> mp;
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            tmp[i][j] = seq[i][j] == '#';
        }
    }
    vector<int> diagnol;
    int target = s1.size() / 2;
    for(int i = 0, len = s1[target].size(); i < len; ++i) {
        int x = s1[target][i].first; int y = s1[target][i].second;
        // debug(tmp[x][y], (ty == 1));

        
        if(tmp[x][y] == (ty == 1) ) {
            cnt ++;
            diagnol.push_back(id2[x][y]);
            
            // debug("yingying");
            
        }

        if(ty == 1) tmp[x][y] = !tmp[x][y];
    }
    
    // debug(diagnol);

    for(int i = 0, len = diagnol.size(); i < len; ++i) {
        for(int j = 0, len2 = s2[diagnol[i]].size(); j < len2; ++j) {
            int x = s2[diagnol[i]][j].first; int y = s2[diagnol[i]][j].second;
            // debug(x, y);
            tmp[x][y] = !tmp[x][y];
        }
    }

    for(int i = target % 2; i < s1.size();i += 2) {
        for(auto Point : s1[i]) {
            int x = Point.first; int y = Point.second;
            if(tmp[x][y] == 0) {
                // debug(x, y);
                mp[id1[x][y]] ++;
            }
        }
    }

    
    for(auto it : mp) {
        // debug(it.first, it.second);
        cnt ++;
        if(s1[it.first].size() != it.second) {
            suc = false; break;
        }
    }

    if(suc == true) {
        // debug(cnt);
        return cnt;
    }
    else return INF;
}


int solve2(int ty) {
    int cnt = ty == 1; bool suc = true;
    map<int, int> mp;
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            tmp[i][j] = seq[i][j] == '#';
        }
    }
    vector<int> diagnol;
    int target = s2.size() / 2;
    if(n % 2) target --;
    for(int i = 0, len = s2[target].size(); i < len; ++i) {
        int x = s2[target][i].first; int y = s2[target][i].second;
        
        if(tmp[x][y] == (ty == 1) ) {
            cnt ++;
            diagnol.push_back(id1[x][y]);
            
        }

        if(ty == 1) tmp[x][y] = !tmp[x][y];
    }

    // debug(diagnol);

    for(int i = 0, len = diagnol.size(); i < len; ++i) {
        for(int j = 0, len2 = s1[diagnol[i]].size(); j < len2; ++j) {
            int x = s1[diagnol[i]][j].first; int y = s1[diagnol[i]][j].second;
            tmp[x][y] = !tmp[x][y];
        }
    }

    for(int i = 1; i < s2.size();i += 2) {
        for(auto Point : s2[i]) {
            int x = Point.first; int y = Point.second;
            if(tmp[x][y] == 0) {
                // debug(i, j)
                mp[id2[x][y]] ++;
            }
        }
    }

    
    for(auto it : mp) {
        cnt ++;
        if(s2[it.first].size() != it.second) {
            suc = false; break;
        }
    }

    if(suc == true) return cnt;
    else return INF;
}


int main() {
    int T;
    scanf("%d", &T);
    for(int cas = 1; cas <= T; ++cas) {
        
        scanf("%d", &n);
        for(int i = 0; i < n; ++i) {
            scanf("%s", seq[i]);
        }

        

        init();
        printf("Case #%d: ", cas);

        if(n == 1) {
            printf("%d\n", seq[0][0] == '.');
            continue;   
        }
        printf("%d\n", min(solve1(1), solve1(0)) + min(solve2(1), solve2(0)) );


    }
    return 0;
}