제출 #957305

#제출 시각아이디문제언어결과실행 시간메모리
957305LucaIlieDiversity (CEOI21_diversity)C++17
0 / 100
1 ms600 KiB
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5; int a[MAX_N + 1]; int main() { int n, q; cin >> n >> q; for ( int i = 1; i <= n; i++ ) cin >> a[i]; while ( q-- ) { int l, r; cin >> l >> r; vector<int> b; b.push_back( 0 ); for ( int i = l; i <= r; i++ ) b.push_back( a[i] ); sort( b.begin(), b.end() ); long long ans = 0; for ( int i = 1; i < b.size(); i++ ) { int p = (b[i] != b[i - 1] ? 0 : i - 1); ans += (i - p) * (b.size() - i); } cout << ans << "\n"; } return 0; }

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

diversity.cpp: In function 'int main()':
diversity.cpp:27:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         for ( int i = 1; i < b.size(); i++ ) {
      |                          ~~^~~~~~~~~~
#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...