AtCoder Beginner Contest 347（A~E）

最新推荐文章于 2024-06-30 20:23:11 发布

TINYST

最新推荐文章于 2024-06-30 20:23:11 发布

阅读量918

点赞数 14

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

本文链接：https://blog.csdn.net/m0_72688204/article/details/137288711

版权

别人聊着风花雪月，我想着恩格尔列，沙沙沙，沙净天下情侣狗

A - Divisible

Problem Statement

You are given positive integers $N$ and $K$ , and a sequence of length $N$ , $A=(A_1,A_2,\ldots,A_N)$ .

Extract all elements of $A$ that are multiples of $K$ , divide them by $K$ , and print the quotients.

思路：模拟即可

AC Code

#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define int long long
#define pii pair<int, int>
#define pb push_back
#define gcd __gcd
#define lcm(a, b) (a * b) / gcd(a, b)
#define all(a) a.begin(), a.end()
#define mem(a, x) memset(a, x, sizeof(a))
#define f(i, s, e) for (int i = s; i <= e; i++)
#define ff(i, s, e) for (int i = s; i >= e; i--)
#define setbits(x) __builtin_popcount(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 100000007
#define maxn (ll)(2e5 + 5000)
#define INF LONG_LONG_MAX
using namespace std;
// set<int>::iterator it;

signed main(void)
{
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    for (int i = 0; i < N; i++)
        cin >> A[i];

    vector<int> result;
    for (int i = 0; i < N; i++)
    {
        if (A[i] % K == 0)
            result.push_back(A[i] / K);
    }

    for (int i = 0; i < result.size(); i++)
        cout << result[i] << " ";
    cout << endl;

    return 0;
}

B - Substring

Problem Statement

You are given a string $S$ consisting of lowercase English letters. How many different non-empty substrings does $S$ have?

A substring is a contiguous subsequence. For example, xxx is a substring of yxxxy but not of xxyxx.

最纯真的暴力，没有思路

AC Code

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

int countDistinctSubstrings(string S) {
    int n = S.size();
    vector<string> suffixes(n);
    for (int i = 0; i < n; i++) {
        suffixes[i] = S.substr(i);
    }
    sort(suffixes.begin(), suffixes.end());
    int count = suffixes[0].size();
    for (int i = 1; i < n; i++) {
        int lcp = 0;
        while (lcp < suffixes[i].size() && lcp < suffixes[i - 1].size() && suffixes[i][lcp] == suffixes[i - 1][lcp]) {
            lcp++;
        }
        count += suffixes[i].size() - lcp;
    }
    return count;
}

int main() {
    string S;
    cin >> S;
    cout << countDistinctSubstrings(S) << endl;
    return 0;
}

C - Ideal Holidays

Problem Statement

In the Kingdom of AtCoder, a week consists of $A + B$ days, with the first through $A$ -th days being holidays and the $(A + 1)$ -th through $(A + B)$ -th being weekdays.

Takahashi has $N$ plans, and the $i$ -th plan is scheduled $D_i$ days later.

He has forgotten what day of the week it is today. Determine if it is possible for all of his $N$ plans to be scheduled on holidays.

思路:这道题思维较难，比D和E的思维难，题目说不知道现在是星期几，我们不妨设现在是第0天，然后通过取模，将他们压缩在一个周期即[0,A+B)中，此时去考察，此时发现，如果存在两个相邻点的距离大于b，或者最大间距小于a，就可保证都在节假日内(如果想不太明白，可以画个图看一下)

AC Code

#include <algorithm>
#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define int long long
#define pii pair<int, int>
#define pb push_back
#define gcd __gcd
#define lcm(a, b) (a * b) / gcd(a, b)
#define all(a) a.begin(), a.end()
#define mem(a, x) memset(a, x, sizeof(a))
#define f(i, s, e) for (int i = s; i <= e; i++)
#define ff(i, s, e) for (int i = s; i >= e; i--)
#define setbits(x) __builtin_popcount(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 100000007
#define maxn (ll)(2e5 + 5000)
#define INF LONG_LONG_MAX
using namespace std;
// set<int>::iterator it;
int n, a, b;
int d[maxn];
signed main(void)
{
    ios::sync_with_stdio(false), cin.tie(nullptr);
    cin >> n >> a >> b;
    f(i, 1, n)
    {
        cin >> d[i];
        d[i] %= (a + b);
    }
    sort(d + 1, d + n + 1);
    int newSize = (unique(d + 1, d + n + 1) - (d + 1));
    f(i, 2, newSize)
    {
        if (d[i] - d[i - 1] > b)
        {
            cout << "Yes" << endl;
            return 0;
        }
    }
    if (d[newSize] - d[1] < a)
    {
        cout << "Yes" << endl;
        return 0;
    }
    cout << "No" << endl;
    return 0;
}

D - Popcount and XOR

Problem Statement

You are given non-negative integers $a$ , $b$ , and $C$ . Determine if there is a pair of non-negative integers $(X, Y)$ that satisfies all of the following five conditions. If such a pair exists, print one.

$KaTeX parse error: Expected 'EOF', got '&' at position 10: 0 \leq X &̲lt; 2^{60}$
$KaTeX parse error: Expected 'EOF', got '&' at position 10: 0 \leq Y &̲lt; 2^{60}$
$\operatorname{popcount}(X) = a$
$\operatorname{popcount}(Y) = b$
$\oplus Y = C$

Here, $\oplus$ denotes the bitwise XOR.

If multiple pairs $(X, Y)$ satisfy the conditions, you may print any of them.

What is popcount?

For a non-negative integer $x$ , the popcount of $x$ is the number of $1$ s in the binary representation of $x$ . More precisely, for a non-negative integer $x$ such that $\displaystyle x=\sum _ {i=0} ^ \infty b _ i2 ^ i\ (b _ i\in\lbrace0,1\rbrace)$ , we have $\displaystyle\operatorname{popcount}(x)=\sum _ {i=0} ^ \infty b _ i$ .

For example, $13$ in binary is 1101, so $\operatorname{popcount}(13)=3$ .What is bitwise XOR?

For non-negative integers $x, y$ , the bitwise exclusive OR $\oplus y$ is defined as follows.

The $2^k$ ’s place $\ (k\geq0)$ in the binary representation of $\oplus y$ is $1$ if exactly one of the $2^k$ ’s places $\ (k\geq0)$ in the binary representations of $x$ and $y$ is $1$ , and $0$ otherwise.

For example, $9$ and $3$ in binary are 1001 and 0011, respectively, so $\oplus 3 = 10$ (in binary, 1010).

思路：题目挺吓人，实际非常简单，就是代码容易写错，需要调。按照题意，一步步来，首先先算出c中的1的个数，如果大于（a+b），直接结束。否则一步步构造即可（语言能力有限，just look look my code）

AC Code

#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define int long long
#define pii pair<int, int>
#define pb push_back
#define gcd __gcd
#define lcm(a, b) (a * b) / gcd(a, b)
#define all(a) a.begin(), a.end()
#define mem(a, x) memset(a, x, sizeof(a))
#define f(i, s, e) for (int i = s; i <= e; i++)
#define ff(i, s, e) for (int i = s; i >= e; i--)
#define setbits(x) __builtin_popcount(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 100000007
#define maxn (ll)(2e5 + 5000)
#define INF LONG_LONG_MAX
using namespace std;
// set<int>::iterator it;
string s = "";
int cnt = 0;
void change(int x)
{
    while (x)
    {
        if (x % 2 == 0)
        {
            s += '0';
            x /= 2;
        }
        else
        {
            s += '1';
            x /= 2;
            cnt++;
        }
    }
    int fuck = s.size();
    f(i, fuck, 60)
    {
        s += '0';
    }
}
int qpow(int a, int b)
{
    int ans = 1;
    while (b)
    {
        if (b & 1)
        {
            ans *= a;
        }
        a *= a;
        b >>= 1;
    }
    return ans;
}
int check(string x)
{
    int ans = 0;
    f(i, 0, x.size() - 1)
    {
        if (x[i] == '1')
        {
            ans += qpow(2, i);
        }
    }
    return ans;
}
signed main(void)
{
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int a, b, c;
    cin >> a >> b >> c;
    change(c);
    if (cnt > a + b)
    {
        cout << -1 << endl;
        return 0;
    }
    string x, y;
    int t = s.size();
    f(i, 0, s.size() - 1)
    {
        if (s[i] == '1')
        {
            if (a <= b)
            {
                x += '0';
                y += '1';
                b--;
                cnt--;
            }
            else
            {
                x += '1';
                y += '0';
                a--;
                cnt--;
            }
        }
        else if (s[i] == '0' && cnt == a + b)
        {
            x += '0';
            y += '0';
        }
        else if (s[i] == '0' && cnt < (a + b) - 1)
        {
            x += '1';
            y += '1';
            a--;
            b--;
        }
        if (a == 0 && b == 0)
        {
            break;
        }
    }
    if (a != 0 || b != 0)
    {
        cout << -1 << endl;
        return 0;
    }
    cout << check(x) << " " << check(y) << endl;
    return 0;
}

E - Set Add Query

Problem Statement

There is an integer sequence $A=(A_1,A_2,\ldots,A_N)$ of length $N$ , where all elements are initially set to $0$ . Also, there is a set $S$ , which is initially empty.

Perform the following $Q$ queries in order. Find the value of each element in the sequence $A$ after processing all $Q$ queries. The $i$ -th query is in the following format:

An integer $x_i$ is given. If the integer $x_i$ is contained in $S$ , remove $x_i$ from $S$ . Otherwise, insert $x_i$ to $S$ . Then, for each $j=1,2,\ldots,N$ , add $∣ S ∣$ to $A_j$ if $j\in S$ .

Here, $∣ S ∣$ denotes the number of elements in the set $S$ . For example, if $S=\lbrace 3,4,7\rbrace$ , then $∣ S ∣ = 3$ .

思路：如果直接模拟，显然会T；直接模拟，在每次需要更新时，都要遍历一次A，时间复杂度为O（QN），我们可以试着变成O（Q+N）（log是不可行的因为始终要遍历一次Q和N）；顺着这个想，发现可以记录每次需要更新的值的前缀和，因为每个A的更新都是连续的一段|s|的和，大致是这么个想法，接下来看代码吧

AC Code

#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define int long long
#define pii pair<int, int>
#define pb push_back
#define gcd __gcd
#define lcm(a, b) (a * b) / gcd(a, b)
#define all(a) a.begin(), a.end()
#define mem(a, x) memset(a, x, sizeof(a))
#define f(i, s, e) for (int i = s; i <= e; i++)
#define ff(i, s, e) for (int i = s; i >= e; i--)
#define setbits(x) __builtin_popcount(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 100000007
#define maxn (ll)(2e5 + 5000)
#define INF LONG_LONG_MAX
using namespace std;
// set<int>::iterator it;
int n, q;
map<int, int> mp;
map<int, vector<int>> mp1;
set<int> st;
int prefix[maxn] = {0};
int q1[maxn];
signed main(void)
{
    ios::sync_with_stdio(false), cin.tie(nullptr);
    cin >> n >> q;
    f(i, 1, q)
    {
        cin >> q1[i];
        mp[q1[i]]++;
    }
    f(i, 1, q)
    {
        if (mp[q1[i]] == 1)
        {
            mp1[q1[i]].pb(i);
            mp1[q1[i]].pb(q);
        }
        else if (mp[q1[i]] > 1)
        {
            if (mp1[q1[i]].size() % 2 != 0 && mp1[q1[i]].size() != 0)
            {
                mp1[q1[i]].pb(i - 1); // 右端点减一
            }
            else
            {
                mp1[q1[i]].pb(i);
            }
        }
    }
    f(i, 1, q)
    {
        if (mp1[q1[i]].size() % 2 != 0)
        {
            mp1[q1[i]].pb(q);
        }
    }
    f(i, 1, q)
    {
        if (st.find(q1[i]) != st.end())
        {
            st.erase(q1[i]);
        }
        else
        {
            st.insert(q1[i]);
        }
        prefix[i] = st.size() + prefix[i - 1];
    }
    f(i, 1, n)
    {
        int sum = 0;
        for (int j = 0; j < mp1[i].size(); j += 2)
        {
            sum += prefix[mp1[i][j + 1]] - prefix[mp1[i][j] - 1];
        }
        cout << sum << " ";
    }

    return 0;
}

总结：D题调太久了，E没时间写了，C题又没过，mmp，前段时间一直没怎么训练，蓝桥杯估计要寄，真的是大本钟下寄快递——上面摆下面寄

TINYST

关注

14
点赞
踩
10

收藏

觉得还不错? 一键收藏
1
评论
AtCoder Beginner Contest 347（A~E）

You are given positive integers NNN and KKK, and a sequence of length NNN, A=(A1,A2,…,AN)A=(A_1,A_2,\ldots,A_N)A=(A1,A2,…,AN).Extract all elements of AAA that are multiples of KKK, divide them by KKK, and print the quotients.B - SubstringProblem State
复制链接

扫一扫