Codeforces Round #780 (Div. 3)（7/7）

Problem - A - Codeforces

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <string>
#include <cstring>
using namespace std;




int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    int t;
    cin >> t;
    while (t--) {
        int a, b;
        cin >> a >> b;
        if (a == 0) {
            cout << "1\n";
            continue;
        }
        else {
            cout << a + 2 * b + 1 << '\n';
        }
    }

    return 0;
}

Problem - B - Codeforces

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <string>
#include <cstring>
using namespace std;




int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        for (int &x : a) {
            cin >> x;
        }
        if (n == 1 && a[0] > 1) {
            cout << "NO\n";
            continue;
        }
        else if (n == 1 && a[0] == 1) {
            cout << "YES\n";
            continue;
        }
        sort(a.begin(), a.end());
        if (a[n - 1] - a[n - 2] <= 1) {
            cout << "YES\n";
        }
        else {
            cout << "NO\n";
        }
    }

    return 0;
}

Problem - C - Codeforces

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <string>
#include <cstring>
using namespace std;




int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    int t;
    cin >> t;
    while (t--) {
        string s;
        cin >> s;
        int len = s.size();
        s = '1' + s;
        vector<int> vis(26, -1);
        vector<int> dp(len + 1, 0x3f3f3f3f);
        dp[0] = 0;
        dp[1] = 1;
        vis[(int)s[1] - 'a'] = 1;
        for (int i = 2; i <= len; i++) {
            int tmp = (int)(s[i] - 'a');
            int l = vis[tmp];
            dp[i] = dp[i - 1] + 1;
            if (l != -1) {
                dp[i] = min(dp[i], dp[l - 1] + i - 1 - l);
            }
            vis[tmp] = i;
        }
        cout << dp[len] << '\n';
    }

    return 0;
}

Problem - D - Codeforces

AC代码：

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


int a[1000010], p[1000010], s[1000010];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        for(int i=1;i<=n;i++)
            cin>>a[i],p[i]=p[i-1]+(a[i]<0),s[i]=s[i-1]+(abs(a[i])>1);

        int A, B, C, l;
        A = n;
        B = C = l = a[n + 1] = 0;
        auto calc = [&](int l, int r) {
            if((p[r]-p[l-1])%2==0&&s[r]-s[l-1]>C)
                C=s[r]-s[l-1],A=l-1,B=n-r;
        };
        for (int i = 1; i <= n + 1; i++) {
            if (a[i] == 0) {
                for (int j = l + 1; j < i; j++) {
                    calc(l + 1, j);
                    calc(j, i - 1);
                }
                l = i;
            }
        }
        cout << A << " " << B << '\n';
    }

    return 0;
}

Problem - E - Codeforces

AC代码：

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



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<vector<int>> a(n, vector<int> (n));
        vector<int> cnt(n, 0);
        int num = 0;
        for (int i = 0; i < n; i++) {
            string s;
            cin >> s;
            for (int j = 0; j < n; j++) {
                if (s[j] == '1') {
                    num++;
                    a[i][j] = 1;
                }
                else {
                    a[i][j] = 0;
                }
            }
        }
        int cnt1 = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (a[j][(i + j) % n] == 1) {
                    cnt[i]++;
                }
            }
        }
        int ans = 0;
        for (int i = 0; i < n; i++) {
            ans = max(ans, cnt[i]);
        }
        cout << num + n - 2 * ans << '\n';


    }

    return 0;
}

Problem - F1 - Codeforces

前缀和+暴力

AC代码：

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



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        string s;
        cin >> s;
        s = '1' + s;
        vector<int> sum1(n + 1);
        vector<int> sum2(n + 1);
        for (int i = 1; i <= n; i++) {
                if (s[i] == '+') {
                    sum1[i] = sum1[i - 1] + 1;
                    sum2[i] = sum2[i - 1];
                }
                else {
                    sum2[i] = sum2[i - 1] + 1;
                    sum1[i] = sum1[i - 1];
                }
        }
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = i; j <= n; j++) {
                if (sum2[j] - sum2[i - 1] >= sum1[j] - sum1[i - 1] && (sum2[j] - sum2[i - 1] - sum1[j] + sum1[i - 1]) % 3 == 0) {
                    ans++;
                }
            }
        }
        cout << ans << '\n';
    }

    return 0;
}

Problem - F2 - Codeforces

树状数组优化

AC代码：

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

template <typename T>
struct Fenwick {
    const int n;
    vector<T> a;
    Fenwick(int n) : n(n), a(n) {}
    void add(int x, T v) {
        for (int i = x + 1; i <= n; i += i & -i) {
            a[i - 1] += v;
        }
    }
    T sum(int x) {
        T ans = 0;
        for (int i = x; i > 0; i -= i & -i) {
            ans += a[i - 1];
        }
        return ans;
    }
    T rangeSum(int l, int r) {
        return sum(r) - sum(l);
    }
};

void solve() {
    int n;
    string s;
    cin >> n;
    cin >> s;
    i64 ans = 0;
    for (int x = 0; x < 3; x++) {
        Fenwick<int> fen(2 * n + 1);
        int balance = n;
        int b = 0;
        if (x == 0) {
            fen.add(n, 1);
        }
        for (int i = 0; i < n; i++) {
            if (s[i] == '-') {
                b++;
                balance++;
            }
            else {
                b += 2;
                balance--;
            }
            if (b % 3 == x) {
                ans += fen.sum(balance + 1);
                fen.add(balance, 1);
            }
        }
    }
    cout << ans << '\n';
}

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

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

    return 0;
}