제출 #967558

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
967558		anton	Diversity (CEOI21_diversity)	C++17	38 / 100	7077 ms	12996 KiB

diversity

#include<bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int, int>


int arithmetic(int v){
    return v*(v+1)/2;
}
signed main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    int n, q;
    cin>>n>>q;
    vector<int> v(n);
    map<int, int> oc;
    for(int i = 0; i<n; i++){
        cin>>v[i];
        oc[v[i]] ++;
    }

    deque<int> dq;
    vector<pii> groups;
    for(auto e: oc){
        groups.push_back(e);
    }
    auto cmp =[&](pii& a, pii& b){
        return a.second>b.second;
    };
    sort(groups.begin(), groups.end(), cmp);


    int res= 0;
    for(int i = 0; i<groups.size(); i++){
        if(i%2 == 0){
            dq.push_back(groups[i].second);
        }
        else{
            dq.push_front(groups[i].second);
        }
        res += arithmetic(groups[i].second);
    }


    for(int dist= 1; dist<dq.size(); dist++){
        for(int i =0; i<dq.size()-dist; i++){
            res += (dist+1)*dq[i] * dq[i + dist];
        }
    }
    for(int i = 0; i<q; i++){
        int a, b;
        cin>>a>>b;
        cout<<res<<endl;
    }

}

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

diversity.cpp: In function 'int main()':
diversity.cpp:35:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i = 0; i<groups.size(); i++){
      |                    ~^~~~~~~~~~~~~~
diversity.cpp:46:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int dist= 1; dist<dq.size(); dist++){
      |                      ~~~~^~~~~~~~~~
diversity.cpp:47:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   47 |         for(int i =0; i<dq.size()-dist; i++){
      |                       ~^~~~~~~~~~~~~~~

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