#864773 (C) No.2304 Distinct Elements

提出ソース

結果

問題	No.2304 Distinct Elements
ユーザー	ygussany
提出日時	2023-04-29 18:14:10
言語	C (gcc 12.3.0)
結果	WA
実行時間	-
コード長	3,671 bytes
コンパイル時間	309 ms
コンパイル使用メモリ	32,768 KB
実行使用メモリ	40,912 KB
最終ジャッジ日時	2024-11-18 12:29:09
合計ジャッジ時間	4,836 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	2 ms 6,816 KB
testcase_02	WA	-
testcase_03	AC	2 ms 6,820 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	105 ms 40,844 KB
testcase_10	AC	102 ms 40,836 KB
testcase_11	AC	104 ms 40,840 KB
testcase_12	AC	101 ms 38,860 KB
testcase_13	AC	101 ms 40,912 KB
testcase_14	WA	-
testcase_15	RE	-
testcase_16	RE	-
testcase_17	WA	-
testcase_18	RE	-
testcase_19	AC	1 ms 6,820 KB
testcase_20	WA	-
testcase_21	AC	1 ms 6,816 KB
testcase_22	WA	-
testcase_23	AC	1 ms 6,820 KB
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	AC	79 ms 33,668 KB
testcase_33	AC	7 ms 6,820 KB
testcase_34	AC	81 ms 32,184 KB
testcase_35	AC	92 ms 37,540 KB
testcase_36	AC	6 ms 6,816 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	AC	74 ms 29,716 KB
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	AC	1 ms 6,820 KB
testcase_61	AC	2 ms 6,816 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.c: In function 'merge_min_heap':
main.c:122:30: warning: passing argument 1 of 'push' from incompatible pointer type [-Wincompatible-pointer-types]
  122 |                         push(h, d);
      |                              ^
      |                              |
      |                              min_heap *
main.c:29:21: note: expected 'max_heap *' but argument is of type 'min_heap *'
   29 | void push(max_heap* h, data x)
      |           ~~~~~~~~~~^
main.c:129:30: warning: passing argument 1 of 'push' from incompatible pointer type [-Wincompatible-pointer-types]
  129 |                         push(hh, d);
      |                              ^~
      |                              |
      |                              min_heap *
main.c:29:21: note: expected 'max_heap *' but argument is of type 'min_heap *'
   29 | void push(max_heap* h, data x)
      |           ~~~~~~~~~~^

ソースコード

raw source code

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

void merge_sort(int n, int x[])
{
	static int y[200001] = {};
	if (n <= 1) return;
	merge_sort(n / 2, &(x[0]));
	merge_sort((n + 1) / 2, &(x[n/2]));
	
	int i, p, q;
	for (i = 0, p = 0, q = n / 2; i < n; i++) {
		if (p >= n / 2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

typedef struct {
	int key, id, left;
} data;

typedef struct {
	data obj[400001];
	int size;
} max_heap;

void push(max_heap* h, data x)
{
	int i = ++(h->size), j = i >> 1;
	data tmp;
	h->obj[i] = x;
	while (j > 0) {
		if (h->obj[i].key > h->obj[j].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j >>= 1;
		} else break;
	}
}

data pop(max_heap* h)
{
	int i = 1, j = 2;
	data output = h->obj[1], tmp;
	h->obj[1] = h->obj[(h->size)--];
	while (j <= h->size) {
		if (j < h->size && h->obj[j^1].key > h->obj[j].key) j ^= 1;
		if (h->obj[j].key > h->obj[i].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j <<= 1;
		} else break;
	}
	return output;
}

typedef struct {
	data *obj;
	int size, max_size, thr;
} min_heap;

void init_min_heap(min_heap* h, int s)
{
	h->max_size = s;
	h->size = 0;
	h->thr = 0;
	h->obj = (data*)malloc(sizeof(data) * (h->max_size + 1));
}

void min_push(min_heap* h, data x)
{
	int i = ++(h->size), j = i >> 1;
	data tmp;
	if (h->size > h->max_size) {
		h->max_size <<= 1;
		h->obj = (data*)realloc(h->obj, sizeof(data) * (h->max_size + 1));
	}
	h->obj[i] = x;
	while (j > 0) {
		if (h->obj[i].key < h->obj[j].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j >>= 1;
		} else break;
	}
}

data min_pop(min_heap* h)
{
	int i = 1, j = 2;
	data output = h->obj[1], tmp;
	h->obj[1] = h->obj[(h->size)--];
	while (j <= h->size) {
		if (j < h->size && h->obj[j^1].key < h->obj[j].key) j ^= 1;
		if (h->obj[j].key < h->obj[i].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j <<= 1;
		} else break;
	}
	return output;
}

void merge_min_heap(min_heap* h, min_heap* hh)
{
	int i;
	data d;
	if (h->size >= hh->size) {
		for (i = 1; i <= hh->size; i++) {
			d = hh->obj[i];
			d.key += h->thr - hh->thr;
			push(h, d);
		}
		free(hh->obj);
	} else {
		for (i = 1; i <= h->size; i++) {
			d = h->obj[i];
			d.key += hh->thr - h->thr;
			push(hh, d);
		}
		free(h->obj);
		*h = *hh;
	}
}

int main()
{
	int i, N, A[200001];
	scanf("%d", &N);
	for (i = 0; i < N; i++) scanf("%d", &(A[i]));
	merge_sort(N, A);
	
	int j, k;
	long long ans = 0;
	max_heap h;
	min_heap he[200001];
	data d, e;
	h.size = 0;
	d.key = A[0];
	d.left = A[0];
	d.id = 0;
	push(&h, d);
	init_min_heap(&(he[0]), 10);
	for (i = 1; i < N; i++) {
		d = pop(&h);
		if (A[i] > d.key + 1) {
			push(&h, d);
			d.key = A[i];
			d.left = A[i];
			d.id = i;
			push(&h, d);
			init_min_heap(&(he[i]), 10);
		} else if (A[i] == d.key + 1) {
			d.key++;
			push(&h, d);
		} else {
			j = d.id;
			if (abs(d.left - 1 - A[i]) - he[j].size < abs(d.key + 1 - A[i])) {
				ans += abs(d.left - 1 - A[i]) - he[j].size;
				he[j].thr++;
				while (he[j].size > 0 && he[j].obj[1].key == he[j].thr) min_pop(&(he[j]));
				d.left--;
				if (h.size > 0 && h.obj[1].key == d.left - 1) {
					h.obj[1].key = d.key;
					merge_min_heap(&(he[h.obj[1].id]), &(he[j]));
				} else {
					push(&h, d);
					e.key = d.key - A[i] + he[j].thr;
					min_push(&(he[j]), e);
				}
			} else {
				ans += ++d.key - A[i];
				push(&h, d);
				e.key = d.key - A[i] + he[j].thr;
				min_push(&(he[j]), e);
			}
		}
	}
	printf("%lld\n", ans);
	fflush(stdout);
	return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード