Submission #64426090

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#define MAX 212345
int bit_table[MAX];
void bit_add(int pos, int value) {
  pos++;
  while (pos <= MAX) {
    bit_table[pos - 1] += value;
    pos += pos & (-pos);
  }
}
int bit_sum(int pos) {
  int sum = 0;
  pos++;
  while (pos > 0) {
    sum += bit_table[pos - 1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>

#define MAX 212345

int bit_table[MAX];

void bit_add(int pos, int value) {
	pos++;
	while (pos <= MAX) {
		bit_table[pos - 1] += value;
		pos += pos & (-pos);
	}
}

int bit_sum(int pos) {
	int sum = 0;
	pos++;
	while (pos > 0) {
		sum += bit_table[pos - 1];
		pos -= pos & (-pos);
	}
	return sum;
}

int N, M;
int A[MAX];

int ec[MAX], *es[MAX]; /* element count, elements */

int main(void) {
	int i;
	uint64_t ans = 0;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
		es[A[i]] = realloc(es[A[i]], sizeof(*es[A[i]]) + (ec[A[i]] + 1));
		if (es[A[i]] == NULL) return 2;
		es[A[i]][ec[A[i]]++] = i;
	}
	for (i = N - 1; i >= 0; i--) {
		ans += bit_sum(A[i] - 1);
		bit_add(A[i], 1);
	}
	printf("%" PRIu64 "\n", ans);
	for (i = M - 1; i > 0; i--) {
		int j;
		for (j = 0; j < ec[i]; j++) {
			ans += es[i][j] - j;
			ans -= (N - 1 - es[i][j]) - (ec[i] - 1 - j);
		}
		printf("%" PRIu64 "\n", ans);
	}
	return 0;
}

/*

k = 0 : 普通に求める
k = n + 1 : k = n のときから、
・最強だった B_i = M - 1 が最弱になる
・ほかの大小関係は変わらない
ので、A_i = M - 1 - n の右側にあるそれ以外の数を引いて、左側にあるそれ以外の数を足す

*/

Submission Info

Judge Result