제출 #470450

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
470450		Return_0	Port Facility (JOI17_port_facility)	C++17	10 / 100	2 ms	460 KiB

port_facility

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;
 
#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()
 
cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;
 
template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;
 
cl N = 1e6 + 7;
 
ll par [N], epr [N], a [N << 1], A [N], B [N], cnt [N], n, _n;
set <ll> st;

pll root (cl &v) {
	if (!par[v]) return {v, 0};
	pll p = root(par[v]);
	return {par[v] = p.fr, epr[v] ^= p.sc};
}
inline bool unite (ll v, ll u) {
	pll p1 = root(v), p2 = root(u);
	if (p1.fr == p2.fr) {
		if (p1.sc == p2.sc) { cout<< 0 << endl; exit(0); }
		return false;
	}
	v = p1.fr; u = p2.fr;
	return par[u] = v, epr[u] = p2.sc ^ 1, _n--, true;
}

int main ()
{
	cin.tie(0)->sync_with_stdio(false);
	
	cin>> n; _n = n;
	for (ll i = 1; i <= n; i++) cin>> A[i] >> B[i], a[A[i]] = i, a[B[i]] = i + n;
	st.insert(inf);
	for (ll i = 1, x; i <= n + n; i++) if (a[i] <= n) {
		x = a[i];
		for (auto it = st.lower_bound(A[x]); *it < B[x];) {
			unite(x, a[*it] - n);
			cnt[a[*it]]++;
			if (cnt[a[*it]] > 10) it++, st.erase(prev(it));
			else it++;
		}
		st.insert(B[x]);
	}
	for (n = 1; _n--; n = (n + n) % mod);
	cout<< n << endl;
 
	cerr<< "\n" __TIMESTAMP__ " - Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
 
	return 0;
}
/*
4
1 3
2 5
4 8
6 7
 
*/

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