提出 #45738766

ソースコード 拡げる

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>
#include <string.h>
int N, M;
char* visited;
void dfs(int node, int parent) {
  char buffer[32];
  int k, i;
  int* edges;
  visited[node] = 1;
  if (scanf("%31s", buffer) != 1) exit(1);
  if (strcmp(buffer, "OK") == 0) exit(0);
  if (sscanf(buffer, "%d", &k) != 1) exit(1);
  edges = malloc(sizeof(*edges) * k);
  if (edges == NULL) exit(2);
  for (i = 0; i < k; i++) {
    if (scanf("%d", &edges[i]) != 1) exit(1);
  }
  for (i = 0; i < k; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int N, M;
char* visited;

void dfs(int node, int parent) {
	char buffer[32];
	int k, i;
	int* edges;
	visited[node] = 1;
	if (scanf("%31s", buffer) != 1) exit(1);
	if (strcmp(buffer, "OK") == 0) exit(0);
	if (sscanf(buffer, "%d", &k) != 1) exit(1);
	edges = malloc(sizeof(*edges) * k);
	if (edges == NULL) exit(2);
	for (i = 0; i < k; i++) {
		if (scanf("%d", &edges[i]) != 1) exit(1);
	}
	for (i = 0; i < k; i++) {
		if (!visited[edges[i]]) {
			printf("%d\n", edges[i]);
			fflush(stdout);
			dfs(edges[i], node);
		}
	}
	free(edges);
	printf("%d\n", parent);
	fflush(stdout);
}

int main(void) {
	if (scanf("%d%d", &N, &M) != 2) return 1;
	visited = calloc(N + 1, sizeof(*visited));
	if (visited == NULL) return 2;
	dfs(1, 0);
	return 0;
}

提出情報

ジャッジ結果