第十五次CCF计算机软件能力认证

1、小明上学

ACwing 3267

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int r, y, g, n, k, t;
    cin >> r >> y >> g >> n;
    int res = 0;
    while (n--) {
        cin >> k >> t;
        if (k == 0 || k == 1) res += t;
        else if (k == 2) res += t + r;
        else continue;
    }
    cout << res << endl;
    return 0;
}

2、小明放学

ACwing 3268

#include <iostream>
#include <algorithm>
using namespace std;

typedef long long LL;

int main() {
    int r, y, g, n; cin >> r >> y >> g >> n;
    LL res = 0;
    while (n--) {
        LL k, t; cin >> k >> t;
        if (!k) res += t;
        else {
            if (k == 1) t = r - t;
            else if (k == 2) t = r + y + g - t;
            else t = r + g - t;
            t += res, t %= r + g + y;
            if (t < r) res += r - t;
            else if (t >= r + g) res += r + g + y - t + r;
        }
    }
    cout << res << endl;
    return 0;
}

3、CIDR合并

ACwing 3269

4、数据中心

ACwing 3270

求一个最小生成树，且树中每一层的最大边权最小，也就是整个树的最大边权最小，即求一棵最大边权最小的生成树。

scanf函数中的*一种修饰符，表示输入项输入后不转送给任何向量。

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 50010, M = 1e5 + 10;

int n, m;
int p[N];
struct Edge {
    int a, b, c;
    bool operator<(const Edge &w) const {
        return c < w.c;
    }
} edge[M];

int find(int x) {
    if (p[x] != x) p[x] = find(p[x]);
    return p[x];
}

int main() {
    scanf("%d%d%*d", &n, &m);
    for (int i = 1; i <= n; i++) p[i] = i;
    for (int i = 0; i < m; i++) {
        int a, b, c; scanf("%d%d%d", &a, &b, &c);
        edge[i] = {a, b, c};
    }
    sort(edge, edge + m);
    int res = 0;
    for (int i = 0; i < m; i++) {
        int a = edge[i].a, b = edge[i].b, c = edge[i].c;
        int pa = find(a), pb = find(b);
        if (pa != pb) p[pa] = pb, res = c;
    }
    printf("%d\n", res);
    return 0;
}