Submission #75560736

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
#include <stdio.h>
#define MAX_N 4096
#define MAX_M 4096
int N, M;
int L[MAX_N];
int X[MAX_N][MAX_M];
char used[MAX_M];
int main(void) {
  int i, j;
  if (scanf("%d%d", &N, &M) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &L[i]) != 1) return 1;
    for (j = 0; j < L[i]; j++) {
      if (scanf("%d", &X[i][j]) != 1) return 1;
    }
  }
  for (i = 0; i < N; i++) {
    int ans = 0;
    for (j = 0; j < L[i]; j++) {
      if (!used[X[i][j]]) {
        ans = X[i][j];
        used[X[i][j]] = 1;
        break;
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

#define MAX_N 4096
#define MAX_M 4096

int N, M;
int L[MAX_N];
int X[MAX_N][MAX_M];

char used[MAX_M];

int main(void) {
	int i, j;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &L[i]) != 1) return 1;
		for (j = 0; j < L[i]; j++) {
			if (scanf("%d", &X[i][j]) != 1) return 1;
		}
	}
	for (i = 0; i < N; i++) {
		int ans = 0;
		for (j = 0; j < L[i]; j++) {
			if (!used[X[i][j]]) {
				ans = X[i][j];
				used[X[i][j]] = 1;
				break;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}

Submission Info

Judge Result