제출 #9353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
9353		shashack	N-orthotope (kriii2_N)	C++98	4 / 4	0 ms	1676 KiB

N

#include<iostream>
#include<vector>
using namespace std;
int main(){
	int N;
	cin >> N;
	vector<pair<int, int> > one(N);
	vector<pair<int, int> > two(N);
	for (int i = 0; i < N; i++){
		int l, r; cin >> l >> r;
		one[i] = make_pair(l, r);
	}
	for (int i = 0; i < N; i++){
		int l, r; cin >> l >> r;
		two[i] = make_pair(l, r);
	}
	int ans = 0;
	bool check = false;
	for (int i = 0; i < N; i++){
		if (one[i].second < two[i].first || one[i].first > two[i].second)
			check = true;
		else if (one[i].second == two[i].first || one[i].first == two[i].second)
			continue;
		else
			ans++;
	}
	if (check) cout << -1 << endl;
	else cout << ans << endl;
	return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 3 / 3