oj.uz

Submission #985002

# Submission time Handle Problem Language Result Execution time Memory
985002 2024-05-17T09:25:20 Z alexdd Diversity (CEOI21_diversity) C++17
4 / 100
 8 ms 2548 KB 
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n,q;
int a[300005];
int fr[300005];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>q;
    int mxm=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        fr[a[i]]++;
        mxm=max(mxm,a[i]);
    }
    int qle,qri;
    for(int i=1;i<=q;i++)
    {
        cin>>qle>>qri;
    }
    sort(fr+1,fr+1+mxm);
    vector<int> vle,vri;
    for(int i=1;i+1<=mxm;i+=2)
    {
        if(i%2==1 || 1)
        {
            vle.push_back(fr[i]);
            vri.push_back(fr[i+1]);
        }
        else
        {
            vle.push_back(fr[i+1]);
            vri.push_back(fr[i]);
        }
    }
    if(mxm%2==1) vle.push_back(fr[mxm]);
    vector<int> aux = vle;
    for(int i=(int)vri.size()-1;i>=0;i--)
        aux.push_back(vri[i]);
    long long pref=0,rez=0;
    for(auto x:aux)
    {
        rez += (pref+x)*(n-pref);
        rez -= x*(x-1)/2;
        pref += x;
    }
    cout<<rez;
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 26.0

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

Subtask #6
0 / 36.0

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