oj.uz

Submission #1090816

# Submission time Handle Problem Language Result Execution time Memory
1090816 2024-09-18T19:56:07 Z farica Diversity (CEOI21_diversity) C++14
4 / 100
 9 ms 860 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int MAX_N = 3e5;

int b[MAX_N + 5];

void solve() {
    int n, q;
    cin >> n >> q;
    set<int>s;
    for(int i=0; i<n; ++i) {
        int x;
        cin >> x;
        ++b[x];
        s.insert(x);
    }
    int L, R;
    cin >> L >> R;
    ll ans = 0, cnt = 0, cnt2 = 0;
    vector<int>v;
    for(auto it = s.begin(); it != s.end(); ++it) v.push_back(b[*it]);
    sort(v.begin(), v.end());
    int last = 0;
    for(int i=0; i<v.size(); i+=2) {
        last = i;
        int cur = v[i];
        cnt += cnt2;
        cnt2 += cur;
        ans += (cur * (cur + 1))/2;
        ans += cnt * cur;
        cnt += cur;
    }
    if((v.size()-2) == last) ++last;
    else --last;
    for(int i=last; i>=0; i -= 2) {
        int cur = v[i];
        cnt += cnt2;
        cnt2 += cur;
        ans += (cur * (cur + 1))/2;
        ans += cnt * cur;
        cnt += cur;
    }
    cout << ans << endl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int t = 1;
    while(t--) solve();

    return 0;
}

Compilation message

diversity.cpp: In function 'void solve()':
diversity.cpp:27:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0; i<v.size(); i+=2) {
      |                  ~^~~~~~~~~
diversity.cpp:36:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if((v.size()-2) == last) ++last;
      |        ~~~~~~~~~~~~~^~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 26.0

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

Subtask #6
0 / 36.0

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