Submission #74707710

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <stdio.h>
struct node_s {
  int A;
  struct node_s *prev, *next;
};
struct node_s nodes[212345];
int main(void) {
  int N, i;
  struct node_s *cur;
  int ans;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 1; i <= N; i++) {
    if (scanf("%d", &nodes[i].A) != 1) return 1;
    nodes[i].prev = &nodes[i - 1];
    nodes[i].next = &nodes[i + 1];
  }
  nodes[N].next = NULL;
  nodes[0].next = &nodes[1];
  ans = N;
  cur = &nodes[1];
  for (;;) {
    /* 4つ揃ったか判定 */
    int combo = 0;
    struct node_s *cur2;
    for (cur2 = cur, i = 0; cur2 != NULL && i < 4; cur2 = cur2->next, i++) {
      if (cur->A == cur2->A) combo++;
    }
    if (i < 4) break; /* 4つ揃わず、終端を迎えた */
    if (combo == 4) {
      /* 揃った → 消して3個戻す */
      if (cur2 != NULL) cur2->prev = cur->prev;
      cur->prev->next = cur2;
      ans -= 4;
      for (i = 0; i < 3 && cur->prev != NULL; i++) {
        cur = cur->prev;
      }
    } else {
      /* 揃ってない → 次へ */
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

struct node_s {
	int A;
	struct node_s *prev, *next;
};

struct node_s nodes[212345];

int main(void) {
	int N, i;
	struct node_s *cur;
	int ans;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d", &nodes[i].A) != 1) return 1;
		nodes[i].prev = &nodes[i - 1];
		nodes[i].next = &nodes[i + 1];
	}
	nodes[N].next = NULL;
	nodes[0].next = &nodes[1];
	ans = N;
	cur = &nodes[1];
	for (;;) {
		/* 4つ揃ったか判定 */
		int combo = 0;
		struct node_s *cur2;
		for (cur2 = cur, i = 0; cur2 != NULL && i < 4; cur2 = cur2->next, i++) {
			if (cur->A == cur2->A) combo++;
		}
		if (i < 4) break; /* 4つ揃わず、終端を迎えた */
		if (combo == 4) {
			/* 揃った → 消して3個戻す */
			if (cur2 != NULL) cur2->prev = cur->prev;
			cur->prev->next = cur2;
			ans -= 4;
			for (i = 0; i < 3 && cur->prev != NULL; i++) {
				cur = cur->prev;
			}
		} else {
			/* 揃ってない → 次へ */
			cur = cur->next;
		}
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result