oj.uz

답안 #678171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678171 2023-01-05T09:32:16 Z gesgha Diversity (CEOI21_diversity) C++17
0 / 100
 4 ms 1492 KB 
#include <bits/stdc++.h>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define rf(i, a, b) for (int i = a; i >= b; i--)
#define fe(x, y) for(auto& x : y)

#define fi first
#define se second
#define pb push_back

#define all(x) x.begin(), x.end()
#define pw(x) (1LL << (x))
#define sz(x) (int)x.size()

using namespace std;

template <typename T>
using ve = vector <T>;

template <typename T>
bool umx(T& a, T b) {return a < b ? a = b, 1 : 0;}

template <typename T>
bool umn(T& a, T b) {return a > b ? a = b, 1 : 0;}


using ll = long long;
using pii = pair <int, int>;
using pll = pair <ll, ll>;


const int oo = 2e9;
const ll OO = 1e18;
const int N = 3e5 + 10;
int n, q;
int a[N];

void slv(int l, int r) {
    ll ans = 0;
    ve <int> A;
    fr(i, 0, n - 1) A.pb(a[i]);
    sort(A.begin() + l, A.begin() + r + 1);
    fr(i, l, r) {
        ve <int> cnt(N, 0);
        int C = 0;
        fr(j, i, r) {
            if(!cnt[A[j]]) C++;
            cnt[A[j]]++;
            ans += C;
        }
    }
    cout << ans << "\n";

}


int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // LOCAL
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    cin >> n >> q;
    fr(i, 0, n - 1) cin >> a[i];
    while (q--) {
        int l, r;
        cin >> l >> r; l--; r--;
        slv(l, r);
    }

    return 0;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 2 ms 1492 KB Output is correct
3 Incorrect 1 ms 1492 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1480 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1480 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1480 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 2 ms 1492 KB Output is correct
3 Incorrect 1 ms 1492 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 2 ms 1492 KB Output is correct
3 Incorrect 1 ms 1492 KB Output isn't correct
4 Halted 0 ms 0 KB -