【Codeforces】 Round #702 (Div. 3）

12:05~14:05

前面两题因为各种细节把自己绕进去了。。改了好久，其实题目很简单orz

A. Dense Array

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
void solve()
{
    int n, sum = 0;
    cin >> n;
    int a[maxn];
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 2; i <= n; i++)
    {
        int x = max(a[i], a[i - 1]);
        int y = min(a[i], a[i - 1]);
        double kk = (double)x / (double)y;
        if (kk > 2)
        {
            if (kk <= 4.0)
                sum += 1;
            else if (kk > 4.0 && kk <= 8.0)
                sum += 2;
            else if (kk > 8.0 && kk <= 16.0)
                sum += 3;
            else if (kk > 16.0 && kk <= 32.0)
                sum += 4;
            else
                sum += 5;
        }
    }
    cout << sum << endl;
}

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

B. Balanced Remainders

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int a[maxn];
void solve()
{
    int n;
    cin >> n;
    memset(a, 0, sizeof a);
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        a[x % 3]++;
    }
    int ans = 0;
    for (int i = 0; i < 3; i++)
    {
        if (a[i] > n / 3)
        {
            ans += a[i] - n / 3;
            a[(i + 1) % 3] += a[i] - n / 3;
            a[i] = n / 3;
        }
        else if (a[i] < n / 3)
        {
            ans += n / 3 - a[i];
            a[(i + 2) % 3] -= n / 3 - a[i];
            a[i] = n / 3;
        }
        // cout << ans << " ";
        // for (int i = 0; i < 3; i++)
        //     cout << a[i] << " ";
        // cout << endl;
    }
    cout << ans << endl;
}

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

C. Sum of Cubes

枚举一个数，然后用二分判断是否有符合条件的第二个数
和之前求四个平方和的数那题一样。（枚举前三个数，二分判断是否有符合条件的第四个数）

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

bool check(long long x)
{
    long long s, e;
    long long mid;

    s = 1;
    e = 10000;
    while (s <= e)
    {
        mid = (s + e) / 2;

        if (mid * mid * mid == x)
            return true;
        else if (mid * mid * mid < x)
            s = mid + 1;
        else
            e = mid - 1;
    }

    return false;
}

void solve()
{
    long long x;
    cin >> x;
    long long a, b;
    for (a = 1; a * a * a <= x; a++)
    {
        if (check(x - a * a * a))
        {
            cout << "YES" << endl;
            return;
        }
    }
    cout << "NO" << endl;
    return;
}

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

D. Permutation Transformation

按题意建树即可。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int a[maxn], tr[maxn];
int maxx(int l, int r)
{
    int maxxx = l;
    for (int i = l; i <= r; i++)
        if (a[i] > a[maxxx])
            maxxx = i;
    return maxxx;
}
void build(int l, int r, int u)
{
    if (r < l)
        return;
    int m = maxx(l, r);
    tr[m] = u;
    build(l, m - 1, u + 1);
    build(m + 1, r, u + 1);
}

void solve()
{
    int n;
    cin >> n;
    memset(a, 0, sizeof a);
    memset(tr, 0, sizeof tr);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    build(0, n - 1, 0);
    for (int i = 0; i < n; i++)
        cout << tr[i] << " ";
    cout << endl;
}

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

E. Accidental Victory

步步为营的策略。从最小的数开始，每次和第一个大于自己的数合并，当出现不能合并的情况时，说明之前的所有数都不可能成为winner，记下他的下标（当然，可能有很多个，所以我们遍历整个数组去更新他），从后面开始输出即可。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
vector<pair<int, int>> v;
vector<int> ans;

void solve()
{
    v.clear();
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        v.push_back(make_pair(x, i));
    }

    sort(v.begin(), v.end());

    if (v[0].first == v[n - 1].first)
    {
        cout << n << endl;
        for (int i = 1; i <= n; i++)
            cout << i << " ";
        cout << endl;
        return;
    }

    ans.clear();
    long long sum = v[0].first;
    int idx = 0;

    for (int i = 1; i < n; i++)
    {
        if (sum < v[i].first)
        {
            idx = i;
        }

        sum += v[i].first;
    }

    for (int i = idx; i < n; i++)
        ans.push_back(v[i].second);

    sort(ans.begin(), ans.end());

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

    cout << endl;
}

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

F. Equalize the Array

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;

void solve()
{
    cin.tie(0);
    int n;
    cin >> n;
    map<int, int> cnt;
    //int sum[maxn];
    map<int, int> sum;
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        cnt[x]++;
    }

    for (auto x : cnt)
        sum[x.second]++;

    //(sum[n]-sum[i-1])*i 表示最后的数组中，出现i个的数的个数。

    for (int i = 1; i <= n; i++)
        sum[i] += sum[i - 1];

    int ans = n;
    for (int i = 1; i <= n; i++)
        ans = min(ans, n - (sum[n] - sum[i - 1]) * i);
    cout << ans << endl;
}

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