oj.uz

답안 #1034222

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034222 2024-07-25T10:49:00 Z vjudge1 Diversity (CEOI21_diversity) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
 map<int, int> val;
 
 bool cmp(int a, int b){
    return val[a] < val[b];
 }
 
signed main()
{
    int n, q; cin >> n >> q;
    vector<int> a(n);
   
    for (int i = 0; i < n; i++){
        cin >> a[i];
        val[a[i]]++;
    }
    sort(a.begin(), a.end(), cmp);
    
    int ans = 0;
    while(q--){
        int l, r; cin >> l >> r;
        l--; r--;
        for (int i = 0; i < n; i++){
            set<int> v;
            for (int j = i; j < n; j++){
                v.insert(a[j]);
                ans += v.size();
            }
        }
    }
    cout << ans << endl;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 26.0

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

Subtask #6
0 / 36.0

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