第十届蓝桥杯国赛C++研究生组

#include <bits/stdc++.h>


using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<bool> vb;



#define lowbit(S) ((S) & -(S))
#define sz(x) ((int)(x.size()))
#define bg begin()
#define ed end()
#define rbg rbegin()
#define red rend()
#define bitcount __builtin__popcount
#define pb push_back



const double pi = 4 * atan(1);


void slovea(){
    int n = 30, m = 50;
    vector<string> a;
    for (int i = 0; i < n; ++i){
        string s;
        getline(cin, s);
        a.pb(s);
    }

    ll cnt = 0;
    for (int i = 0; i < n; ++i){
        for (int j = 0; j < m; ++j){
            for (int k = j + 1; k < m; ++k)
            for (int l = k + 1; l < m; ++l) if (a[i][l] > a[i][k] && a[i][k] > a[i][j]){
                cnt += 1;
            }
        }
    }

    for (int i = 0; i < m; ++i){
        for (int j = 0; j < n; ++j){
            for (int k = j + 1; k < n; ++k){
            for (int l = k + 1; l < n; ++l) {
                    if (a[l][i] > a[k][i] && a[k][i] > a[j][i]){
                    cnt += 1;
                }
            }
            }
        }
    }



    for (int i = 0; i < n; ++i){
            for (int j = 0; j < m; ++j){
                for (int k = 1; i + k < n && j + k < m; ++k){
                    for (int g = 1; i + k + g < n && j + k + g < m; ++g){
                        int l1 = i + k, r1 = j + k, l2 = l1 + g, r2 = r1 + g;
                        if (l2 < n && r2 < m && a[l1][r1] > a[i][j] && a[l1][r1] < a[l2][r2]){
                            cnt += 1;
                            }
                        }
                }

            }
        }
    for (int i = n - 1; i >= 0; --i){
            for (int j = 0; j < m; ++j){
                for (int k = 1; i - k  && j + k < m; ++k){
                    for (int g = 1; i - k - g  && j + k + g < m; ++g){
                        int l1 = i - k, r1 = j + k, l2 = l1 - g, r2 = l2 + g;
                        if (l2 >= 0 && r2 < m && a[l1][r1] > a[i][j] && a[l1][r1] < a[l2][r2]){
                            cnt += 1;
                        }
                        if (l2 >= 0 && r2 < m && a[l1][r1] < a[i][j] && a[l1][r1] > a[l2][r2]){
                            cnt += 1;
                        }
                    }
                }

            }
        }

    cout << cnt << endl;
}

template<typename T>
double radian(T d){
    return d * pi / 180;
}
//degree into radian, caculate the y coordinate取整得块
//错了，每次第二个iteration是一条线，每条线用一个状态表示，必须知道当前点对应的块，才可以用bit表示
//远点不应该只在中心，应该在任何点都转一圈，但是坐标系应该在圆心
void sloveb(){
    //x from -2 to 2
    //y from -2 to 2
    int n = 4;
    set<string> sett;
    for (int degree = 1; degree <= 360; ++degree){
        string s = "";
        set<int> settmp;
        for (double x = -n / 2; x <= n / 2; x += 0.01){
            double y = x * tan(radian(degree));
            int px = (int)x, py = (int)y;//int(floor(x)), py = int(floor(y))使用floor和ceil答案仍为294
            int col = x < -1 ? 1 : x < 0 ? 2 : x < 1 ? 3 : 4;
            int row = y < -1 ? 4 : y < 0 ? 3 : y < 1 ? 2 : 1;
            int num = (row - 1) * 4 + col;
            settmp.insert(num);
        }
        for (auto x : settmp){
            s += to_string(x) + " ";
        }
        sett.insert(s);
    }
    cout << sz(sett) << endl;//620
}



void slovec(){
    //没有txt文件，直接跳过了
}


void sloved(){
    //看不懂题目在说啥
}

int ans;
bool isFalse(int x){return (int)sqrt(x) * (int)sqrt(x) == x;}
bitset<101> bs;
void dfse(const vvi& mat, int start, int sum, int cnt){
    if (sum && isFalse(sum) || start == 101){return;}
    if (ans < cnt){ans = cnt;}
    for (int i = start + 1; i <= 100; ++i){
        if (mat[start][i] == 0 || bs[i]) continue;
        bs[i] = 0;
        dfse(mat, i, sum + i, cnt + 1);
        bs[i] = 1;
    }
    dfse(mat, start + 1, sum, cnt);
}
void slovee(){
    vi a (101);
    vvi mat(101, vi(101, 1));
    for (int i = 1; i <= 100; ++i) if (isFalse(i)){
        for (int j = 1; j <= 100; ++j){
            mat[j][i] = mat[i][j] = 0;
        }
    }
    for (int i = 1; i <= 100; ++i){
        for (int j = i + 2; j <= 100; ++j) if (isFalse(i + j)){
            mat[i][j] = mat[j][i] = 0;
        }
    }
    ans = 0;
    dfse(mat, 1, 0, 0);
    cout << ans << endl;    //86
}


struct node{
    int x, y, r;
};
bool checkf(const vvi& mat, int x, int y, int r){
    for (int i = x - r; i <= x + r; ++i){
        for (int j = y - r; j <= y + r; ++j) if (!mat[i][j]) return false;
    }
    return true;
}
void slovef(){
    //并不是simulation，是单源最短路径问题
    int n, k;
    cin >> n >> k;
    vvi mat(n + 1, vi(n + 1, 1));
    auto times = mat, vis = mat;
    vis[3][3] = 0;
    for (int i = 1; i <= n; ++i){
        string s;
        cin >>s;
        for (int j = 1; j <= n; ++j){
            mat[i][j] = s[j] == '+';
        }
    }
    queue<node> q;
    q.push({3, 3, 2});
    while(!q.empty()){
        auto cur = q.front();q.pop();
        if (cur.x == n - 2 && cur.y == n - 2){
            cout << times[cur.x][cur.y] << endl;
        }
        cur.r = times[cur.x][cur.y] < k ? 2 : times[cur.x][cur.y] < 2 * k ? 1 : 0;
        for (int i = 0; i < 4; ++i){
            int nx = dx[i] + cur.x, ny = dy[i] + cur.y;
            if (min(nx - r, ny - r) >= 1 && max(nx + r, ny + r) <= n && checkf(nx, ny, cur.r) && vis[nx][ny]){
                vis[nx][ny] = 1;
                q.push({nx, ny, cur.r});
                times[nx][ny] = times[cur.x][cur.y] + 1;
            }
        }
    }
}






int n, m;
bool checkg(const vvi& mat){
    for (int i = 0; i < n; ++i){
        for (int j = 1; j < m - 1; ++j) if (mat[i][j] && mat[i][j - 1] && mat[i][j + 1]) return false;
    }
    for (int i = 0; i < m; ++i){
        for (int j = 1; j < n - 1; ++j) if (mat[j][i] && mat[j - 1][i] && mat[j + 1][i]) return false;
    }
    return true;
}
void dfsg(vvi& mat, int i, int j){
    if (j == m){dfsg(mat, i + 1, 0); return;}
    if (i == n){if (checkg(mat)) ans += 1; return;}
    mat[i][j] = 1;
    dfsg(mat, i, j + 1);
    mat[i][j] = 0;
    dfsg(mat, i, j + 1);
}
void bfg(){
    cin >> n >> m;
    for (n = 1; n <= 5; ++n){
        for (m = 1; m <= 5; ++m){
            vvi mat(n, vi(m));
            ans = 0;
            dfsg(mat, 0, 0);
            cout << "result[" << n << m << "] = " << ans << ";\n";
        }
    }

}
int f[5][5][2][2][2] = {0};

void sloveg(){
    //cout << pow(2, 25) << endl; //3e7时间复杂度
    //暴力解法，5*5耗时3s，需要打表
    //bfg();


    cin >> n >> m;


    vector<int> result(60);
    result[11] = 2;
    result[12] = 4;
    result[13] = 7;
    result[14] = 13;
    result[15] = 24;
    result[21] = 4;
    result[22] = 16;
    result[23] = 49;
    result[24] = 169;
    result[25] = 576;
    result[31] = 7;
    result[32] = 49;
    result[33] = 265;
    result[34] = 1573;
    result[35] = 9253;
    result[41] = 13;
    result[42] = 169;
    result[43] = 1573;
    result[44] = 16561;
    result[45] = 172197;
    result[51] = 24;
    result[52] = 576;
    result[53] = 9253;
    result[54] = 172197;
    result[55] = 3157010;

   //n = n * 10 + m;
    //cout << result[n] << endl;



    //dp解法，状态转移，记忆化搜索， 待完成


    //memoDfsg(5, 5, 1, 1, 1);
    //cout << f[n][m][0][0][0] + f[n][m][0][1][0] + f[n][m][0][0][1] + f[n][m][0][1][1] + f[n][m][1][0][0] + f[n][m][1][0][1] + f[n][m][1][1][0] << endl;


}


void solveh(){

}





int main(){
    ios ::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    slovea();
    return 0;
}

俩字：我太菜了

AEGH

G待dp编程，H图论有时间就看看，A可以再写两遍，E不确定。