PTA甲 1152~1155题解

1152 Google Recruitment

暴力判断质数就可以了。
$O(N\cdot 10^{\frac{k}{2}})$

#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

bool isPrime(i64 x) {
    if (x < 2) return false;
    for (i64 i = 2; i * i <= x; i++) {
        if (x % i == 0) return false;
    }
    return true;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k; cin >> n >> k;
    string s; cin >> s;
    for (int i = 0; i <= n - k; i++) {
        if (isPrime(stoll(s.substr(i, k)))) {
            cout << s.substr(i, k) << '\n';
            return 0;
        }
    }
    
    cout << 404 << '\n';

    return 0;
}

1153 Decode Registration Card of PAT

我太喜欢大模拟啦！！

#include <bits/stdc++.h>
using namespace std;

struct Student {
    char type;
    string site, date, number, card;
    int score;
    explicit Student(char _t, string&& _s, string&& _d, string&& _n, string& _c, int sc):
        type(_t), site(_s), date(_d), number(_n), card(_c), score(sc) {}
};

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M; cin >> N >> M;

    unordered_map<char, vector<int>> q1;
    unordered_map<string, pair<int, int>> q2;
    unordered_map<string, vector<int>> q3;

    vector<Student> v;
    for (int i = 0; i < N; i++) {
        string s;
        int score;
        cin >> s >> score;
        v.emplace_back(char(s[0]), s.substr(1, 3), s.substr(4, 6), s.substr(10), s, score);
        q1[v.back().type].push_back(i);
        if (!q2.count(v.back().site)) {
            q2[v.back().site] = {1, v.back().score};
        } else {
            const auto p = q2[v.back().site];
            q2[v.back().site] = {p.first + 1, p.second + v.back().score};
        }
        q3[v.back().date].push_back(i);
    }

    for (int _ = 1; _ <= M; _++) {
        int ty; string s;
        cin >> ty >> s;
        cout << "Case " << _ << ": " << ty << " " << s << '\n';
        if (s.size() == 1) {
            if (!q1.count(s[0])) {
                cout << "NA\n";
                continue;
            }
            vector<Student> now;
            for (int x : q1[s[0]])
                now.emplace_back(v[x]);
            sort(now.begin(), now.end(), [](Student& A, Student& B) -> bool{
                return A.score == B.score ? A.card < B.card : A.score > B.score;
            });
            for (const auto& st : now) {
                cout << st.card << ' ' << st.score << '\n';
            }
        } else if (s.size() == 3) {
            if (!q2.count(s)) {
                cout << "NA\n";
                continue;
            }
            cout << q2[s].first << ' ' << q2[s].second << '\n';
        } else if (s.size() == 6) {
            if (!q3.count(s)) {
                cout << "NA\n";
                continue;
            }
            unordered_map<string, int> mp;
            for (int x : q3[s])
                mp[v[x].site]++;
            vector<pair<string, int>> now;
            for (const auto& p : mp)
                now.emplace_back(p);
            sort(now.begin(), now.end(), [](pair<string, int>& A, pair<string, int>& B) -> bool{
                return A.second == B.second ? A.first < B.first : A.second > B.second;
            });
            for (const auto& i : now) {
                cout << i.first << ' ' << i.second << '\n';
            }
        }
    }

    return 0;
}

1154 Vertex Coloring

邻接表

#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m; cin >> n >> m;
    vector<vector<int>> graph(n);
    vector<int> color(n);

    for (int i = 0; i < m; i++) {
        int a, b; cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    cin >> m;
    while (m--) {
        for (int i = 0; i < n; i++)
            cin >> color[i];
        unordered_set<int> st;
        for (int i = 0; i < n; i++) {
            st.insert(color[i]);
            for (int x : graph[i]) {
                if (color[x] == color[i]) {
                    cout << "No\n";
                    goto sign;
                }
            }
        }

        cout << st.size() << "-coloring\n";

        sign:
        continue;
    }

    return 0;
}

1155 Heap Paths

要求按照叶子从右到左的顺序，先输出倒数第二层从右到左的叶子，再输出最后一层从右到左的叶子就可以了。

#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<int> v(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }

    bool isMax = true, isMin = true;
    int le = __lg(n);
    // 倒数第二层
    for (int i = (1 << le) - 1; i >= n / 2 + 1; i--) {
        int x = i;
        vector<int> V;
        while (x > 0) {
            V.push_back(x);
            int fa = x >> 1;
            if (fa == 0) break;
            if (v[fa] < v[x]) isMax = false;
            if (v[fa] > v[x]) isMin = false;
            x = fa;
        }
        reverse(V.begin(), V.end());
        for (int j = 0; j < V.size(); j++) {
            if (j ^ 0) cout << ' ';
            cout << v[V[j]];
        }
        cout << '\n';
    }
    // 倒数第一层
    for (int i = n; i > (1 << le) - 1; i--) {
        int x = i;
        vector<int> V;
        while (x > 0) {
            V.push_back(x);
            int fa = x >> 1;
            if (fa == 0) break;
            if (v[fa] < v[x]) isMax = false;
            if (v[fa] > v[x]) isMin = false;
            x = fa;
        }
        reverse(V.begin(), V.end());
        for (int j = 0; j < V.size(); j++) {
            if (j ^ 0) cout << ' ';
            cout << v[V[j]];
        }
        cout << '\n';
    }

    if (isMax) cout << "Max Heap\n";
    else if (isMin) cout << "Min Heap\n";
    else cout << "Not Heap\n";

    return 0;
}

Summary

感觉每一套PTA甲都是

1. 简单数论/小模拟
2. 大模拟
3. 大模拟/图论
4. 数据结构/大模拟