제출 #713191

#제출 시각아이디문제언어결과실행 시간메모리
713191PacybwoahDiversity (CEOI21_diversity)C++14
38 / 100
7090 ms9536 KiB
#include<iostream> #include<vector> #include<algorithm> #define ll long long using namespace std; int main(){ ll n,q; cin>>n>>q; if(q!=1) return 0; int a,b; vector<ll> vec(n); for(int i=0;i<n;i++) cin>>vec[i]; cin>>a>>b; vector<ll> cnt(300001); for(int i=0;i<n;i++) cnt[vec[i]]++; vector<ll> p; for(int i=0;i<=300000;i++){ if(cnt[i]>0) p.push_back(cnt[i]); } sort(p.begin(),p.end()); vector<ll> f; for(int i=0;i<p.size();i+=2){ f.push_back(p[i]); } for(int i=(p.size()%2==0?p.size()-1:p.size()-2);i>=0;i-=2) f.push_back(p[i]); ll sum=0,len=f.size(); for(ll i=0;i<len;i++){ sum+=f[i]*(f[i]+1)/2; for(ll j=i+1;j<len;j++){ sum+=f[i]*f[j]*(j-i+1); } } cout<<sum<<"\n"; }

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

diversity.cpp: In function 'int main()':
diversity.cpp:22:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i=0;i<p.size();i+=2){
      |                 ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...