Submission #76674075

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 card_s {
  struct card_s *sita, *ue;
};
struct card_s cards[312345];
struct card_s yama[312345];
int main(void) {
  int N, Q;
  int i;
  if (scanf("%d%d", &N, &Q) != 2) return 1;
  for (i = 1; i <= N; i++) {
    yama[i].ue = &cards[i];
    cards[i].sita = &yama[i];
  }
  for (i = 0; i < Q; i++) {
    int C, P;
    if (scanf("%d%d", &C, &P) != 2) return 1;
    if (cards[P].ue != NULL) {
      /* カード P が一番上でない */
      printf("f*ck %d %d %d\n", i, C, P);
      return 72;
    }
    cards[C].sita->ue = NULL;
    cards[C].sita = &cards[P];
    cards[P].ue = &cards[C];
  }
  for (i = 1; i <= N; i++) {
    int cnt = 0;
    struct card_s *p = yama[i].ue;
    while (p != NULL) {
      cnt++;
      p = p->ue;
    }
    printf(" %d" + (i == 1), cnt);
  }
  putchar('\n');
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

struct card_s {
	struct card_s *sita, *ue;
};

struct card_s cards[312345];
struct card_s yama[312345];

int main(void) {
	int N, Q;
	int i;
	if (scanf("%d%d", &N, &Q) != 2) return 1;
	for (i = 1; i <= N; i++) {
		yama[i].ue = &cards[i];
		cards[i].sita = &yama[i];
	}
	for (i = 0; i < Q; i++) {
		int C, P;
		if (scanf("%d%d", &C, &P) != 2) return 1;
		if (cards[P].ue != NULL) {
			/* カード P が一番上でない */
			printf("f*ck %d %d %d\n", i, C, P);
			return 72;
		}
		cards[C].sita->ue = NULL;
		cards[C].sita = &cards[P];
		cards[P].ue = &cards[C];
	}
	for (i = 1; i <= N; i++) {
		int cnt = 0;
		struct card_s *p = yama[i].ue;
		while (p != NULL) {
			cnt++;
			p = p->ue;
		}
		printf(" %d" + (i == 1), cnt);
	}
	putchar('\n');
	return 0;
}

Submission Info

Judge Result