Submission #72289127

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>
int a, b, c;
int N;
int i[1023], j[1024], k[1024], r[1024];
int ans[512];
int main(void) {
  int p;
  if (scanf("%d%d%d", &a, &b, &c) != 3) return 1;
  if (scanf("%d", &N) != 1) return 1;
  for (p = 0; p < N; p++) {
    if (scanf("%d%d%d%d", &i[p], &j[p], &k[p], &r[p]) != 4) return 1;
  }
  for (p = 1; p <= a + b + c; p++) ans[p] = 2;
  for (p = 0; p < N; p++) {
    if (r[p] == 1) {
      ans[i[p]] = 1;
      ans[j[p]] = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int a, b, c;
int N;
int i[1023], j[1024], k[1024], r[1024];

int ans[512];

int main(void) {
	int p;
	if (scanf("%d%d%d", &a, &b, &c) != 3) return 1;
	if (scanf("%d", &N) != 1) return 1;
	for (p = 0; p < N; p++) {
		if (scanf("%d%d%d%d", &i[p], &j[p], &k[p], &r[p]) != 4) return 1;
	}

	for (p = 1; p <= a + b + c; p++) ans[p] = 2;
	for (p = 0; p < N; p++) {
		if (r[p] == 1) {
			ans[i[p]] = 1;
			ans[j[p]] = 1;
			ans[k[p]] = 1;
		}
	}
	for (p = 0; p < N; p++) {
		if (r[p] == 0) {
			if (ans[i[p]] == 1 && ans[j[p]] == 1) ans[k[p]] = 0;
			if (ans[j[p]] == 1 && ans[k[p]] == 1) ans[i[p]] = 0;
			if (ans[k[p]] == 1 && ans[i[p]] == 1) ans[j[p]] = 0;
		}
	}

	for (p = 1; p <= a + b + c; p++) printf("%d\n", ans[p]);
	return 0;
}

Submission Info

Judge Result