(BOJ) 15973 두 박스

문제: https://www.acmicpc.net/problem/15973

 

소스 코드:

typedef pair<long long, long long> P;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL), cout.tie(NULL);
	
	P a1,a2, b1,b2;
	cin >> a1.first >> a1.second;
	cin >> a2.first >> a2.second;
	cin >> b1.first >> b1.second;
	cin >> b2.first >> b2.second;

	if (a1.first > b1.first) {
		swap(a1, b1);
		swap(a2, b2);
	}

	if (a1.second >= b1.second) {
		if (a1.first <= b1.first&& b1.first < a2.first) {
			if (a1.second == b2.second) {
				cout << "LINE\n";
				return 0;
			}
			else if (a1.second < b2.second) {
				cout << "FACE\n";
				return 0;
			}
		}
		else if (a2.first == b1.first) {
			if (a1.second == b2.second) {
				cout << "POINT\n";
				return 0;
			}
			else if (b2.second > a1.second) {
				cout << "LINE\n";
				return 0;
			}
		}
	}
	else {
		if (a1.first <= b1.first &&b1.first < a2.first) {
			if (a2.second == b1.second) {
				cout << "LINE\n";
				return 0;
			}
			else if (b1.second < a2.second) {
				cout << "FACE\n";
				return 0;
			}
		}
		else if (a2.first == b1.first) {
			if (a2 == b1) {
				cout << "POINT\n";
				return 0;
			}
			else if (b1.second < a2.second) {
				cout << "LINE\n";
				return 0;
			}
		}
	}
	cout << "NULL\n";
	return 0;

}