Submission #67395610

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 N;
int S[212345];
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", &S[i]) != 1) return 1;
    }
    if (S[0] * 2 >= S[N - 1]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#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 N;
int S[212345];

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", &S[i]) != 1) return 1;
		}
		if (S[0] * 2 >= S[N - 1]) {
			puts("2");
		} else if (N == 2) {
			puts("-1");
		} else {
			int cur = 0, cnt = 3, ok = 0;
			qsort(S + 1, N - 2, sizeof(*S), cmp);
			for (i = 1; i < N - 1; i++) {
				if (S[cur] * 2 < S[i]) {
					/* 次は、今置いてあるドミノで倒せない */
					if (i - 1 == cur || S[i - 1] * 2 < S[i]) {
						/* 今置いてあるドミノと次の間にドミノが無い場合、詰み */
						/* 1個前のドミノでこのドミノが倒せない場合、詰み */
						break;
					} else {
						/* 今置いてあるドミノの1個前のドミノを置く */
						cur = i - 1;
						cnt++;
					}
				}
				if (S[i] * 2 >= S[N - 1]) {
					/* このドミノでドミノNが倒せる */
					ok = 1;
					break;
				}
			}
			printf("%d\n", ok ? cnt : -1);
		}
	}
	return 0;
}

Submission Info

Judge Result