제출 #531855

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531855		hoanghq2004	Diversity (CEOI21_diversity)	C++14	0 / 100	1 ms	320 KiB

diversity

#include <bits/stdc++.h>
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 3e5 + 10;

int n, q;
int a[N];
long long ans = 0;

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    cin >> n >> q;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    sort(a + 1, a + n + 1);
    vector <int> s;
    for (int i = 1; i <= n; ) {
        int j = i;
        while (j <= n && a[i] == a[j]) ++j;
        int L = i - 1, R = n - j + 1;
        ans += 1LL * (j - i) * L + 1LL * (j - i) * R;
        ans += 1LL * L * R;
        ans += 1LL * (j - i) * (j - i + 1) / 2;
        i = j;
    }
    cout << ans;
}

컴파일 시 표준 에러 (stderr) 메시지

diversity.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
diversity.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

• Subtask 1: 0 / 4
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 26
• Subtask 6: 0 / 36