Submission #72649358

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>
char have[2][256];
int main(void) {
  int n;
  int turn = 0, ba = 0;
  int i;
  int s1 = 0, s2 = 0;
  if (scanf("%d", &n) != 1) return 1;
  for (i = 0; i < n; i++) {
    int card;
    if (scanf("%d", &card) != 1) return 1;
    have[0][card] = 1;
  }
  for (i = 1; i <= 2 * n; i++) {
    have[1][i] = !have[0][i];
  }
  for (;;) {
    /* 手持ちのカードが無くなったかを判定 */
    int exists = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

char have[2][256];

int main(void) {
	int n;
	int turn = 0, ba = 0;
	int i;
	int s1 = 0, s2 = 0;
	if (scanf("%d", &n) != 1) return 1;
	for (i = 0; i < n; i++) {
		int card;
		if (scanf("%d", &card) != 1) return 1;
		have[0][card] = 1;
	}
	for (i = 1; i <= 2 * n; i++) {
		have[1][i] = !have[0][i];
	}
	for (;;) {
		/* 手持ちのカードが無くなったかを判定 */
		int exists = 0;
		for (i = 1; i <= 2 * n; i++) {
			if (have[0][i]) exists |= 1;
			if (have[1][i]) exists |= 2;
		}
		if (exists != 3) break;
		/* 出すカードを決める */
		exists = 0;
		for (i = 1; i <= 2 * n; i++) {
			if (have[turn][i] && ba < i) {
				ba = i;
				have[turn][i] = 0;
				exists = 1;
				break;
			}
		}
		if (!exists) ba = 0; /* パス */
		turn = !turn;
	}
	for (i = 1; i <= 2 * n; i++) {
		if (have[1][i]) s1++;
		if (have[0][i]) s2++;
	}
	printf("%d\n%d\n", s1, s2);
	return 0;
}

Submission Info

Judge Result