제출 #204922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204922		hanagasumi	Port Facility (JOI17_port_facility)	C++17	0 / 100	5 ms	376 KiB

port_facility

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>
 
#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
// #define int ll
 
using namespace std;
typedef long long ll;
typedef long double ld;

struct cont {
	int a, b, i;
};


ll mod = 1e9 + 7;

signed main() {
	#ifdef PC 
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n;
	cin >> n;
	vector<cont> have(n);
	vector<int> color(n, 0);
	for (int i = 0; i < n; i++) {
		cin >> have[i].a >> have[i].b;
		have[i].i = i;
	}

	ll ans = 1;
	for (int i = 0; i < n; i++) {
		int now = 0;
		for (int j = 0; j < n; j++) {
			if(!(have[j].a < have[i].a && have[j].b < have[i].b))
				continue;
			if(have[j].b < have[i].a) 
				continue;
			now |= color[have[j].i];
		}
		if(now == 3) {
			ans = 0;
			break;
		}
		if(now == 0) {
			ans = (ans * 2) % mod;
			color[have[i].i] = 1;
		}
		else {
			color[have[i].i] = (3 ^ now);
		}
	}
	cout << ans << endl;

	return 0;
}

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