Codeforces Round #696 (Div. 2)...

1.矩阵距离

先将所有1入队，再进行BFS

#include <iostream>
#include <cstdio>

using namespace std;

const int N = 1010;

typedef pair<int, int> PII;

PII q[N * N];
char g[N][N];
int dist[N][N], dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
bool st[N][N];
int n, m;


void bfs() {
    int hh = 0, tt = -1;
    for (int i = 0; i < n; i ++) 
        for (int j = 0; j < m; j ++)
            if (g[i][j] == '1')   {
                st[i][j] = 1;
                q[++ tt] = {i, j};   
            }

    while (hh <= tt) {
        auto t = q[hh ++];

        int x = t.first, y = t.second;
        for (int i = 0; i < 4; i ++) {
            int newx = x + dir[i][0], newy = y + dir[i][1];
            if (newx >= 0 && newx < n && newy >= 0 && newy < m && !st[newx][newy])  {
                st[newx][newy] = 1;
                dist[newx][newy] = dist[x][y] + 1;
                q[++ tt] = {newx, newy};
            }
        }
    }
}

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i ++)
            scanf("%s", g[i]);

    bfs();

    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < m; j ++)
            printf("%d ", dist[i][j]);

        puts("");
    }

    return 0;
}

2.Puzzle From the Future

尽量让算得的x的高位更大，因此a的最高位必定是1，a之后的每一位取值要使得x的该位在与前一位不相等的情况下尽可能大

#include <iostream>
#include <cstdio>

using namespace std;

const int N = 100010;

char s[N];
int n, m, t;

int main() {
    scanf("%d", &t);
    while (t --) {
        scanf("%d%s", &n, &s);
        int pre;
        for (int i = 0; i < n; i ++) {
            if (i == 0) {
                pre = s[0] - '0' + 1;
                printf("1");
            }
            else {
                if (s[i] + 1 - '0' != pre) {
                    pre = s[i] - '0' + 1;
                    printf("%d", 1);
                }
                else {
                    pre = s[i] - '0';
                    printf("%d", 0);
                }
            }

        }
        puts("");
    }
    return 0;
}

3.Different Divisors
设结果为x，x有两个质因数p1，p2 且都是1次方，且要求p1 - 1 >= d && p2 - p1 >= d

#include <iostream>
#include <cstdio>

using namespace std;

const int N = 100010;

int primes[N], cnt;
bool st[N];

void make_primes(int n) {
    for (int i = 2; i <= n; i ++) {
        if (!st[i]) primes[cnt ++] = i;
        for (int j = 0; primes[j] <= n / i; j ++) {
            st[primes[j] * i] = true;
            if (i % primes[j] == 0) break;
        }
    }
}

int main() {
    int t, d;
    make_primes(N - 1);
    scanf("%d", &t);
    while (t --) {
        scanf("%d", &d);
        int it;
        for (int i = 0; i < cnt; i ++) {
            if (primes[i] >= d) {
                it = i;
                break;
            }
        }
        if (primes[it] - 1 < d) it ++;
        int it2;
        for (int i = it; i < cnt; i ++) {
            if (primes[i] - primes[it] >= d)   {
                it2 = i;
                break;
            }
        }
        int p1 = primes[it], p2 = primes[it2];
       printf("%d\n", p1 * p2);
    }
    return 0;
}

4. Array Destruction

每次都要数组中（没用过）的最大数，如果不这样选，之后的操作中，这个最大数将永远无法用到。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <vector>


using namespace std;

typedef pair<int, int> PII;

const int N = 10100;


int a[N], n, m, cnt;


vector<PII> check(int val, multiset<int> s) {

    vector<PII> ans;

    ans.push_back({val, a[n - 1]});
    int maxd = a[n - 1];

    s.erase(s.find(val)), s.erase(-- s.end());

    while (s.size()) {

        int tem = maxd - *(-- s.end());

        if (s.find(tem) == s.end() || s.find(tem) == -- s.end())  return {};   
         
         //第二个判断条件测了一个多小时才发现要加上  否则， n = 4 a[]={1 1 2 4}会RE 
        ans.push_back({*(-- s.end()), tem});

        maxd = *(-- s.end());
        s.erase(-- s.end()), s.erase(s.find(tem));

    }


    return ans;
}

int main() {
    int t;
    scanf("%d", &t);

    while (t --) {
        int x;
        vector<PII> res;
        multiset<int> s;

        scanf("%d", &n);
        n *= 2;
        for (int i = 0; i < n; i ++)    scanf("%d", &a[i]);


        sort(a, a + n);

        bool flag = false;

        for (int i = 0; i < n; i ++)
            s.insert(a[i]);

        for (int i = 0; i < n - 1; i ++)    {

            x = a[i] + a[n - 1];
            res = check(a[i], s);

            if (res.size()) {
                flag = true;
                break;
            }
        }

        if (flag)   {
            puts("YES");
            printf("%d\n", x);
            for (auto x : res)
                printf("%d %d\n", x.first, x.second);
        }
        else puts("NO");
    }
    return 0;
}