oj.uz

답안 #989514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989514 2024-05-28T08:46:55 Z yoav_s Diversity (CEOI21_diversity) C++17
14 / 100
 7000 ms 5816 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 = (N * (N + 1)) / 2 * segments.size();
    for (ll x : segments)
    {
        ll r = l + x - 1;
        res -= (l * (l + 1)) / 2;
        res -= (N - r - 1) * (N - r) / 2;
        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));
    ll mini = evaluate(segments);
    while (next_permutation(all(segments)))
    {
        mini = min(mini, evaluate(segments));
    }
    cout << mini << "\n";
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2712 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 3 ms 2908 KB Output is correct
4 Correct 15 ms 3676 KB Output is correct
5 Correct 103 ms 4700 KB Output is correct
6 Correct 1024 ms 5720 KB Output is correct
7 Correct 1000 ms 5748 KB Output is correct
8 Correct 1071 ms 5720 KB Output is correct
9 Correct 1043 ms 5764 KB Output is correct
10 Correct 1006 ms 5808 KB Output is correct
11 Correct 1010 ms 5784 KB Output is correct
12 Correct 1014 ms 5816 KB Output is correct
13 Correct 1010 ms 5784 KB Output is correct
14 Correct 994 ms 5716 KB Output is correct
15 Correct 1029 ms 5720 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 3 ms 2908 KB Output is correct
4 Correct 15 ms 3676 KB Output is correct
5 Correct 103 ms 4700 KB Output is correct
6 Correct 1024 ms 5720 KB Output is correct
7 Correct 1000 ms 5748 KB Output is correct
8 Correct 1071 ms 5720 KB Output is correct
9 Correct 1043 ms 5764 KB Output is correct
10 Correct 1006 ms 5808 KB Output is correct
11 Correct 1010 ms 5784 KB Output is correct
12 Correct 1014 ms 5816 KB Output is correct
13 Correct 1010 ms 5784 KB Output is correct
14 Correct 994 ms 5716 KB Output is correct
15 Correct 1029 ms 5720 KB Output is correct
16 Correct 1725 ms 2652 KB Output is correct
17 Execution timed out 7011 ms 2648 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 3 ms 2908 KB Output is correct
4 Correct 15 ms 3676 KB Output is correct
5 Correct 103 ms 4700 KB Output is correct
6 Correct 1024 ms 5720 KB Output is correct
7 Correct 1000 ms 5748 KB Output is correct
8 Correct 1071 ms 5720 KB Output is correct
9 Correct 1043 ms 5764 KB Output is correct
10 Correct 1006 ms 5808 KB Output is correct
11 Correct 1010 ms 5784 KB Output is correct
12 Correct 1014 ms 5816 KB Output is correct
13 Correct 1010 ms 5784 KB Output is correct
14 Correct 994 ms 5716 KB Output is correct
15 Correct 1029 ms 5720 KB Output is correct
16 Correct 1725 ms 2652 KB Output is correct
17 Execution timed out 7011 ms 2648 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2712 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 3 ms 2908 KB Output is correct
14 Correct 15 ms 3676 KB Output is correct
15 Correct 103 ms 4700 KB Output is correct
16 Correct 1024 ms 5720 KB Output is correct
17 Correct 1000 ms 5748 KB Output is correct
18 Correct 1071 ms 5720 KB Output is correct
19 Correct 1043 ms 5764 KB Output is correct
20 Correct 1006 ms 5808 KB Output is correct
21 Correct 1010 ms 5784 KB Output is correct
22 Correct 1014 ms 5816 KB Output is correct
23 Correct 1010 ms 5784 KB Output is correct
24 Correct 994 ms 5716 KB Output is correct
25 Correct 1029 ms 5720 KB Output is correct
26 Correct 1725 ms 2652 KB Output is correct
27 Execution timed out 7011 ms 2648 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2712 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 3 ms 2908 KB Output is correct
14 Correct 15 ms 3676 KB Output is correct
15 Correct 103 ms 4700 KB Output is correct
16 Correct 1024 ms 5720 KB Output is correct
17 Correct 1000 ms 5748 KB Output is correct
18 Correct 1071 ms 5720 KB Output is correct
19 Correct 1043 ms 5764 KB Output is correct
20 Correct 1006 ms 5808 KB Output is correct
21 Correct 1010 ms 5784 KB Output is correct
22 Correct 1014 ms 5816 KB Output is correct
23 Correct 1010 ms 5784 KB Output is correct
24 Correct 994 ms 5716 KB Output is correct
25 Correct 1029 ms 5720 KB Output is correct
26 Correct 1725 ms 2652 KB Output is correct
27 Execution timed out 7011 ms 2648 KB Time limit exceeded
28 Halted 0 ms 0 KB -