2024.12.13 周五

合集 - 日常训练(56)

1.2025.2.19——150002-19 2.11.23 周六2024-11-24 3.11.24 周日2024-11-25 4.11.25 周一日常2024-11-26 5.2024.11.26 周二日常2024-11-26 6.2024.11.27 周三2024-11-27 7.2024.11.28周四2024-11-28 8.2024.11.29 周五2024-11-29 9.2024.11.30 周六2024-11-30 10.2024.12.1 周日2024-12-02 11.2024.12.2 周一2024-12-02 12.2024.12.3 周二2024-12-04 13.2024.12.4 周三2024-12-05 14.2024.12.5 周四2024-12-06 15.2024.12.7 周六2024-12-08 16.2024.12.8 周日2024-12-09 17.2024.12.9 周一2024-12-10 18.2024.12.10 周二2024-12-11 19.2024.12.11 周三2024-12-12 20.2024.12.12 周四2024-12-13

21.2024.12.13 周五2024-12-14

22.2024.12.14 周六2024-12-15 23.2024.12.16 周一2024-12-17 24.2024.12.17 周二2024-12-18 25.2024.12.18 周三2024-12-19 26.2024.12.19 周四2024-12-20 27.2024.12.20 周五2024-12-21 28.2024.12.21 周六2024-12-22 29.2024.12.22 周日2024-12-23 30.2024.12.23 周一2024-12-24 31.2024.12.24 周四2024-12-25 32.2024.12.25 周三2024-12-26 33.2024.12.26 周四2024-12-28 34.2024.12.27 周五2024-12-28 35.2024.12.28 周六2024-12-29 36.2024.12.29 周日2024-12-30 37.2024.12.30 周一01-01 38.2025.1.5——120001-14 39.2025.1.12——120001-14 40.2025.1.14——120001-15 41.2025.1.15——120001-16 42.2025.1.16——120001-17 43.2025.1.17——120001-18 44.2025.1.18——130001-19 45.2025.1.19——130001-20 46.2025.1.20——130001-21 47.2025.1.21——130001-22 48.2025.1.22——130001-24 49.2025.1.24——140001-26 50.2025.1.26——140001-28 51.2025.2.8——140002-09 52.2025.2.9——140002-11 53.2025.2.10——140002-11 54.2025.2.14——140002-14 55.2025.2.15——140002-15 56.2025.2.17——140002-17

2024.12.13 周五

Q1. 1000

Polycarp has a problem — his laptop keyboard is broken.

Now, when he presses the 'b' key, it acts like an unusual backspace: it deletes the last (rightmost) lowercase letter in the typed string. If there are no lowercase letters in the typed string, then the press is completely ignored.

Similarly, when he presses the 'B' key, it deletes the last (rightmost) uppercase letter in the typed string. If there are no uppercase letters in the typed string, then the press is completely ignored.

In both cases, the letters 'b' and 'B' are not added to the typed string when these keys are pressed.

Given a sequence of pressed keys, output the typed string after processing all key presses.

Q2. 1000

You are given an array $a_{1}, a_{2}, \dots, a_{n}$ . You need to find an array $b_{1}, b_{2}, \dots, b_{n}$ consisting of numbers $1$ , $2$ , $3$ such that exactly two out of the following three conditions are satisfied:

There exist indices $1 \leq i, j \leq n$ such that $a_{i} = a_{j}$ , $b_{i} = 1$ , $b_{j} = 2$ .
There exist indices $1 \leq i, j \leq n$ such that $a_{i} = a_{j}$ , $b_{i} = 1$ , $b_{j} = 3$ .
There exist indices $1 \leq i, j \leq n$ such that $a_{i} = a_{j}$ , $b_{i} = 2$ , $b_{j} = 3$ .

If such an array does not exist, you should report it.

Q3. 1000

You are given an array of integers $a_{1}, a_{2}, \dots, a_{n}$ and a number $k$ ( $2 \leq k \leq 5$ ). In one operation, you can do the following:

Choose an index $1 \leq i \leq n$ ,
Set $a_{i} = a_{i} + 1$ .

Find the minimum number of operations needed to make the product of all the numbers in the array $a_{1} \cdot a_{2} \cdot \dots \cdot a_{n}$ divisible by $k$ .

`------------------------独自思考分割线------------------------`

这分段的题，构造，数论，位运算比较有挑战性，其他的题对码力有点要求。果然codeforces的题目质量都很高，没有浪费时间这一说。

A1.

模拟，set/map/stack/倒叙统计个数模拟均可。

A2.

结论构造，需要发现至少有两个块有至少2个相同的数构造任意2种情况即可。过程需要点技巧性。
注意i,j没有大小关系，如果有，一个块有3个相同的数即可构造。

A3.

若被2,3,5整除，就必须有一个数包含其作为质因子，将一个数改为其倍数即可。
被4整除时，考虑2种情况：1.将一个数改为4的倍数，2.将2个数改为2的倍数。取最小代价即可。

`------------------------代码分割线------------------------`

A1.

#include <bits/stdc++.h>
#define int long long //
#define endl '\n'     // 交互/调试 关
using namespace std;
#define bug(BUG) cout << "bug:# " << (BUG) << endl
#define bug2(BUG1, BUG2) cout << "bug:# " << (BUG1) << " " << (BUG2) << endl
#define bug3(BUG1, BUG2, BUG3) cout << "bug:# " << (BUG1) << ' ' << (BUG2) << ' ' << (BUG3) << endl
void _();
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(6);
    int T = 1;
    cin >> T;
    while (T--)
        _();
    return 0;
}

void _()
{
    string s;
    cin >> s;
    set<int> low, high;
    vector<int> del(s.size());
    for (int i = 0; i < s.size(); i++)
        if (s[i] == 'b')
        {
            if (low.size())
            {
                int x = *(low.rbegin());
                del[x] = 1,
                low.erase(x);
            }
        }
        else if (s[i] == 'B')
        {
            if (high.size())
            {
                int x = *(high.rbegin());
                del[x] = 1;
                high.erase(x);
            }
        }
        else
        {
            if (islower(s[i]))
                low.insert(i);
            else
                high.insert(i);
        }
    for (int i = 0; i < s.size(); i++)
        if (s[i] != 'b' && s[i] - 'B' && !del[i])
            cout << s[i];
    cout << endl;
}

A2.

#include <bits/stdc++.h>
#define int long long //
#define endl '\n'     // 交互/调试 关
using namespace std;
#define bug(BUG) cout << "bug:# " << (BUG) << endl
#define bug2(BUG1, BUG2) cout << "bug:# " << (BUG1) << " " << (BUG2) << endl
#define bug3(BUG1, BUG2, BUG3) cout << "bug:# " << (BUG1) << ' ' << (BUG2) << ' ' << (BUG3) << endl
void _();
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(6);
    int T = 1;
    cin >> T;
    while (T--)
        _();
    return 0;
}

void _()
{
    int n;
    cin >> n;
    struct Node
    {
        /* data */
        int a, b = 1, i;
    };
    vector<Node> A(n);
    int id = 0;
    for (auto &[a, b, i] : A)
    {
        cin >> a;
        i = id++;
    }
    sort(A.begin(), A.end(), [](Node &a, Node &b)
         { return a.a < b.a; });
    int f2 = 0, f3 = 0;
    for (int i = 0; i < n; i++)
    {
        if (i && A[i - 1].a == A[i].a)
        {
            if (!f2)
                A[i].b = 2, f2 = A[i].a;
            else if (f2 - A[i].a)
                A[i].b = 3, f3 = 1;
        }
    }
    sort(A.begin(), A.end(), [](Node &a, Node &b)
         { return a.i < b.i; });
    if (f2 && f3)
        for (auto [a, b, i] : A)
            cout << b << ' ';
    else
        cout << -1;
    cout << endl;
}

A3.

#include <bits/stdc++.h>
#define int long long //
#define endl '\n'     // 交互/调试 关
using namespace std;
#define bug(BUG) cout << "bug:# " << (BUG) << endl
#define bug2(BUG1, BUG2) cout << "bug:# " << (BUG1) << " " << (BUG2) << endl
#define bug3(BUG1, BUG2, BUG3) cout << "bug:# " << (BUG1) << ' ' << (BUG2) << ' ' << (BUG3) << endl
void _();
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(6);
    int T = 1;
    cin >> T;
    while (T--)
        _();
    return 0;
}

void _()
{
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    int even = 0;
    for (auto &v : a)
    {
        cin >> v;
        if (v % 2 == 0)
            even++;
    }
    auto get = [&](int k)
    {
        int res = 1e9;
        for (auto v : a)
            res = min(res, (k - v % k) % k);
        return res;
    };
    int res = get(k);
    if (k == 4)
        res = min(res, 2 - min(2ll, even)); // the range of even
    cout << res << endl;
}

posted @ 2024-12-14 11:49 Jkke 阅读(6) 评论(0) 编辑收藏举报

刷新页面返回顶部

登录后才能查看或发表评论，立即登录或者逛逛博客园首页

相关博文：

· 2024.12.3 周二

· 2024.12.12 周四

· codeforces日常训练题

· 2023/03/11刷题

· Codeforces Round #751 (Div. 2)/CodeForces1602

阅读排行：
· 10年+ .NET Coder 心语 ── 封装的思维：从隐藏、稳定开始理解其本质意义
· 地球OL攻略 —— 某应届生求职总结
· 周边上新：园子的第一款马克杯温暖上架
· 提示词工程——AI应用必不可少的技术
· Open-Sora 2.0 重磅开源！

公告

昵称： Jkke
园龄： 6个月
粉丝： 0
关注： 3

+加关注

2025年3月

日

一

二

三

四

五

六

Jke

2024.12.13 周五

2024.12.13 周五

Q1. 1000

Q2. 1000

Q3. 1000

`------------------------独自思考分割线------------------------`

这分段的题，构造，数论，位运算比较有挑战性，其他的题对码力有点要求。果然codeforces的题目质量都很高，没有浪费时间这一说。

A1.

A2.

A3.

`------------------------代码分割线------------------------`

A1.

A2.

A3.

公告

搜索

常用链接

我的标签

合集

随笔档案

阅读排行榜