Codeforces Round 942 (Div. 2) A - D1解题

爱唱歌的小秃兔

已于 2024-05-02 00:58:31 修改

阅读量371

点赞数 4

文章标签：算法 c++ 数据结构

于 2024-05-02 00:58:04 首次发布

本文链接：https://blog.csdn.net/Xyrsis/article/details/138383073

版权

视频讲解:

Codeforces Round 942 (Div. 2) A题_哔哩哔哩_bilibili

讲解都在视频里哦 ~

A - Contest Proposal

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

int main()
{
    int TT;
    cin >> TT;
    while (TT--)
    {
        int n;
        cin >> n;
        vector<int> a(n), b(n);
        for (auto &i : a)
            cin >> i;
        for (auto &i : b)
            cin >> i;
        int k = 0;
        for (int l = 0; l < n; l++)
        {
            for (int i = 0 + k; i < n; i++)
                if (a[i - k] > b[i])
                {
                    k++;
                    break;
                }
        }
        cout << k << endl;
    }
    return 0;
}

B - Coin Games

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

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int n, cnt = 0;
        cin >> n;
        string s;
        cin >> s;
        for (auto i : s)
            if (i == 'U')
                cnt++;
        if (cnt % 2 != 0)
            cout << "YES\n";
        else
            cout << "NO\n";
    }
    return 0;
}

C - Permutation Counting

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

signed main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int n, k, minNum, remain = 0;
        cin >> n >> k;
        vector<int> a(n);
        for (auto &i : a)
            cin >> i;
        sort(a.begin(), a.end());
        minNum = a[0];
        for (int i = 1; i < n; i++)
        {
            int diff = a[i] - a[i - 1];
                if (diff * i <= k)
                    k -= diff * i, minNum = a[i];
                else
                {
                    minNum = a[i - 1] + k / i;
                    remain = n - i;
                    k %= i;
                    break;
                }
        }
        int ans = minNum * n + k + remain - n + 1;
        cout << ans << endl;
    }
    return 0;
}

C - Permutation Counting

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

int calculate(int b, int n)
{
    if (b * (b - 1) > n)
        return 0;
    if (b == 1)
        return n;
    int ans = (n - b * (b - 1)) / (b * b) + 1;
    return ans;
}

signed main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int n, m, sum = 0;
        cin >> n >> m;
        for (int i = 1; i <= m; i++)
            sum += calculate(i, n);
        cout << sum << endl;
    }
    return 0;
}