Submission #1610477

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
int a,b,c,n,x[1000][4]={},li[300]={};
set<int> st1,st2;

int main(){
	cin >> a >> b >> c >> n;
	REP(i,0,n){
		cin >> x[i][0] >> x[i][1] >> x[i][2] >> x[i][3];
		if(x[i][3]){
			st1.insert(x[i][0]);
			st1.insert(x[i][1]);
			st1.insert(x[i][2]);
		}
	}
	
	REP(i,0,n){
		if(x[i][3]) continue;
		else{
			if(st1.count(x[i][0])){
				if(st1.count(x[i][1])) st2.insert(x[i][2]);
				else if(st1.count(x[i][2])) st2.insert(x[i][1]);
			}else if(st1.count(x[i][1])){
				if(st1.count(x[i][0])) st2.insert(x[i][2]);
				else if(st1.count(x[i][2])) st2.insert(x[i][0]);
			}else if(st1.count(x[i][2])){
				if(st1.count(x[i][0])) st2.insert(x[i][1]);
				else if(st1.count(x[i][1])) st2.insert(x[i][0]);
			}
		}
	}
	
	REP(i,1,a+b+c+1){
		if(st1.count(i)) cout << 1 << endl;
		else if(st2.count(i)) cout << 0 << endl;
		else cout << 2 << endl;
	}

	return 0;
}

Submission Info

Judge Result