Submission #1054016

#TimeUsernameProblemLanguageResultExecution timeMemory
1054016sleepntsheepDiversity (CEOI21_diversity)C++14
0 / 100
1 ms348 KiB
#include <cstdio>
#include <algorithm>
#define N 300001

int n, q, a[N];
long long z, y;

int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);

  std::sort(a + 1, a + 1 + n);

  for (int c = 1, f = 0, i = n; i >= 1; --i) {
    z += (n - i + 1) * c - y;

    if (a[i] != a[i - 1]) {
        y += c;
      ++c;
    } else {
      y += c - 1;
    }
  }

  printf("%lld", z);

}

Compilation message (stderr)

diversity.cpp: In function 'int main()':
diversity.cpp:14:19: warning: unused variable 'f' [-Wunused-variable]
   14 |   for (int c = 1, f = 0, i = n; i >= 1; --i) {
      |                   ^
diversity.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d%d", &n, &q);
      |   ~~~~~^~~~~~~~~~~~~~~~
diversity.cpp:10:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |   for (int i = 1; i <= n; ++i) scanf("%d", a + 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...