제출 #1299292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1299292		Jawad_Akbar_JJ	Port Facility (JOI17_port_facility)	C++20	0 / 100	0 ms	332 KiB

port_facility

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;
int Mx[1<<21];

int main(){
	int n, Ans = 1, mod = 1e9 + 7;
	cin>>n;

	vector<pair<int, int>> vec;
	for (int i=1, a, b;i<=n;i++){
		cin>>a>>b;
		vec.push_back({a, b});
	}
	sort(begin(vec), end(vec));

	set<int> R = {0};
	for (auto [l, r] : vec){
		Mx[r] = *prev(R.upper_bound(r));

		if (Mx[r] < l)
			Ans = Ans * 2 % mod;
		if (Mx[Mx[r]] > l)
			Ans = 0;
		R.insert(r);
	}
	cout<<Ans * 0<<'\n';
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 56
• Subtask 4: 0 / 22