oj.uz

Submission #558103

# Submission time Handle Problem Language Result Execution time Memory
558103 2022-05-06T21:01:09 Z status_coding Diversity (CEOI21_diversity) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>

using namespace std;

long long n,q;
long long nr, ans;

long long a[300005];
long long fr[300005];

bool comp(int a, int b)
{
    return fr[a] > fr[b];
}
int main()
{
    cin>>n>>q;

    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        fr[ a[i] ] ++;
    }

    int l, r;
    cin>>l>>r;

    vector<pair<int, int>> v, aux;

    for(int i=1;i<=n;i++)
        if(fr[ a[i] ])
        {
            v.push_back({fr[ a[i] ], a[i] });
            fr[ a[i] ] = 0;
        }

    /*
    for(auto it : v)
        cout<<it.first<<' '<<it.second<<'\n';
    return 0;
    */

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

    int sum = 0;
    while((int)v.size() > 2)
    {
        if(sum + v.back().first <= n/2)
        {
            sum += v.back().first;
            aux.push_back(v.back());
            v.pop_back();
        }
        else
            break;
    }

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

    while(!v.empty())
    {
        aux.push_back(v.back());
        v.pop_back();
    }

    /*
    for(auto it : aux)
        cout<<it.first<<' '<<it.second<<'\n';
    return 0;
    */

    n=0;
    for(auto it : aux)
    {

        for(int j=1; j<= it.first; j++)
        {
            n++;
            a[n] = it.second;
        }
    }

    ans=0;

    for(int i=1;i<=n;i++)
    {
        nr = 1;

        for(int j=i;j<=n;j++)
        {
            if(j>i && a[j] != a[j-1])
                nr++;

            ans += nr;
        }
    }

    cout<<ans;
    return 0;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

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

Subtask #6
0 / 36.0

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