2020 Multi-University Training Contest 10

Anti-hash Test
Network Test

Mine Sweeper

2020杭电多校 第十场 1003 Mine Sweeper 构造
随机生成

#include <bits/stdc++.h>
using namespace std;
#define between(x, a, b) (a<=x && x<=b)
const int dir[8][2] = {1, 0, 0, 1, -1, 0, 0, -1, -1, -1, -1, 1, 1, -1, 1, 1};
int n;

map<int, vector<vector<char>>> mp;

int solve(vector<vector<char>> a) {
    int r = a.size();
    int c = a[0].size();
    int res = 0;
    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            if (a[i][j] == '.') {
                int cnt = 0;
                for (int l = 0; l < 8; l++) {
                    int dx = i + dir[l][0];
                    int dy = j + dir[l][1];
                    if (between(dx, 0, r - 1) && between(dy, 0, c - 1) && a[dx][dy] == 'X') {
                        cnt++;
                    }
                }
                res += cnt;
            }
        }
    }
    return res;
}

void init() {
    srand((int) time(0));
    for (int k = 1; k <= 50000; k++) {
        int r = (rand() % 25) + 1;
        int c = (rand() % 25) + 1;
        vector<vector<char>> a(r, vector<char>(c));
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                a[i][j] = (rand() % 2) ? 'X' : '.';
            }
        }
        int sum = solve(a);
        mp[sum] = a;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    init();
    int T;
    cin >> T;
    for (int cs = 1; cs <= T; cs++) {
        cin >> n;
        vector<vector<char>> a = mp[n];

        int r = a.size();
        int c = a[0].size();
        cout << r << " " << c << endl;
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                cout << a[i][j] << (j == c - 1 ? "\n" : "");
            }
        }
    }
    return 0;
}

Permutation Counting
Tree Cutting
Divide and Conquer
Coin Game
I do not know Graph Theory!
Photography
Tic-Tac-Toe-Nim

Task Scheduler

每一个状态 $i$ 的期望值都有如下公式对应

$$E_i=\sum p_{ij}\times E_j+1$$
其中 $j$ 是状态 $i$ 能够到达的所有的下一个状态

假设存在一个任务排列 { p 1 , p 2 , . . . p n } \{p_1,p_2,...p_n\} {p1​,p2​,...pn​} 使得目标期望最小化，则存在

$$E_1=\frac{(1-C_{m-k}^{t_{p_1}})}{C_m^{t_{p_1}}}\times E_1+\frac{C_{m-k}^{t_{p_1}}}{C_m^{t_{p_1}}}\times E_2+1$$

其中 $\frac{(1-C_{m-k}^{t_{p_1}})}{C_m^{t_{p_1}}}$ 为选中了任意一个干坏事的人而停留在当前状态的概率（反正就是那k个人中的一个）

而 $\frac{C_{m-k}^{t_{p_1}}}{C_m^{t_{p_1}}}$ 则是顺利进入下一个状态的概率，$1$ 是当前状态进入到下一个状态的代价

观察到左右同时拥有 $E_1$ ，进一步化简得到如下公式

$$E_1-E_2=\frac{C_m^{t_{p_1}}}{C_{m-k}^{t_{p_1}}}$$

再继续推下一个状态 $E_2$ ：
$$E_2=\frac{(1-C_{m-t_{p_1}-k}^{t_{p_2}})}{C_{m-t_{p_1}}^{t_{p_2}}}\times E_2+\frac{C_{m-t_{p_1}-k}^{t_{p_2}}}{C_{m-t_{p_1}}^{t_{p_2}}}\times E_3+1$$

$$E_2-E_3=\frac{C_{m-t_{p_1}}^{t_{p_2}}}{C_{m-t_{p_1}-k}^{t_{p_2}}}$$

到这一步应该都看出来接下来应该怎么做了：
$$(E_1-E_2)+(E_2-E_3)+....+(E_{n-1}-E_n)$$
$$E_1-E_n=\frac{C_m^{t_{p_1}}}{C_{m-k}^{t_{p_1}}}+\frac{C_{m-t_{p_1}}^{t_{p_2}}}{C_{m-t_{p_1}-k}^{t_{p_2}}}+....+\frac{C_{m-\sum t_{p_i}}^{t_{p_n}}}{C_{m-\sum t_{p_i}-k}^{t_{p_n}}}$$

一般都令 $E_n=0$，$E_1$ 即为官方题解上的那个公式

emmmm 证明不会证，凭感觉猜的，n这个范围差点让我错过这道题

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, m, k;
struct node {
    int id, t;
} a[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    int T;
    cin >> T;
    for (int cs = 1; cs <= T; cs++) {
        cin >> n >> m >> k;
        for (int i = 1; i <= n; i++) {
            cin >> a[i].t;
            a[i].id = i;
        }
        if (k == 0) {
            for (int i = 1; i <= n; i++) {
                cout << i << (i == n ? "\n" : " ");
            }
        } else {
            sort(a + 1, a + 1 + n, [](node x, node y) {
                if (x.t == y.t) return x.id < y.id;
                return x.t > y.t;
            });
            for (int i = 1; i <= n; i++) {
                cout << a[i].id << (i == n ? "\n" : " ");
            }
        }
    }
    return 0;
}