oj.uz

Submission #955428

# Submission time Handle Problem Language Result Execution time Memory
955428 2024-03-30T12:21:05 Z yoav_s Diversity (CEOI21_diversity) C++17
4 / 100
 13 ms 3420 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef pair<ll,ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()

const ll INF = 1e18;
const ll mod = 1e9 + 7;
const ll maxValue = 3e5;

ll evaluate(v &segments)
{
    ll N = 0;
    for (ll x : segments) N += x;
    ll l = 0;
    ll res = 0;
    for (ll x : segments)
    {
        ll r = l + x - 1;
        res += ((r - l + 1) * (r - l + 2)) / 2 + l * (N - r - 1) + (r - l + 1) * l + (r - l + 1) * (N - r - 1);
        l += x;
    }
    return res;
}

ll limitingFactor(v &segments)
{
    ll N = 0;
    for (ll x : segments) N += x;
    ll l = 0;
    ll res = 0;
    for (ll x : segments)
    {
        ll r = l + x - 1;
        res += (N - r - 1) * l;
        l += x;
    }
    return res;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll N, Q;
    cin >> N >> Q;
    v a(N);
    for (ll i = 0; i < N; i++) cin >> a[i];
    sort(all(a));
    v histogram(maxValue + 1, 0);
    for (ll x : a) histogram[x]++;
    v segments;
    for (ll i = 0; i <= maxValue; i++) if (histogram[i] > 0) segments.pb(histogram[i]);
    sort(all(segments));
    v bestPerm(segments.size()); copy(all(segments),bestPerm.begin());
    if (segments.size() == 1)
    {
        cout << evaluate(bestPerm) << "\n";
        return 0;
    }
    ll cur = limitingFactor(segments);
    ll mini = cur;
    double time = 0.9999;
    ll iterations = 100000;
    
    while (iterations--)
    {
        ll i = rand() % (segments.size()); ll j = rand() % segments.size();
        swap(segments[i], segments[j]);
        ll newCur = limitingFactor(segments);
        if (newCur < mini) {copy(all(segments),bestPerm.begin()); mini = newCur;}
        if (newCur > cur && (rand() % ((ll)exp((cur - newCur) * 2 / time) + 1)) != 0) swap(segments[i], segments[j]);
        else cur = newCur;
        time *= 0.9999;
    }
    cout << evaluate(bestPerm) << "\n";
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 3 ms 2752 KB Output is correct
3 Correct 4 ms 2652 KB Output is correct
4 Correct 5 ms 2652 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2652 KB Output is correct
8 Correct 5 ms 2652 KB Output is correct
9 Correct 5 ms 2652 KB Output is correct
10 Correct 5 ms 2652 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2652 KB Output is correct
2 Correct 6 ms 2652 KB Output is correct
3 Correct 6 ms 2652 KB Output is correct
4 Incorrect 13 ms 3420 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2652 KB Output is correct
2 Correct 6 ms 2652 KB Output is correct
3 Correct 6 ms 2652 KB Output is correct
4 Incorrect 13 ms 3420 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2652 KB Output is correct
2 Correct 6 ms 2652 KB Output is correct
3 Correct 6 ms 2652 KB Output is correct
4 Incorrect 13 ms 3420 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 3 ms 2752 KB Output is correct
3 Correct 4 ms 2652 KB Output is correct
4 Correct 5 ms 2652 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2652 KB Output is correct
8 Correct 5 ms 2652 KB Output is correct
9 Correct 5 ms 2652 KB Output is correct
10 Correct 5 ms 2652 KB Output is correct
11 Correct 5 ms 2652 KB Output is correct
12 Correct 6 ms 2652 KB Output is correct
13 Correct 6 ms 2652 KB Output is correct
14 Incorrect 13 ms 3420 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 3 ms 2752 KB Output is correct
3 Correct 4 ms 2652 KB Output is correct
4 Correct 5 ms 2652 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 5 ms 2652 KB Output is correct
7 Correct 5 ms 2652 KB Output is correct
8 Correct 5 ms 2652 KB Output is correct
9 Correct 5 ms 2652 KB Output is correct
10 Correct 5 ms 2652 KB Output is correct
11 Correct 5 ms 2652 KB Output is correct
12 Correct 6 ms 2652 KB Output is correct
13 Correct 6 ms 2652 KB Output is correct
14 Incorrect 13 ms 3420 KB Output isn't correct
15 Halted 0 ms 0 KB -