oj.uz

답안 #1048147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048147 2024-08-08T02:30:32 Z 12345678 Diversity (CEOI21_diversity) C++17
0 / 100
 1 ms 2508 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e5+5;

ll n, a[nx], v[nx], q, l, r, c, d, t, res;
map<ll, ll> mp;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>q;
    for (int i=1; i<=n; i++) cin>>a[i], mp[a[i]]++;
    cin>>c>>d;
    l=1, r=mp.size();
    for (auto [x, y]:mp)
    {
        t++;
        res+=y*(n-y)+y*(y+1)/2;
        if (t%2) v[l++]=y;
        else v[r--]=y;
    }
    for (int i=1; i<=mp.size(); i++) v[i]+=v[i-1];
    for (int i=1; i<=mp.size(); i++) res+=v[i-1]*(n-v[i]);
    cout<<res;
}

Compilation message

diversity.cpp: In function 'int main()':
diversity.cpp:26:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::map<long long int, long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for (int i=1; i<=mp.size(); i++) v[i]+=v[i-1];
      |                   ~^~~~~~~~~~~
diversity.cpp:27:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::map<long long int, long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int i=1; i<=mp.size(); i++) res+=v[i-1]*(n-v[i]);
      |                   ~^~~~~~~~~~~

Subtask #1
0 / 4.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 26.0

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

Subtask #6
0 / 36.0

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