提出 #75896927

---

ソースコード 拡げる

#include <stdio.h>

#define KI_MAX (1 << 19) /* 524288 */
#define INF 1010101010

int ki[KI_MAX * 2 - 1];

void ki_set(int pos, int value) {
	pos += KI_MAX - 1;
	ki[pos] = value;
	do {
		pos = (pos - 1) / 2;
		ki[pos] = ki[pos * 2 + 1];
		if (ki[pos * 2 + 2] < ki[pos]) ki[pos] = ki[pos * 2 + 2];
	} while (pos > 0);
}

int N, Q;
int A[312345];
int K[212345];
int B[212345][5];

int main(void) {
	int i, j;
	if (scanf("%d%d", &N, &Q) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	for (i = 0; i < Q; i++) {
		if (scanf("%d", &K[i]) != 1) return 1;
		for (j = 0; j < K[i]; j++) {
			if (scanf("%d", &B[i][j]) != 1) return 1;
			B[i][j]--;
		}
	}

	for (i = 0; i < N; i++) ki[KI_MAX - 1 + i] = A[i];
	for (i = N; i < KI_MAX; i++) ki[KI_MAX - 1 + i] = INF;
	for (i = KI_MAX - 2; i >= 0; i--) {
		ki[i] = ki[i * 2 + 1];
		if (ki[i * 2 + 2] < ki[i]) ki[i] = ki[i * 2 + 2];
	}

	for (i = 0; i < Q; i++) {
		for (j = 0; j < K[i]; j++) ki_set(B[i][j], INF);
		printf("%d\n", ki[0]);
		for (j = 0; j < K[i]; j++) ki_set(B[i][j], A[B[i][j]]);
	}
	return 0;
}

提出情報

ジャッジ結果