Codeforces Round #797 (Div. 3)

题目链接：Dashboard - Codeforces Round #797 (Div. 3) - Codeforces

A

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#define int long long 
using namespace std;

int t, n;

void solve()
{
    string s;
    cin >> s;
    int a[30];
    memset(a, 0, sizeof a);
    
    int maxx = -2, sum = 0;
    for (int i = 0; i < s.size(); i ++)
    {
        a[s[i] - 'a'] ++;
    }
    
    for (int i = 0; i <= 26; i ++)
    {
        if (maxx < a[i])
        {
            sum = i;
            maxx = a[i];
        }
    }
    
    cout << s.size() - a[sum] << endl;
}

signed main()
{
    cin >> t;
    while (t -- )
    {
        solve();
    }
    return 0;
}

B

#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <map>
#include <vector>
//#define int long long 
using namespace std;
const int N = 5e4 + 10;

int t, n;
int a[N], b[N];

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
        cin >> a[i];
    
    for (int i = 1; i <= n; i ++)
        cin >> b[i];
        
    int x = -1;
    for (int i = 1; i <= n; i ++)
    {
        x = max(x, a[i] - b[i]);
        if (a[i] - b[i] < 0)
        {
            cout << "NO" << endl;
            return ;
        }
    }
    
    for (int i = 1; i <= n; i ++)
    {
        a[i] -= x;
        if (a[i] < 0) a[i] = 0;
        if (a[i] != b[i])
        {
            cout << "NO" << endl;
            return ;
        }
    }
    
    cout << "YES" << endl;
}

int main()
{
    cin >> t;
    while (t -- )
    {
        solve();
    }
    return 0;
}

C

#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <map>
#include <vector>
#define int long long 
using namespace std;
const int N = 2e5 + 20;

int t, n;
int st[N], ed[N];

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i ++) cin >> st[i];
    for (int i = 1; i <= n; i ++) cin >> ed[i];
    
    for (int i = 1; i <= n; i ++)
    {
        cout << ed[i] - max(ed[i - 1], st[i]) << " ";
    }
    cout << endl;
}

signed main()
{
    cin >> t;
    while (t -- )
    {
        solve();
    }
    return 0;
}

D

#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <map>
#include <vector>
#define int long long 
using namespace std;
const int N = 2e5 + 20;

int t, n, k;
int a[N];

void solve()
{
    cin >> n >> k;
    string s;
    int x = 1, l = 0;
    cin >> s;
    a[0] = a[1] = 0;
    for (int i = 1; i <= n; i ++)
    {
        if (s[i - 1] == 'W') a[i] = a[i - 1] + 1;
        else a[i] = a[i - 1];
    }
    
    int minn = 1e9 + 20;
    for (int i = k; i <= n; i ++)
    {
        minn = min(minn, a[i] - a[i - k]);
    }
    
    cout << minn << endl;
}

signed main()
{
    cin >> t;
    while (t -- )
    {
        solve();
    }
    return 0;
}

E

题意

给定一个序列和一个数k,将序列中的数两两分组,总得分为每组两个数除以k的和,求和最大是多少

思路：

先将每个数全部除以K相加起来得到sum，sum是最基本的成本。用map统计每个数除以K后的余数。要使成本最小，使用双指针。用ans记录大的余数（右边）的个数。先将最大的和最小的进行匹配，取两者的最小值。将这个最小值加到sum中并将ans减去该最小值。然后将左右指针均向中间移动一位。如果较大的数依然没有用完那么他的个数依然记录在ans中。因为他与较大的数匹配也会超过K。最后剩下的ans两两匹配即除以二。

代码：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <vector>
#define int long long 
using namespace std;
typedef pair<int, int> PII;
const int N = 2e5 + 20;

int t, n, k;
int a[N];

void solve()
{
    int sum = 0;
    cin >> n >> k;
    map<int, int> mp;
    for (int i = 1; i <= n; i ++)
    {
        cin >> a[i];
        sum += a[i] / k;
        int x = a[i] % k;
        mp[x] ++;
    }
    
    int ans = 0;
    for (int i  = 1, j = k - 1; i <= j; i ++, j --)
    {
        ans += mp[j];
        if (i == j) break;
        int t = min(ans, mp[i]);
        sum += t;
        ans -= t;
    }
//    cout << sum << " " << ans << endl; 
    cout << sum + ans /2 << endl;
    
}

signed main()
{
    cin >> t;
    while (t -- )
    {
        solve();
    }
    return 0;
}

F

题意：

给出一个字符串和一个置换群,问按照置换群操作多少次后字符串会回到最初的状态

思路：

首先把置换拆成若干个环,环之间是独立的,答案就是每个环回到初始状态需要步数的最小公倍数.判断每个环的周期只需要暴力check环长的因数是否满足要求

代码：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#define int long long 
using namespace std;

int t, n;
int a[300], vis[300];
string s, str;

inline int read()
{
    int x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-') f = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
    return x * f;
}

void dfs(int x)
{
    if (vis[x]) return ;
    vis[x] = 1;
    str += s[x];
    dfs(a[x]);
}

int gcd(int i,int j)
{
    return j==0?i:gcd(j,i%j);
}

void solve()
{
    int ans = 1;
    cin >> n;
    cin >> s;
    for (int i = 0; i < n; i ++) 
    {
        cin >> a[i];
        a[i] --;
        vis[i] = 0;
    }
    vector<int> res;
    map<int, int> mp;
    for (int x = 0; x < n; x ++)
    {
        if (!vis[x])
        {
            str = "";
            dfs(x);
            int len = str.length();
            str += str;
            for (int i = 1,j = len; j < str.length(); i ++, j ++)
            {
                if (str.substr(i, len) == str.substr(0, len))
                {
                    if (!mp[i])
                    {
                        res.push_back(i);
                        mp[i] = 1;
                    }
                    break;
                }
            }
        }
    }
    
    for (int i = 0; i < res.size(); i ++)
    {
        int g = gcd(ans, res[i]);
        ans *= res[i]/g;
    }
    cout << ans << endl;
}

signed main()
{
    cin >> t;
    while (t -- )
    {
        solve();
    }
    return 0;
}

提交记录