oj.uz

Submission #41230

# Submission time Handle Problem Language Result Execution time Memory
41230 2018-02-14T09:41:36 Z ssnsarang2023 Port Facility (JOI17_port_facility) C++14
100 / 100
 4211 ms 647636 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <cstring>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;

#define SZ(x) ((int)x.size())

const int N = (int)1e6+5;
const int base = (int)1e9+7;
int n, vis[N], lo[2][N], hi[2][N], b[2][N];
ii tree[2][1 << 21], a[2][N];

void merge_tree_min(ii tr[], int root, int lf, int rt) {
	if (tr[lf].first > tr[rt].first)
		tr[root] = tr[rt];
	else tr[root] = tr[lf];
}

void merge_tree_max(ii tr[], int root, int lf, int rt) {
	if (tr[lf].first < tr[rt].first)
		tr[root] = tr[rt];
	else tr[root] = tr[lf];
}

void build(int k, int l, int r) {
	if (l > r) return;
	if (l == r) {
		tree[0][k] = ii(a[0][l].second, l);
		tree[1][k] = ii(a[1][l].second, l);
		return;
	}
	int mid = (l + r) >> 1;
	build(k << 1, l, mid);
	build(k << 1 | 1, mid + 1, r);
	merge_tree_max(tree[0], k, k << 1, k << 1 | 1);
	merge_tree_min(tree[1], k, k << 1, k << 1 | 1);
}

void _remove_max(int k, int l, int r, int pos) {
	if (l > r || l > pos || r < pos) return;
	if (l == r && l == pos) {
		tree[0][k] = ii(0, 0);
		return;
	}
	int mid = (l + r) >> 1;
	_remove_max(k << 1, l, mid, pos);
	_remove_max(k << 1 | 1, mid + 1, r, pos);
	merge_tree_max(tree[0], k, k << 1, k << 1 | 1);
}

void _remove_min(int k, int l, int r, int pos) {
	if (l > r || l > pos || r < pos) return;
	if (l == r && l == pos) {
		tree[1][k] = ii(2*n+1, 0);
		return;
	}
	int mid = (l + r) >> 1;
	_remove_min(k << 1, l, mid, pos);
	_remove_min(k << 1 | 1, mid + 1, r, pos);
	merge_tree_min(tree[1], k, k << 1, k << 1 | 1);
}

ii query_max(ii tr[], int k, int l, int r, int L, int R) {
	if (l > r || l > R || r < L) return ii(0, 0);
	if (L <= l && r <= R) return tr[k];
	int mid = (l + r) >> 1;
	ii lf = query_max(tr, k << 1, l, mid, L, R);
	ii rt = query_max(tr, k << 1 | 1, mid + 1, r, L, R);
	if (lf.first < rt.first) return rt;
	return lf;
}

ii query_min(ii tr[], int k, int l, int r, int L, int R) {
	if (l > r || l > R || r < L) return ii(2*n+1, 0);
	if (L <= l && r <= R) return tr[k];
	int mid = (l + r) >> 1;
	ii lf = query_min(tr, k << 1, l, mid, L, R);
	ii rt = query_min(tr, k << 1 | 1, mid + 1, r, L, R);
	if (lf.first > rt.first) return rt;
	return lf;
}

int bit[2*N];

void update_bit(int idx, int val) {
	for (; idx <= 2*n; idx += idx & -idx)
		bit[idx] += val;
}

int read_bit(int idx) {
	int ans = 0;
	for (; idx > 0; idx -= idx & -idx)
		ans += bit[idx];
	return ans;
}

bool check(int id) {
	memset(bit, 0, sizeof(bit));
	vector<ii> c;
	for (int i = 1; i <= n; ++i) if (vis[i] == id)
		c.push_back(a[0][i]);
	for (int i = 0; i < SZ(c); ++i) {
		int tmp = read_bit(c[i].second) - read_bit(c[i].first);
		if (tmp > 0) return false;
		update_bit(c[i].second, 1);
	}
	return true;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) scanf("%d%d", &a[0][i].first, &a[0][i].second), a[1][i] = a[0][i];
	sort(a[0] + 1, a[0] + n + 1);
	for (int i = 1; i <= n; ++i) {
		lo[0][i] = i;
		hi[0][i] = upper_bound(a[0] + i, a[0] + n + 1, ii(a[0][i].second, 0)) - a[0] - 1;
		swap(a[1][i].first, a[1][i].second);
	}
	sort(a[1] + 1, a[1] + n + 1);
	for (int i = 1; i <= n; ++i) {
		hi[1][i] = i;
		lo[1][i] = lower_bound(a[1] + 1, a[1] + i, ii(a[1][i].second, 0)) - a[1];
		b[1][i] = lower_bound(a[0] + 1, a[0] + n + 1, ii(a[1][i].second, 0)) - a[0];
		b[0][i] = lower_bound(a[1] + 1, a[1] + n + 1, ii(a[0][i].second, 0)) - a[1];
	}
	build(1, 1, n);
	int ans = 1;
	for (int i = 1; i <= n; ++i) if (!vis[i]) {
		queue<int> q;
		q.push(i);
		vis[i] = 1;
		_remove_max(1, 1, n, i);
		_remove_min(1, 1, n, b[0][i]);
		while (SZ(q)) {
			int u = q.front(); q.pop();
			ii tmp = query_max(tree[0], 1, 1, n, lo[0][u], hi[0][u]);
			while (tmp.first > a[0][u].second) {
				vis[tmp.second] = 3 - vis[u];
				q.push(tmp.second);
				_remove_max(1, 1, n, tmp.second);
				_remove_min(1, 1, n, b[0][tmp.second]);
				tmp = query_max(tree[0], 1, 1, n, lo[0][u], hi[0][u]);
			}
			int u2 = b[0][u];
			tmp = query_min(tree[1], 1, 1, n, lo[1][u2], hi[1][u2]);
			while (tmp.first < a[1][u2].second) {
				vis[b[1][tmp.second]] = 3 - vis[u];
				q.push(b[1][tmp.second]);
				_remove_min(1, 1, n, tmp.second);
				_remove_max(1, 1, n, b[1][tmp.second]);
				tmp = query_min(tree[1], 1, 1, n, lo[1][u2], hi[1][u2]);
			}
		}
		ans = ans * 2 % base;
	}
	if (check(1) && check(2)) printf("%d", ans);
	else printf("0");
	return 0;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:119:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
port_facility.cpp:120:96: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; ++i) scanf("%d%d", &a[0][i].first, &a[0][i].second), a[1][i] = a[0][i];
                                                                                                ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 8 ms 8288 KB Output is correct
3 Correct 7 ms 8396 KB Output is correct
4 Correct 7 ms 8396 KB Output is correct
5 Correct 11 ms 8396 KB Output is correct
6 Correct 8 ms 8460 KB Output is correct
7 Correct 7 ms 8548 KB Output is correct
8 Correct 8 ms 8548 KB Output is correct
9 Correct 8 ms 8548 KB Output is correct
10 Correct 9 ms 8668 KB Output is correct
11 Correct 7 ms 8668 KB Output is correct
12 Correct 8 ms 8668 KB Output is correct
13 Correct 7 ms 8668 KB Output is correct
14 Correct 9 ms 8668 KB Output is correct
15 Correct 7 ms 8668 KB Output is correct
16 Correct 7 ms 8668 KB Output is correct
17 Correct 7 ms 8668 KB Output is correct
18 Correct 9 ms 8668 KB Output is correct
19 Correct 7 ms 8668 KB Output is correct
20 Correct 7 ms 8668 KB Output is correct
21 Correct 9 ms 8668 KB Output is correct
22 Correct 7 ms 8668 KB Output is correct
23 Correct 7 ms 8668 KB Output is correct
24 Correct 8 ms 8668 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 8 ms 8288 KB Output is correct
3 Correct 7 ms 8396 KB Output is correct
4 Correct 7 ms 8396 KB Output is correct
5 Correct 11 ms 8396 KB Output is correct
6 Correct 8 ms 8460 KB Output is correct
7 Correct 7 ms 8548 KB Output is correct
8 Correct 8 ms 8548 KB Output is correct
9 Correct 8 ms 8548 KB Output is correct
10 Correct 9 ms 8668 KB Output is correct
11 Correct 7 ms 8668 KB Output is correct
12 Correct 8 ms 8668 KB Output is correct
13 Correct 7 ms 8668 KB Output is correct
14 Correct 9 ms 8668 KB Output is correct
15 Correct 7 ms 8668 KB Output is correct
16 Correct 7 ms 8668 KB Output is correct
17 Correct 7 ms 8668 KB Output is correct
18 Correct 9 ms 8668 KB Output is correct
19 Correct 7 ms 8668 KB Output is correct
20 Correct 7 ms 8668 KB Output is correct
21 Correct 9 ms 8668 KB Output is correct
22 Correct 7 ms 8668 KB Output is correct
23 Correct 7 ms 8668 KB Output is correct
24 Correct 8 ms 8668 KB Output is correct
25 Correct 15 ms 8900 KB Output is correct
26 Correct 11 ms 9020 KB Output is correct
27 Correct 11 ms 9020 KB Output is correct
28 Correct 14 ms 9020 KB Output is correct
29 Correct 14 ms 9020 KB Output is correct
30 Correct 14 ms 9024 KB Output is correct
31 Correct 12 ms 9048 KB Output is correct
32 Correct 14 ms 9080 KB Output is correct
33 Correct 10 ms 9112 KB Output is correct
34 Correct 12 ms 9120 KB Output is correct
35 Correct 10 ms 9140 KB Output is correct
36 Correct 12 ms 9160 KB Output is correct
37 Correct 11 ms 9180 KB Output is correct
38 Correct 10 ms 9200 KB Output is correct
39 Correct 10 ms 9220 KB Output is correct
40 Correct 11 ms 9240 KB Output is correct
41 Correct 10 ms 9260 KB Output is correct
42 Correct 10 ms 9280 KB Output is correct
43 Correct 10 ms 9300 KB Output is correct
44 Correct 10 ms 9320 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 8 ms 8288 KB Output is correct
3 Correct 7 ms 8396 KB Output is correct
4 Correct 7 ms 8396 KB Output is correct
5 Correct 11 ms 8396 KB Output is correct
6 Correct 8 ms 8460 KB Output is correct
7 Correct 7 ms 8548 KB Output is correct
8 Correct 8 ms 8548 KB Output is correct
9 Correct 8 ms 8548 KB Output is correct
10 Correct 9 ms 8668 KB Output is correct
11 Correct 7 ms 8668 KB Output is correct
12 Correct 8 ms 8668 KB Output is correct
13 Correct 7 ms 8668 KB Output is correct
14 Correct 9 ms 8668 KB Output is correct
15 Correct 7 ms 8668 KB Output is correct
16 Correct 7 ms 8668 KB Output is correct
17 Correct 7 ms 8668 KB Output is correct
18 Correct 9 ms 8668 KB Output is correct
19 Correct 7 ms 8668 KB Output is correct
20 Correct 7 ms 8668 KB Output is correct
21 Correct 9 ms 8668 KB Output is correct
22 Correct 7 ms 8668 KB Output is correct
23 Correct 7 ms 8668 KB Output is correct
24 Correct 8 ms 8668 KB Output is correct
25 Correct 15 ms 8900 KB Output is correct
26 Correct 11 ms 9020 KB Output is correct
27 Correct 11 ms 9020 KB Output is correct
28 Correct 14 ms 9020 KB Output is correct
29 Correct 14 ms 9020 KB Output is correct
30 Correct 14 ms 9024 KB Output is correct
31 Correct 12 ms 9048 KB Output is correct
32 Correct 14 ms 9080 KB Output is correct
33 Correct 10 ms 9112 KB Output is correct
34 Correct 12 ms 9120 KB Output is correct
35 Correct 10 ms 9140 KB Output is correct
36 Correct 12 ms 9160 KB Output is correct
37 Correct 11 ms 9180 KB Output is correct
38 Correct 10 ms 9200 KB Output is correct
39 Correct 10 ms 9220 KB Output is correct
40 Correct 11 ms 9240 KB Output is correct
41 Correct 10 ms 9260 KB Output is correct
42 Correct 10 ms 9280 KB Output is correct
43 Correct 10 ms 9300 KB Output is correct
44 Correct 10 ms 9320 KB Output is correct
45 Correct 239 ms 19712 KB Output is correct
46 Correct 240 ms 20804 KB Output is correct
47 Correct 258 ms 22132 KB Output is correct
48 Correct 252 ms 23508 KB Output is correct
49 Correct 236 ms 24696 KB Output is correct
50 Correct 239 ms 25804 KB Output is correct
51 Correct 253 ms 27024 KB Output is correct
52 Correct 187 ms 28972 KB Output is correct
53 Correct 198 ms 30052 KB Output is correct
54 Correct 180 ms 31296 KB Output is correct
55 Correct 203 ms 32600 KB Output is correct
56 Correct 186 ms 33768 KB Output is correct
57 Correct 203 ms 34820 KB Output is correct
58 Correct 191 ms 36356 KB Output is correct
59 Correct 232 ms 37596 KB Output is correct
60 Correct 227 ms 38876 KB Output is correct
61 Correct 232 ms 39780 KB Output is correct
62 Correct 227 ms 41460 KB Output is correct
63 Correct 225 ms 42164 KB Output is correct
64 Correct 226 ms 43424 KB Output is correct
65 Correct 286 ms 44852 KB Output is correct
66 Correct 286 ms 46184 KB Output is correct
67 Correct 191 ms 47592 KB Output is correct
68 Correct 194 ms 48800 KB Output is correct
69 Correct 200 ms 50624 KB Output is correct
70 Correct 190 ms 51984 KB Output is correct
71 Correct 166 ms 52600 KB Output is correct
72 Correct 160 ms 53748 KB Output is correct
73 Correct 160 ms 55644 KB Output is correct
74 Correct 160 ms 57132 KB Output is correct
75 Correct 184 ms 57600 KB Output is correct
76 Correct 208 ms 58960 KB Output is correct
77 Correct 228 ms 60080 KB Output is correct
78 Correct 244 ms 61396 KB Output is correct
79 Correct 248 ms 62728 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 8 ms 8288 KB Output is correct
3 Correct 7 ms 8396 KB Output is correct
4 Correct 7 ms 8396 KB Output is correct
5 Correct 11 ms 8396 KB Output is correct
6 Correct 8 ms 8460 KB Output is correct
7 Correct 7 ms 8548 KB Output is correct
8 Correct 8 ms 8548 KB Output is correct
9 Correct 8 ms 8548 KB Output is correct
10 Correct 9 ms 8668 KB Output is correct
11 Correct 7 ms 8668 KB Output is correct
12 Correct 8 ms 8668 KB Output is correct
13 Correct 7 ms 8668 KB Output is correct
14 Correct 9 ms 8668 KB Output is correct
15 Correct 7 ms 8668 KB Output is correct
16 Correct 7 ms 8668 KB Output is correct
17 Correct 7 ms 8668 KB Output is correct
18 Correct 9 ms 8668 KB Output is correct
19 Correct 7 ms 8668 KB Output is correct
20 Correct 7 ms 8668 KB Output is correct
21 Correct 9 ms 8668 KB Output is correct
22 Correct 7 ms 8668 KB Output is correct
23 Correct 7 ms 8668 KB Output is correct
24 Correct 8 ms 8668 KB Output is correct
25 Correct 15 ms 8900 KB Output is correct
26 Correct 11 ms 9020 KB Output is correct
27 Correct 11 ms 9020 KB Output is correct
28 Correct 14 ms 9020 KB Output is correct
29 Correct 14 ms 9020 KB Output is correct
30 Correct 14 ms 9024 KB Output is correct
31 Correct 12 ms 9048 KB Output is correct
32 Correct 14 ms 9080 KB Output is correct
33 Correct 10 ms 9112 KB Output is correct
34 Correct 12 ms 9120 KB Output is correct
35 Correct 10 ms 9140 KB Output is correct
36 Correct 12 ms 9160 KB Output is correct
37 Correct 11 ms 9180 KB Output is correct
38 Correct 10 ms 9200 KB Output is correct
39 Correct 10 ms 9220 KB Output is correct
40 Correct 11 ms 9240 KB Output is correct
41 Correct 10 ms 9260 KB Output is correct
42 Correct 10 ms 9280 KB Output is correct
43 Correct 10 ms 9300 KB Output is correct
44 Correct 10 ms 9320 KB Output is correct
45 Correct 239 ms 19712 KB Output is correct
46 Correct 240 ms 20804 KB Output is correct
47 Correct 258 ms 22132 KB Output is correct
48 Correct 252 ms 23508 KB Output is correct
49 Correct 236 ms 24696 KB Output is correct
50 Correct 239 ms 25804 KB Output is correct
51 Correct 253 ms 27024 KB Output is correct
52 Correct 187 ms 28972 KB Output is correct
53 Correct 198 ms 30052 KB Output is correct
54 Correct 180 ms 31296 KB Output is correct
55 Correct 203 ms 32600 KB Output is correct
56 Correct 186 ms 33768 KB Output is correct
57 Correct 203 ms 34820 KB Output is correct
58 Correct 191 ms 36356 KB Output is correct
59 Correct 232 ms 37596 KB Output is correct
60 Correct 227 ms 38876 KB Output is correct
61 Correct 232 ms 39780 KB Output is correct
62 Correct 227 ms 41460 KB Output is correct
63 Correct 225 ms 42164 KB Output is correct
64 Correct 226 ms 43424 KB Output is correct
65 Correct 286 ms 44852 KB Output is correct
66 Correct 286 ms 46184 KB Output is correct
67 Correct 191 ms 47592 KB Output is correct
68 Correct 194 ms 48800 KB Output is correct
69 Correct 200 ms 50624 KB Output is correct
70 Correct 190 ms 51984 KB Output is correct
71 Correct 166 ms 52600 KB Output is correct
72 Correct 160 ms 53748 KB Output is correct
73 Correct 160 ms 55644 KB Output is correct
74 Correct 160 ms 57132 KB Output is correct
75 Correct 184 ms 57600 KB Output is correct
76 Correct 208 ms 58960 KB Output is correct
77 Correct 228 ms 60080 KB Output is correct
78 Correct 244 ms 61396 KB Output is correct
79 Correct 248 ms 62728 KB Output is correct
80 Correct 2822 ms 152284 KB Output is correct
81 Correct 2810 ms 166912 KB Output is correct
82 Correct 2749 ms 181308 KB Output is correct
83 Correct 2747 ms 195964 KB Output is correct
84 Correct 2771 ms 210472 KB Output is correct
85 Correct 2677 ms 225052 KB Output is correct
86 Correct 2710 ms 239508 KB Output is correct
87 Correct 2117 ms 254252 KB Output is correct
88 Correct 2190 ms 268680 KB Output is correct
89 Correct 1794 ms 283404 KB Output is correct
90 Correct 2195 ms 297920 KB Output is correct
91 Correct 1790 ms 312432 KB Output is correct
92 Correct 2216 ms 326692 KB Output is correct
93 Correct 2121 ms 341736 KB Output is correct
94 Correct 2530 ms 356152 KB Output is correct
95 Correct 2670 ms 370908 KB Output is correct
96 Correct 2719 ms 385236 KB Output is correct
97 Correct 2474 ms 399852 KB Output is correct
98 Correct 2660 ms 414504 KB Output is correct
99 Correct 2699 ms 425056 KB Output is correct
100 Correct 4211 ms 439576 KB Output is correct
101 Correct 4026 ms 454144 KB Output is correct
102 Correct 2226 ms 472436 KB Output is correct
103 Correct 2213 ms 486972 KB Output is correct
104 Correct 2237 ms 505904 KB Output is correct
105 Correct 2146 ms 520368 KB Output is correct
106 Correct 1876 ms 530556 KB Output is correct
107 Correct 1888 ms 545372 KB Output is correct
108 Correct 1895 ms 564248 KB Output is correct
109 Correct 1881 ms 578664 KB Output is correct
110 Correct 2145 ms 589008 KB Output is correct
111 Correct 2214 ms 603620 KB Output is correct
112 Correct 2261 ms 618120 KB Output is correct
113 Correct 2742 ms 633036 KB Output is correct
114 Correct 2776 ms 647636 KB Output is correct