답안 #850134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
850134	2023-09-15T19:45:41 Z	mickey080929	Port Facility (JOI17_port_facility)	C++17	22 / 100	6000 ms	7012 KB

port_facility

#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> pii;

const int mod = 1e9 + 7;

struct DisjointSet{
public:
	int n;
	vector<int> par;
	void Init(int _n) {
		n = _n;
		par.resize(n);
		iota(par.begin(), par.end(), 0);
	}
	int Find(int x) {
		if (par[x] == x) return x;
		return par[x] = Find(par[x]);
	}
	void Union(int x, int y) {
		x = Find(x);
		y = Find(y);
		if (x == y) return;
		par[y] = x;
	}
} dsu;

struct SegmentTree{
public:
	int n;
	vector<int> tree;
	void Init(int _n) {
		n = _n;
		int sz = 1<<(Log2(n)+1);
		tree.resize(sz);
		fill(tree.begin(), tree.end(), -1);
	}
	void Update(int tar, int val) { Update(1, 1, n, tar, val); }
	int Query(int l, int r) { return Query(1, 1, n, l, r); }
private:
	static int Log2(int n) {
		int ret = 0;
		while (n > 1 << ret) ret ++;
		return ret;
	}
	void Update(int node, int s, int e, int tar, int val) {
		if (s > tar || tar > e) return;
		if (s == e) {
			tree[node] = val;
			return;
		}
		int mid = s + e >> 1;
		Update(node<<1, s, mid, tar, val);
		Update(node<<1|1, mid+1, e, tar, val);
		tree[node] = max(tree[node<<1], tree[node<<1|1]);
	}
	int Query(int node, int s, int e, int l, int r) {
		if (l > e || s > r) return -1;
		if (l <= s && e <= r) return tree[node];
		int mid = s + e >> 1;
		return max(Query(node<<1, s, mid, l, r), Query(node<<1|1, mid+1, e, l, r));
	}
} seg;

int main() {
	ios_base :: sync_with_stdio(false); cin.tie(NULL);
	int n;
	cin >> n;
	vector<pii> a(n);
	vector<int> chk(2*n, 0);
	for (int i=0; i<n; i++) {
		cin >> a[i].first >> a[i].second;
	}
	sort(a.begin(), a.end());
	seg.Init(2*n);
	dsu.Init(2*n);
	for (int i=0; i<n; i++) {
		vector<int> v;
		while (true) {
			int ret = seg.Query(a[i].first, a[i].second);
			if (ret == -1) break;
			v.push_back(ret);
			seg.Update(a[ret].second, -1);
		}
		if (!v.empty()) {
			sort(v.begin(), v.end(), [&] (int &u, int &v) { return a[u].first < a[v].first; });
			for (int j=0; j<(int)v.size()-1; j++) {
				if (a[v[j]].second < a[v[j+1]].second) {
					cout << "0\n";
					return 0;
				}
			}
			for (auto &x : v) {
				chk[dsu.Find(x<<1)] = 1;
				if (chk[dsu.Find(x<<1)^1]) {
					cout << "0\n";
					return 0;
				}
			}
			for (auto &x : v) chk[dsu.Find(x<<1)] = 0;
			for (auto &x : v) {
				dsu.Union(v[0]<<1, x<<1);
				dsu.Union(v[0]<<1^1, x<<1^1);
			}
			dsu.Union(v[0]<<1^1, i<<1);
			dsu.Union(v[0]<<1, i<<1^1);
			for (auto &x : v) seg.Update(a[x].second, x);
		}
		seg.Update(a[i].second, i);
	}
	int ans = 1;
	for (int i=0; i<n; i++) {
		assert((dsu.Find(i<<1)^1) == dsu.Find(i<<1^1));
		if (dsu.Find(i<<1) == (i<<1)) {
			ans = ans * 2 % mod;
		}
	}
	cout << ans << '\n';
}

Compilation message

port_facility.cpp: In member function 'void SegmentTree::Update(int, int, int, int, int)':
port_facility.cpp:53:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |   int mid = s + e >> 1;
      |             ~~^~~
port_facility.cpp: In member function 'int SegmentTree::Query(int, int, int, int, int)':
port_facility.cpp:61:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   61 |   int mid = s + e >> 1;
      |             ~~^~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	5 ms	348 KB	Output is correct
26	Correct	7 ms	344 KB	Output is correct
27	Correct	6 ms	560 KB	Output is correct
28	Correct	11 ms	344 KB	Output is correct
29	Correct	7 ms	348 KB	Output is correct
30	Correct	9 ms	556 KB	Output is correct
31	Correct	7 ms	344 KB	Output is correct
32	Correct	6 ms	348 KB	Output is correct
33	Correct	4 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	468 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	2 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	214 ms	548 KB	Output is correct
42	Correct	200 ms	536 KB	Output is correct
43	Correct	2 ms	348 KB	Output is correct
44	Correct	2 ms	348 KB	Output is correct

Subtask #3
0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	5 ms	348 KB	Output is correct
26	Correct	7 ms	344 KB	Output is correct
27	Correct	6 ms	560 KB	Output is correct
28	Correct	11 ms	344 KB	Output is correct
29	Correct	7 ms	348 KB	Output is correct
30	Correct	9 ms	556 KB	Output is correct
31	Correct	7 ms	344 KB	Output is correct
32	Correct	6 ms	348 KB	Output is correct
33	Correct	4 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	468 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	2 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	214 ms	548 KB	Output is correct
42	Correct	200 ms	536 KB	Output is correct
43	Correct	2 ms	348 KB	Output is correct
44	Correct	2 ms	348 KB	Output is correct
45	Correct	728 ms	6120 KB	Output is correct
46	Correct	1875 ms	6128 KB	Output is correct
47	Correct	396 ms	6228 KB	Output is correct
48	Correct	1862 ms	6128 KB	Output is correct
49	Correct	560 ms	6228 KB	Output is correct
50	Correct	1039 ms	6384 KB	Output is correct
51	Correct	574 ms	6128 KB	Output is correct
52	Correct	40 ms	6100 KB	Output is correct
53	Correct	46 ms	6116 KB	Output is correct
54	Correct	21 ms	6224 KB	Output is correct
55	Correct	21 ms	5980 KB	Output is correct
56	Correct	21 ms	5972 KB	Output is correct
57	Correct	61 ms	6124 KB	Output is correct
58	Correct	41 ms	5980 KB	Output is correct
59	Correct	47 ms	6072 KB	Output is correct
60	Correct	65 ms	6120 KB	Output is correct
61	Correct	98 ms	5976 KB	Output is correct
62	Correct	22 ms	5980 KB	Output is correct
63	Correct	23 ms	5972 KB	Output is correct
64	Correct	22 ms	5976 KB	Output is correct
65	Correct	21 ms	5980 KB	Output is correct
66	Correct	22 ms	5972 KB	Output is correct
67	Execution timed out	6032 ms	7012 KB	Time limit exceeded
68	Halted	0 ms	0 KB	-

Subtask #4
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	5 ms	348 KB	Output is correct
26	Correct	7 ms	344 KB	Output is correct
27	Correct	6 ms	560 KB	Output is correct
28	Correct	11 ms	344 KB	Output is correct
29	Correct	7 ms	348 KB	Output is correct
30	Correct	9 ms	556 KB	Output is correct
31	Correct	7 ms	344 KB	Output is correct
32	Correct	6 ms	348 KB	Output is correct
33	Correct	4 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	468 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	2 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	214 ms	548 KB	Output is correct
42	Correct	200 ms	536 KB	Output is correct
43	Correct	2 ms	348 KB	Output is correct
44	Correct	2 ms	348 KB	Output is correct
45	Correct	728 ms	6120 KB	Output is correct
46	Correct	1875 ms	6128 KB	Output is correct
47	Correct	396 ms	6228 KB	Output is correct
48	Correct	1862 ms	6128 KB	Output is correct
49	Correct	560 ms	6228 KB	Output is correct
50	Correct	1039 ms	6384 KB	Output is correct
51	Correct	574 ms	6128 KB	Output is correct
52	Correct	40 ms	6100 KB	Output is correct
53	Correct	46 ms	6116 KB	Output is correct
54	Correct	21 ms	6224 KB	Output is correct
55	Correct	21 ms	5980 KB	Output is correct
56	Correct	21 ms	5972 KB	Output is correct
57	Correct	61 ms	6124 KB	Output is correct
58	Correct	41 ms	5980 KB	Output is correct
59	Correct	47 ms	6072 KB	Output is correct
60	Correct	65 ms	6120 KB	Output is correct
61	Correct	98 ms	5976 KB	Output is correct
62	Correct	22 ms	5980 KB	Output is correct
63	Correct	23 ms	5972 KB	Output is correct
64	Correct	22 ms	5976 KB	Output is correct
65	Correct	21 ms	5980 KB	Output is correct
66	Correct	22 ms	5972 KB	Output is correct
67	Execution timed out	6032 ms	7012 KB	Time limit exceeded
68	Halted	0 ms	0 KB	-

답안 #850134

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 56.0

Subtask #4 0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 56.0

Subtask #4
0 / 22.0