oj.uz

Submission #648419

# Submission time Handle Problem Language Result Execution time Memory
648419 2022-10-06T11:23:23 Z ymm Port Facility (JOI17_port_facility) C++17
100 / 100
 871 ms 134252 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 1'000'010;
int con_l[N], con_r[N];
int par[N];
int sz[N];
int n;

struct con_cmp {
	bool operator()(int i, int j)
	{
		return con_r[i] > con_r[j];
	}
};
typedef priority_queue<int, vector<int>, con_cmp> con_heap;

con_heap nodes[N][2];

void merge(int v, int u, bool parity)
{
	if (nodes[v][0].size() < nodes[u][parity].size())
		nodes[v][0].swap(nodes[u][parity]);
	for (int x : *(vector<int> *)&nodes[u][parity])
		nodes[v][0].push(x);
	{ con_heap tmp; tmp.swap(nodes[u][parity]); }
	// ------------- //
	if (nodes[v][1].size() < nodes[u][!parity].size())
		nodes[v][1].swap(nodes[u][!parity]);
	for (int x : *(vector<int> *)&nodes[u][!parity])
		nodes[v][1].push(x);
	{ con_heap tmp; tmp.swap(nodes[u][!parity]); }
}

bool set_root(int &v)
{
	bool ans = 0;
	while (par[v] != -1) {
		v = par[v];
		ans ^= 1;
	}
	return ans;
}

int unite(int v, int u, bool parity)
{
	parity ^= set_root(v);
	parity ^= set_root(u);
	if (sz[v] < sz[u])
		swap(v, u);
	par[u] = v;
	sz[v] += sz[u];
	merge(v, u, parity);
	return v;
}

struct com_cmp {
	bool operator()(int i, int j)
	{
		int x0 = nodes[i][0].size()? con_r[nodes[i][0].top()]: 2*N;
		int x1 = nodes[i][1].size()? con_r[nodes[i][1].top()]: 2*N;
		int y0 = nodes[j][0].size()? con_r[nodes[j][0].top()]: 2*N;
		int y1 = nodes[j][1].size()? con_r[nodes[j][1].top()]: 2*N;
		int x = min(x0, x1);
		int y = min(y0, y1);
		return x > y || (x == y && i > j);
	}
};
priority_queue<int, vector<int>, com_cmp> coms;

int solve()
{
	Loop (i,0,n) {
		nodes[i][0].push(i);
		int l = con_l[i], r = con_r[i];
		int waiting_com = i;
		for (;;) {
			if (!coms.size())
				break;
			int com = coms.top();
			bool pre_even =    nodes[com][0].size()
			                && con_r[nodes[com][0].top()] < r;
			bool pre_odd  =    nodes[com][1].size()
			                && con_r[nodes[com][1].top()] < r;
			if (!pre_even && !pre_odd)
				break;
			coms.pop();
			while (   nodes[com][0].size()
			       && con_r[nodes[com][0].top()] < l) {
				nodes[com][0].pop();
			}
			while (   nodes[com][1].size()
			       && con_r[nodes[com][1].top()] < l) {
				nodes[com][1].pop();
			}
			bool even =    nodes[com][0].size()
			            && con_r[nodes[com][0].top()] < r;
			bool odd  =    nodes[com][1].size()
			            && con_r[nodes[com][1].top()] < r;
			if (even && odd) {
				cout << "0\n";
				exit(0);
			} else if (even) {
				waiting_com = unite(waiting_com, com, 1);
			} else if (odd) {
				waiting_com = unite(waiting_com, com, 0);
			} else {
				coms.push(com);
			}
		}
		coms.push(waiting_com);
	}
	return coms.size();
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n;
	vector<pii> vec;
	Loop (i,0,n) {
		int x, y;
		cin >> x >> y;
		vec.push_back({x, y});
	}
	sort(vec.begin(), vec.end());
	Loop (i,0,n)
		tie(con_l[i], con_r[i]) = vec[i];
	memset(par, -1, sizeof(par));
	int ans = solve();
	int p2ans = 1;
	while (ans--)
		p2ans = p2ans*2 % 1'000'000'007;
	cout << p2ans << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 66772 KB Output is correct
2 Correct 35 ms 66776 KB Output is correct
3 Correct 31 ms 66852 KB Output is correct
4 Correct 35 ms 66788 KB Output is correct
5 Correct 33 ms 66764 KB Output is correct
6 Correct 31 ms 66772 KB Output is correct
7 Correct 36 ms 66760 KB Output is correct
8 Correct 33 ms 66836 KB Output is correct
9 Correct 30 ms 66840 KB Output is correct
10 Correct 32 ms 66796 KB Output is correct
11 Correct 37 ms 66764 KB Output is correct
12 Correct 31 ms 66776 KB Output is correct
13 Correct 31 ms 66868 KB Output is correct
14 Correct 32 ms 66868 KB Output is correct
15 Correct 31 ms 66772 KB Output is correct
16 Correct 35 ms 66788 KB Output is correct
17 Correct 32 ms 66864 KB Output is correct
18 Correct 31 ms 66768 KB Output is correct
19 Correct 31 ms 66772 KB Output is correct
20 Correct 34 ms 66764 KB Output is correct
21 Correct 31 ms 66800 KB Output is correct
22 Correct 31 ms 66776 KB Output is correct
23 Correct 37 ms 66744 KB Output is correct
24 Correct 32 ms 66764 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 66772 KB Output is correct
2 Correct 35 ms 66776 KB Output is correct
3 Correct 31 ms 66852 KB Output is correct
4 Correct 35 ms 66788 KB Output is correct
5 Correct 33 ms 66764 KB Output is correct
6 Correct 31 ms 66772 KB Output is correct
7 Correct 36 ms 66760 KB Output is correct
8 Correct 33 ms 66836 KB Output is correct
9 Correct 30 ms 66840 KB Output is correct
10 Correct 32 ms 66796 KB Output is correct
11 Correct 37 ms 66764 KB Output is correct
12 Correct 31 ms 66776 KB Output is correct
13 Correct 31 ms 66868 KB Output is correct
14 Correct 32 ms 66868 KB Output is correct
15 Correct 31 ms 66772 KB Output is correct
16 Correct 35 ms 66788 KB Output is correct
17 Correct 32 ms 66864 KB Output is correct
18 Correct 31 ms 66768 KB Output is correct
19 Correct 31 ms 66772 KB Output is correct
20 Correct 34 ms 66764 KB Output is correct
21 Correct 31 ms 66800 KB Output is correct
22 Correct 31 ms 66776 KB Output is correct
23 Correct 37 ms 66744 KB Output is correct
24 Correct 32 ms 66764 KB Output is correct
25 Correct 34 ms 66948 KB Output is correct
26 Correct 34 ms 66916 KB Output is correct
27 Correct 33 ms 66848 KB Output is correct
28 Correct 32 ms 66892 KB Output is correct
29 Correct 35 ms 66944 KB Output is correct
30 Correct 32 ms 66868 KB Output is correct
31 Correct 32 ms 67056 KB Output is correct
32 Correct 37 ms 66840 KB Output is correct
33 Correct 31 ms 66928 KB Output is correct
34 Correct 31 ms 66912 KB Output is correct
35 Correct 31 ms 66932 KB Output is correct
36 Correct 31 ms 66892 KB Output is correct
37 Correct 32 ms 66912 KB Output is correct
38 Correct 32 ms 66892 KB Output is correct
39 Correct 38 ms 66980 KB Output is correct
40 Correct 32 ms 66980 KB Output is correct
41 Correct 31 ms 66900 KB Output is correct
42 Correct 33 ms 66904 KB Output is correct
43 Correct 31 ms 66900 KB Output is correct
44 Correct 36 ms 66828 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 66772 KB Output is correct
2 Correct 35 ms 66776 KB Output is correct
3 Correct 31 ms 66852 KB Output is correct
4 Correct 35 ms 66788 KB Output is correct
5 Correct 33 ms 66764 KB Output is correct
6 Correct 31 ms 66772 KB Output is correct
7 Correct 36 ms 66760 KB Output is correct
8 Correct 33 ms 66836 KB Output is correct
9 Correct 30 ms 66840 KB Output is correct
10 Correct 32 ms 66796 KB Output is correct
11 Correct 37 ms 66764 KB Output is correct
12 Correct 31 ms 66776 KB Output is correct
13 Correct 31 ms 66868 KB Output is correct
14 Correct 32 ms 66868 KB Output is correct
15 Correct 31 ms 66772 KB Output is correct
16 Correct 35 ms 66788 KB Output is correct
17 Correct 32 ms 66864 KB Output is correct
18 Correct 31 ms 66768 KB Output is correct
19 Correct 31 ms 66772 KB Output is correct
20 Correct 34 ms 66764 KB Output is correct
21 Correct 31 ms 66800 KB Output is correct
22 Correct 31 ms 66776 KB Output is correct
23 Correct 37 ms 66744 KB Output is correct
24 Correct 32 ms 66764 KB Output is correct
25 Correct 34 ms 66948 KB Output is correct
26 Correct 34 ms 66916 KB Output is correct
27 Correct 33 ms 66848 KB Output is correct
28 Correct 32 ms 66892 KB Output is correct
29 Correct 35 ms 66944 KB Output is correct
30 Correct 32 ms 66868 KB Output is correct
31 Correct 32 ms 67056 KB Output is correct
32 Correct 37 ms 66840 KB Output is correct
33 Correct 31 ms 66928 KB Output is correct
34 Correct 31 ms 66912 KB Output is correct
35 Correct 31 ms 66932 KB Output is correct
36 Correct 31 ms 66892 KB Output is correct
37 Correct 32 ms 66912 KB Output is correct
38 Correct 32 ms 66892 KB Output is correct
39 Correct 38 ms 66980 KB Output is correct
40 Correct 32 ms 66980 KB Output is correct
41 Correct 31 ms 66900 KB Output is correct
42 Correct 33 ms 66904 KB Output is correct
43 Correct 31 ms 66900 KB Output is correct
44 Correct 36 ms 66828 KB Output is correct
45 Correct 97 ms 71020 KB Output is correct
46 Correct 93 ms 71024 KB Output is correct
47 Correct 93 ms 71048 KB Output is correct
48 Correct 90 ms 71076 KB Output is correct
49 Correct 92 ms 71024 KB Output is correct
50 Correct 66 ms 69988 KB Output is correct
51 Correct 65 ms 70196 KB Output is correct
52 Correct 75 ms 73168 KB Output is correct
53 Correct 80 ms 73196 KB Output is correct
54 Correct 56 ms 69784 KB Output is correct
55 Correct 58 ms 69816 KB Output is correct
56 Correct 57 ms 69820 KB Output is correct
57 Correct 79 ms 73320 KB Output is correct
58 Correct 81 ms 73212 KB Output is correct
59 Correct 93 ms 73560 KB Output is correct
60 Correct 106 ms 72372 KB Output is correct
61 Correct 111 ms 71496 KB Output is correct
62 Correct 56 ms 69832 KB Output is correct
63 Correct 56 ms 69728 KB Output is correct
64 Correct 55 ms 69832 KB Output is correct
65 Correct 59 ms 69736 KB Output is correct
66 Correct 60 ms 69816 KB Output is correct
67 Correct 78 ms 71656 KB Output is correct
68 Correct 83 ms 71616 KB Output is correct
69 Correct 83 ms 71832 KB Output is correct
70 Correct 82 ms 71772 KB Output is correct
71 Correct 75 ms 71600 KB Output is correct
72 Correct 72 ms 71660 KB Output is correct
73 Correct 70 ms 71684 KB Output is correct
74 Correct 72 ms 71660 KB Output is correct
75 Correct 64 ms 70196 KB Output is correct
76 Correct 68 ms 70192 KB Output is correct
77 Correct 87 ms 70344 KB Output is correct
78 Correct 91 ms 71144 KB Output is correct
79 Correct 97 ms 71028 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 66772 KB Output is correct
2 Correct 35 ms 66776 KB Output is correct
3 Correct 31 ms 66852 KB Output is correct
4 Correct 35 ms 66788 KB Output is correct
5 Correct 33 ms 66764 KB Output is correct
6 Correct 31 ms 66772 KB Output is correct
7 Correct 36 ms 66760 KB Output is correct
8 Correct 33 ms 66836 KB Output is correct
9 Correct 30 ms 66840 KB Output is correct
10 Correct 32 ms 66796 KB Output is correct
11 Correct 37 ms 66764 KB Output is correct
12 Correct 31 ms 66776 KB Output is correct
13 Correct 31 ms 66868 KB Output is correct
14 Correct 32 ms 66868 KB Output is correct
15 Correct 31 ms 66772 KB Output is correct
16 Correct 35 ms 66788 KB Output is correct
17 Correct 32 ms 66864 KB Output is correct
18 Correct 31 ms 66768 KB Output is correct
19 Correct 31 ms 66772 KB Output is correct
20 Correct 34 ms 66764 KB Output is correct
21 Correct 31 ms 66800 KB Output is correct
22 Correct 31 ms 66776 KB Output is correct
23 Correct 37 ms 66744 KB Output is correct
24 Correct 32 ms 66764 KB Output is correct
25 Correct 34 ms 66948 KB Output is correct
26 Correct 34 ms 66916 KB Output is correct
27 Correct 33 ms 66848 KB Output is correct
28 Correct 32 ms 66892 KB Output is correct
29 Correct 35 ms 66944 KB Output is correct
30 Correct 32 ms 66868 KB Output is correct
31 Correct 32 ms 67056 KB Output is correct
32 Correct 37 ms 66840 KB Output is correct
33 Correct 31 ms 66928 KB Output is correct
34 Correct 31 ms 66912 KB Output is correct
35 Correct 31 ms 66932 KB Output is correct
36 Correct 31 ms 66892 KB Output is correct
37 Correct 32 ms 66912 KB Output is correct
38 Correct 32 ms 66892 KB Output is correct
39 Correct 38 ms 66980 KB Output is correct
40 Correct 32 ms 66980 KB Output is correct
41 Correct 31 ms 66900 KB Output is correct
42 Correct 33 ms 66904 KB Output is correct
43 Correct 31 ms 66900 KB Output is correct
44 Correct 36 ms 66828 KB Output is correct
45 Correct 97 ms 71020 KB Output is correct
46 Correct 93 ms 71024 KB Output is correct
47 Correct 93 ms 71048 KB Output is correct
48 Correct 90 ms 71076 KB Output is correct
49 Correct 92 ms 71024 KB Output is correct
50 Correct 66 ms 69988 KB Output is correct
51 Correct 65 ms 70196 KB Output is correct
52 Correct 75 ms 73168 KB Output is correct
53 Correct 80 ms 73196 KB Output is correct
54 Correct 56 ms 69784 KB Output is correct
55 Correct 58 ms 69816 KB Output is correct
56 Correct 57 ms 69820 KB Output is correct
57 Correct 79 ms 73320 KB Output is correct
58 Correct 81 ms 73212 KB Output is correct
59 Correct 93 ms 73560 KB Output is correct
60 Correct 106 ms 72372 KB Output is correct
61 Correct 111 ms 71496 KB Output is correct
62 Correct 56 ms 69832 KB Output is correct
63 Correct 56 ms 69728 KB Output is correct
64 Correct 55 ms 69832 KB Output is correct
65 Correct 59 ms 69736 KB Output is correct
66 Correct 60 ms 69816 KB Output is correct
67 Correct 78 ms 71656 KB Output is correct
68 Correct 83 ms 71616 KB Output is correct
69 Correct 83 ms 71832 KB Output is correct
70 Correct 82 ms 71772 KB Output is correct
71 Correct 75 ms 71600 KB Output is correct
72 Correct 72 ms 71660 KB Output is correct
73 Correct 70 ms 71684 KB Output is correct
74 Correct 72 ms 71660 KB Output is correct
75 Correct 64 ms 70196 KB Output is correct
76 Correct 68 ms 70192 KB Output is correct
77 Correct 87 ms 70344 KB Output is correct
78 Correct 91 ms 71144 KB Output is correct
79 Correct 97 ms 71028 KB Output is correct
80 Correct 743 ms 110696 KB Output is correct
81 Correct 770 ms 110708 KB Output is correct
82 Correct 727 ms 111092 KB Output is correct
83 Correct 725 ms 110600 KB Output is correct
84 Correct 688 ms 110568 KB Output is correct
85 Correct 439 ms 101044 KB Output is correct
86 Correct 488 ms 102632 KB Output is correct
87 Correct 552 ms 132276 KB Output is correct
88 Correct 540 ms 132236 KB Output is correct
89 Correct 306 ms 97136 KB Output is correct
90 Correct 314 ms 97196 KB Output is correct
91 Correct 335 ms 97176 KB Output is correct
92 Correct 577 ms 134252 KB Output is correct
93 Correct 626 ms 132448 KB Output is correct
94 Correct 841 ms 133068 KB Output is correct
95 Correct 871 ms 116892 KB Output is correct
96 Correct 742 ms 112116 KB Output is correct
97 Correct 417 ms 106940 KB Output is correct
98 Correct 508 ms 105400 KB Output is correct
99 Correct 377 ms 99028 KB Output is correct
100 Correct 356 ms 97200 KB Output is correct
101 Correct 299 ms 97164 KB Output is correct
102 Correct 661 ms 116640 KB Output is correct
103 Correct 726 ms 116644 KB Output is correct
104 Correct 635 ms 114000 KB Output is correct
105 Correct 607 ms 114076 KB Output is correct
106 Correct 644 ms 116704 KB Output is correct
107 Correct 630 ms 116640 KB Output is correct
108 Correct 570 ms 113960 KB Output is correct
109 Correct 554 ms 114032 KB Output is correct
110 Correct 417 ms 101108 KB Output is correct
111 Correct 409 ms 101136 KB Output is correct
112 Correct 412 ms 101128 KB Output is correct
113 Correct 734 ms 111112 KB Output is correct
114 Correct 739 ms 110704 KB Output is correct