Submission #67652483

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>
int cmp(const void* x, const void* y) {
  int a = *(const int*)x, b = *(const int*)y;
  return a < b ? -1 : a > b;
}
int cmpk(const void* x, const void* y) {
  return cmp(y, x);
}
int N;
int A[212345];
int buf1s, buf2s;
int buf1[212345], buf2[212345];
int sort(void) {
  qsort(A, N, sizeof(*A), cmp);
  return 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return a < b ? -1 : a > b;
}

int cmpk(const void* x, const void* y) {
	return cmp(y, x);
}

int N;
int A[212345];

int buf1s, buf2s;
int buf1[212345], buf2[212345];

int sort(void) {
	qsort(A, N, sizeof(*A), cmp);
	return 1;
}

void foo(void) {
	int i;
	buf1s = 0;
	buf2s = 0;
	for (i = 0; i < N; i++) {
		if (A[i] >= 0) buf1[buf1s++] = A[i]; else buf2[buf2s++] = A[i];
	}
	if (buf1s > 0) qsort(buf1, buf1s, sizeof(*buf1), cmp);
	if (buf2s > 0) qsort(buf2, buf2s, sizeof(*buf2), cmpk);
}

/* プラスとマイナスを交互に、プラスから */
int hoge(void) {
	int i;
	foo();
	if (buf1s != buf2s && buf1s != buf2s + 1) return 0;
	for (i = 0; i < buf2s; i++) {
		A[i * 2] = buf1[i];
		A[i * 2 + 1] = buf2[i];
	}
	if (buf1s > buf2s) A[buf2s * 2] = buf1[buf2s];
	return 1;
}

/* プラスとマイナスを交互に、マイナスから */
int fuga(void) {
	int i;
	foo();
	if (buf1s != buf2s && buf1s + 1!= buf2s) return 0;
	for (i = 0; i < buf2s; i++) {
		A[i * 2] = buf2[i];
		A[i * 2 + 1] = buf1[i];
	}
	if (buf1s < buf2s) A[buf1s * 2] = buf2[buf1s];
	return 1;
}

int judge(int (*func)(void)) {
	int i;
	int ok = 1;
	if (!func()) return 0;
	for (i = 2; ok && i < N; i++) {
		/* A[i - 1] / A[i - 2] == A[i] / A[i - 1] */
		ok = (long long)A[i - 1] * A[i - 1] == (long long)A[i] * A[i - 2];
	}
	return ok;
}

int main(void) {
	int T, tc;
	if (scanf("%d", &T) != 1) return 1;
	for (tc = 0; tc < T; tc++) {
		int i;
		if (scanf("%d", &N) != 1) return 1;
		for (i = 0; i < N; i++) {
			if (scanf("%d", &A[i]) != 1) return 1;
		}
		puts(judge(sort) || judge(hoge) || judge(fuga) ? "Yes" : "No");
	}
	return 0;
}

Submission Info

Judge Result