제출 #495599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495599		Victor	Diversity (CEOI21_diversity)	C++17	4 / 100	7071 ms	3020 KiB

diversity

// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

int n, arr[300001], q;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    vii types(300001, {0, 0});
    cin >> n >> q;
    rep(i, 0, n) {
        cin >> arr[i];
        ++types[arr[i]].first;
        types[arr[i]].second = arr[i];
    }

    sort(all(types));
    int lo = 0, hi = n;
    bool side = 0;

    trav(item, types) {
        int type, cnt;
        tie(cnt, type) = item;
        if (!cnt) continue;

        if (side) {
            rep(i, hi - cnt, hi) arr[i] = type;
            hi -= cnt;
        } else {
            rep(i, lo, lo + cnt) arr[i] = type;
            lo += cnt;
        }

        side ^= 1;
    }

    if (q == 1) {
        int ans = 0;
        rep(i, 0, n) {
            uset<int> seen;
            rep(j, i, n) {
                seen.insert(arr[j]);
                ans += sz(seen);
            }
        }
        cout << ans << endl;
    }
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 26
• Subtask 6: 0 / 36