oj.uz

Submission #914999

# Submission time Handle Problem Language Result Execution time Memory
914999 2024-01-23T06:26:23 Z KiaRez Port Facility (JOI17_port_facility) C++17
100 / 100
 2878 ms 161684 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 1e6+23, lg = 21;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, par[N], sz[N], val[N], vis[N], a[N], b[N];
int who[2*N], seg[2][5*N], cnt;

int getPar(int v) {return (par[v]==0 ? v : getPar(par[v]));}
int getVal(int v) {return (par[v]==0 ? val[v] : val[v]^getVal(par[v]));}
void merge(int v, int u) {
	if(getPar(v)==getPar(u)) {
		if(getVal(v) == getVal(u)) kill(0);
		return;
	}
	int x = (getVal(v) == getVal(u));
	v=getPar(v), u=getPar(u);
	if(sz[v] < sz[u]) swap(v, u);
	sz[v] += sz[u];
	par[u]=v;
	if(x==1) val[u] ^= 1;
	cnt--;
}

void build(int ind=1) {
	if(ind >= (1<<lg)) {
		int id = ind-(1<<lg)+1;
		if(id <= 2*n) {
			if(a[who[id]]==id) seg[0][ind] = who[id];
			else seg[1][ind] = who[id];
		}
		return;
	}
	build(2*ind); build(2*ind+1);
	if(seg[0][2*ind]==0 || b[seg[0][2*ind]] < b[seg[0][2*ind+1]]) seg[0][ind] = seg[0][2*ind+1];
	else seg[0][ind] = seg[0][2*ind];
	
	if(seg[1][2*ind]==0 || (seg[1][2*ind+1]>0 && a[seg[1][2*ind]]>a[seg[1][2*ind+1]])) seg[1][ind] = seg[1][2*ind+1];
	else seg[1][ind] = seg[1][2*ind];
}

void upd0(int ind, int val) {
	if(ind == 0) return;
	if(ind >= (1<<lg)) {
		seg[0][ind] = val;
	} else {
		if(seg[0][2*ind]==0 || b[seg[0][2*ind]] < b[seg[0][2*ind+1]]) seg[0][ind] = seg[0][2*ind+1];
		else seg[0][ind] = seg[0][2*ind];
	}
	upd0(ind/2, val);
}

void upd1(int ind, int val) {
	if(ind == 0) return;
	if(ind >= (1<<lg)) {
		seg[1][ind] = val;
	} else {
		if(seg[1][2*ind]==0 || (seg[1][2*ind+1]>0 && a[seg[1][2*ind]]>a[seg[1][2*ind+1]])) seg[1][ind] = seg[1][2*ind+1];
		else seg[1][ind] = seg[1][2*ind];
	}
	upd1(ind/2, val);
}

int qry0(int l, int r, int ind=1, int lc=1, int rc=(1<<lg)+1) {
	if(l>=rc || lc>=r) return 0;
	if(lc>=l && rc<=r) return seg[0][ind];
	int mid = (lc+rc)/2;
	int x=qry0(l, r, 2*ind, lc, mid), y=qry0(l, r, 2*ind+1, mid, rc);
	if(b[y] > b[x]) return y;
	return x;
}

int qry1(int l, int r, int ind=1, int lc=1, int rc=(1<<lg)+1) {
	if(l>=rc || lc>=r) return 0;
	if(lc>=l && rc<=r) return seg[1][ind];
	int mid = (lc+rc)/2;
	int x=qry1(l, r, 2*ind, lc, mid), y=qry1(l, r, 2*ind+1, mid, rc);
	if(x==0 || (a[y] < a[x] && y>0)) return y;
	return x;
}

void dfs(int v) {
	vis[v] = 1;
	upd0(a[v]+(1<<lg)-1, 0);
	upd1(b[v]+(1<<lg)-1, 0);
	while(true) {
		int u = qry0(a[v], b[v]);
		if(u==0 || b[u]<b[v]) break;
		merge(v, u);
		dfs(u);
	}
	while(true) {
		int u = qry1(a[v], b[v]);
		if(u==0 || a[u]>a[v]) break;
		merge(v, u);
		dfs(u);
	}
}

int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n; cnt=n;
	fill(sz+1, sz+n+1, 1);
	for(int i=1; i<=n; i++) {
		cin>>a[i]>>b[i]; 
		who[a[i]] = who[b[i]] = i;
	}

	build(1);

	for(int i=1; i<=n; i++) {
		if(vis[i] == 1) continue;
		dfs(i);
	}

	vector<pii> vec[2];
	for(int i=1; i<=n; i++) {
		vec[getVal(i)].pb({a[i], b[i]});
	}
	for(int i=0; i<2; i++) {
		sort(all(vec[i]));
		set<int> st;
		for(auto it : vec[i]) {
			auto it2 = st.lower_bound(it.F);
			if(it2!=st.end() && (*it2) < it.S) kill(0);
			st.insert(it.S);
		}
	}

	cout<<poww(2, cnt);

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 26204 KB Output is correct
2 Correct 14 ms 26204 KB Output is correct
3 Correct 14 ms 26200 KB Output is correct
4 Correct 14 ms 26204 KB Output is correct
5 Correct 14 ms 26204 KB Output is correct
6 Correct 14 ms 26204 KB Output is correct
7 Correct 14 ms 26204 KB Output is correct
8 Correct 15 ms 26204 KB Output is correct
9 Correct 14 ms 26052 KB Output is correct
10 Correct 15 ms 26204 KB Output is correct
11 Correct 15 ms 26204 KB Output is correct
12 Correct 14 ms 26204 KB Output is correct
13 Correct 14 ms 26204 KB Output is correct
14 Correct 14 ms 27228 KB Output is correct
15 Correct 15 ms 26196 KB Output is correct
16 Correct 14 ms 26204 KB Output is correct
17 Correct 15 ms 26192 KB Output is correct
18 Correct 15 ms 26196 KB Output is correct
19 Correct 14 ms 27228 KB Output is correct
20 Correct 14 ms 26200 KB Output is correct
21 Correct 15 ms 26204 KB Output is correct
22 Correct 14 ms 27228 KB Output is correct
23 Correct 14 ms 26084 KB Output is correct
24 Correct 15 ms 26204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 26204 KB Output is correct
2 Correct 14 ms 26204 KB Output is correct
3 Correct 14 ms 26200 KB Output is correct
4 Correct 14 ms 26204 KB Output is correct
5 Correct 14 ms 26204 KB Output is correct
6 Correct 14 ms 26204 KB Output is correct
7 Correct 14 ms 26204 KB Output is correct
8 Correct 15 ms 26204 KB Output is correct
9 Correct 14 ms 26052 KB Output is correct
10 Correct 15 ms 26204 KB Output is correct
11 Correct 15 ms 26204 KB Output is correct
12 Correct 14 ms 26204 KB Output is correct
13 Correct 14 ms 26204 KB Output is correct
14 Correct 14 ms 27228 KB Output is correct
15 Correct 15 ms 26196 KB Output is correct
16 Correct 14 ms 26204 KB Output is correct
17 Correct 15 ms 26192 KB Output is correct
18 Correct 15 ms 26196 KB Output is correct
19 Correct 14 ms 27228 KB Output is correct
20 Correct 14 ms 26200 KB Output is correct
21 Correct 15 ms 26204 KB Output is correct
22 Correct 14 ms 27228 KB Output is correct
23 Correct 14 ms 26084 KB Output is correct
24 Correct 15 ms 26204 KB Output is correct
25 Correct 20 ms 26332 KB Output is correct
26 Correct 17 ms 26200 KB Output is correct
27 Correct 18 ms 26204 KB Output is correct
28 Correct 18 ms 26204 KB Output is correct
29 Correct 18 ms 26196 KB Output is correct
30 Correct 17 ms 26204 KB Output is correct
31 Correct 17 ms 26184 KB Output is correct
32 Correct 17 ms 26356 KB Output is correct
33 Correct 17 ms 26200 KB Output is correct
34 Correct 22 ms 26224 KB Output is correct
35 Correct 17 ms 27480 KB Output is correct
36 Correct 17 ms 26204 KB Output is correct
37 Correct 17 ms 26212 KB Output is correct
38 Correct 21 ms 26340 KB Output is correct
39 Correct 16 ms 26356 KB Output is correct
40 Correct 16 ms 26152 KB Output is correct
41 Correct 17 ms 26460 KB Output is correct
42 Correct 19 ms 26260 KB Output is correct
43 Correct 17 ms 26252 KB Output is correct
44 Correct 17 ms 26460 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 26204 KB Output is correct
2 Correct 14 ms 26204 KB Output is correct
3 Correct 14 ms 26200 KB Output is correct
4 Correct 14 ms 26204 KB Output is correct
5 Correct 14 ms 26204 KB Output is correct
6 Correct 14 ms 26204 KB Output is correct
7 Correct 14 ms 26204 KB Output is correct
8 Correct 15 ms 26204 KB Output is correct
9 Correct 14 ms 26052 KB Output is correct
10 Correct 15 ms 26204 KB Output is correct
11 Correct 15 ms 26204 KB Output is correct
12 Correct 14 ms 26204 KB Output is correct
13 Correct 14 ms 26204 KB Output is correct
14 Correct 14 ms 27228 KB Output is correct
15 Correct 15 ms 26196 KB Output is correct
16 Correct 14 ms 26204 KB Output is correct
17 Correct 15 ms 26192 KB Output is correct
18 Correct 15 ms 26196 KB Output is correct
19 Correct 14 ms 27228 KB Output is correct
20 Correct 14 ms 26200 KB Output is correct
21 Correct 15 ms 26204 KB Output is correct
22 Correct 14 ms 27228 KB Output is correct
23 Correct 14 ms 26084 KB Output is correct
24 Correct 15 ms 26204 KB Output is correct
25 Correct 20 ms 26332 KB Output is correct
26 Correct 17 ms 26200 KB Output is correct
27 Correct 18 ms 26204 KB Output is correct
28 Correct 18 ms 26204 KB Output is correct
29 Correct 18 ms 26196 KB Output is correct
30 Correct 17 ms 26204 KB Output is correct
31 Correct 17 ms 26184 KB Output is correct
32 Correct 17 ms 26356 KB Output is correct
33 Correct 17 ms 26200 KB Output is correct
34 Correct 22 ms 26224 KB Output is correct
35 Correct 17 ms 27480 KB Output is correct
36 Correct 17 ms 26204 KB Output is correct
37 Correct 17 ms 26212 KB Output is correct
38 Correct 21 ms 26340 KB Output is correct
39 Correct 16 ms 26356 KB Output is correct
40 Correct 16 ms 26152 KB Output is correct
41 Correct 17 ms 26460 KB Output is correct
42 Correct 19 ms 26260 KB Output is correct
43 Correct 17 ms 26252 KB Output is correct
44 Correct 17 ms 26460 KB Output is correct
45 Correct 159 ms 37576 KB Output is correct
46 Correct 159 ms 38344 KB Output is correct
47 Correct 160 ms 37692 KB Output is correct
48 Correct 160 ms 38344 KB Output is correct
49 Correct 156 ms 37320 KB Output is correct
50 Correct 151 ms 35944 KB Output is correct
51 Correct 146 ms 36296 KB Output is correct
52 Correct 112 ms 38492 KB Output is correct
53 Correct 149 ms 37732 KB Output is correct
54 Correct 147 ms 38864 KB Output is correct
55 Correct 143 ms 36236 KB Output is correct
56 Correct 144 ms 36356 KB Output is correct
57 Correct 119 ms 36684 KB Output is correct
58 Correct 115 ms 38092 KB Output is correct
59 Correct 135 ms 38452 KB Output is correct
60 Correct 151 ms 37868 KB Output is correct
61 Correct 151 ms 37248 KB Output is correct
62 Correct 121 ms 34896 KB Output is correct
63 Correct 127 ms 33492 KB Output is correct
64 Correct 132 ms 34560 KB Output is correct
65 Correct 173 ms 38836 KB Output is correct
66 Correct 177 ms 38868 KB Output is correct
67 Correct 176 ms 38756 KB Output is correct
68 Correct 170 ms 38736 KB Output is correct
69 Correct 172 ms 39204 KB Output is correct
70 Correct 178 ms 37776 KB Output is correct
71 Correct 167 ms 40804 KB Output is correct
72 Correct 167 ms 40976 KB Output is correct
73 Correct 169 ms 40348 KB Output is correct
74 Correct 164 ms 40156 KB Output is correct
75 Correct 130 ms 39368 KB Output is correct
76 Correct 132 ms 41264 KB Output is correct
77 Correct 118 ms 39404 KB Output is correct
78 Correct 158 ms 38292 KB Output is correct
79 Correct 158 ms 37760 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 26204 KB Output is correct
2 Correct 14 ms 26204 KB Output is correct
3 Correct 14 ms 26200 KB Output is correct
4 Correct 14 ms 26204 KB Output is correct
5 Correct 14 ms 26204 KB Output is correct
6 Correct 14 ms 26204 KB Output is correct
7 Correct 14 ms 26204 KB Output is correct
8 Correct 15 ms 26204 KB Output is correct
9 Correct 14 ms 26052 KB Output is correct
10 Correct 15 ms 26204 KB Output is correct
11 Correct 15 ms 26204 KB Output is correct
12 Correct 14 ms 26204 KB Output is correct
13 Correct 14 ms 26204 KB Output is correct
14 Correct 14 ms 27228 KB Output is correct
15 Correct 15 ms 26196 KB Output is correct
16 Correct 14 ms 26204 KB Output is correct
17 Correct 15 ms 26192 KB Output is correct
18 Correct 15 ms 26196 KB Output is correct
19 Correct 14 ms 27228 KB Output is correct
20 Correct 14 ms 26200 KB Output is correct
21 Correct 15 ms 26204 KB Output is correct
22 Correct 14 ms 27228 KB Output is correct
23 Correct 14 ms 26084 KB Output is correct
24 Correct 15 ms 26204 KB Output is correct
25 Correct 20 ms 26332 KB Output is correct
26 Correct 17 ms 26200 KB Output is correct
27 Correct 18 ms 26204 KB Output is correct
28 Correct 18 ms 26204 KB Output is correct
29 Correct 18 ms 26196 KB Output is correct
30 Correct 17 ms 26204 KB Output is correct
31 Correct 17 ms 26184 KB Output is correct
32 Correct 17 ms 26356 KB Output is correct
33 Correct 17 ms 26200 KB Output is correct
34 Correct 22 ms 26224 KB Output is correct
35 Correct 17 ms 27480 KB Output is correct
36 Correct 17 ms 26204 KB Output is correct
37 Correct 17 ms 26212 KB Output is correct
38 Correct 21 ms 26340 KB Output is correct
39 Correct 16 ms 26356 KB Output is correct
40 Correct 16 ms 26152 KB Output is correct
41 Correct 17 ms 26460 KB Output is correct
42 Correct 19 ms 26260 KB Output is correct
43 Correct 17 ms 26252 KB Output is correct
44 Correct 17 ms 26460 KB Output is correct
45 Correct 159 ms 37576 KB Output is correct
46 Correct 159 ms 38344 KB Output is correct
47 Correct 160 ms 37692 KB Output is correct
48 Correct 160 ms 38344 KB Output is correct
49 Correct 156 ms 37320 KB Output is correct
50 Correct 151 ms 35944 KB Output is correct
51 Correct 146 ms 36296 KB Output is correct
52 Correct 112 ms 38492 KB Output is correct
53 Correct 149 ms 37732 KB Output is correct
54 Correct 147 ms 38864 KB Output is correct
55 Correct 143 ms 36236 KB Output is correct
56 Correct 144 ms 36356 KB Output is correct
57 Correct 119 ms 36684 KB Output is correct
58 Correct 115 ms 38092 KB Output is correct
59 Correct 135 ms 38452 KB Output is correct
60 Correct 151 ms 37868 KB Output is correct
61 Correct 151 ms 37248 KB Output is correct
62 Correct 121 ms 34896 KB Output is correct
63 Correct 127 ms 33492 KB Output is correct
64 Correct 132 ms 34560 KB Output is correct
65 Correct 173 ms 38836 KB Output is correct
66 Correct 177 ms 38868 KB Output is correct
67 Correct 176 ms 38756 KB Output is correct
68 Correct 170 ms 38736 KB Output is correct
69 Correct 172 ms 39204 KB Output is correct
70 Correct 178 ms 37776 KB Output is correct
71 Correct 167 ms 40804 KB Output is correct
72 Correct 167 ms 40976 KB Output is correct
73 Correct 169 ms 40348 KB Output is correct
74 Correct 164 ms 40156 KB Output is correct
75 Correct 130 ms 39368 KB Output is correct
76 Correct 132 ms 41264 KB Output is correct
77 Correct 118 ms 39404 KB Output is correct
78 Correct 158 ms 38292 KB Output is correct
79 Correct 158 ms 37760 KB Output is correct
80 Correct 1889 ms 121656 KB Output is correct
81 Correct 1844 ms 122400 KB Output is correct
82 Correct 1857 ms 120208 KB Output is correct
83 Correct 1896 ms 123432 KB Output is correct
84 Correct 1872 ms 122488 KB Output is correct
85 Correct 1610 ms 100656 KB Output is correct
86 Correct 1709 ms 106740 KB Output is correct
87 Correct 1611 ms 132592 KB Output is correct
88 Correct 2315 ms 124836 KB Output is correct
89 Correct 1717 ms 130400 KB Output is correct
90 Correct 1631 ms 108532 KB Output is correct
91 Correct 1644 ms 108664 KB Output is correct
92 Correct 1621 ms 113464 KB Output is correct
93 Correct 1693 ms 130912 KB Output is correct
94 Correct 1955 ms 130236 KB Output is correct
95 Correct 1868 ms 122416 KB Output is correct
96 Correct 1787 ms 118304 KB Output is correct
97 Correct 1714 ms 112708 KB Output is correct
98 Correct 1743 ms 109912 KB Output is correct
99 Correct 1761 ms 96340 KB Output is correct
100 Correct 2878 ms 134352 KB Output is correct
101 Correct 2707 ms 135608 KB Output is correct
102 Correct 2209 ms 134076 KB Output is correct
103 Correct 2142 ms 133640 KB Output is correct
104 Correct 2099 ms 141848 KB Output is correct
105 Correct 2150 ms 140448 KB Output is correct
106 Correct 2115 ms 153712 KB Output is correct
107 Correct 2007 ms 154204 KB Output is correct
108 Correct 2081 ms 148252 KB Output is correct
109 Correct 2087 ms 147592 KB Output is correct
110 Correct 1721 ms 159416 KB Output is correct
111 Correct 1705 ms 161684 KB Output is correct
112 Correct 1299 ms 144288 KB Output is correct
113 Correct 1867 ms 120476 KB Output is correct
114 Correct 1873 ms 122712 KB Output is correct