oj.uz

Submission #359424

# Submission time Handle Problem Language Result Execution time Memory
359424 2021-01-27T01:35:15 Z ijxjdjd Port Facility (JOI17_port_facility) C++14
100 / 100
 791 ms 163644 KB 
#include <bits/stdc++.h>
#include <assert.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
using namespace std;

using ll = long long;

const int MAXN = (int)(5e5) + 5;
int erase(pair<set<int>, set<int>>& s, int val, bool rem) {
    if (s.first.find(val) != s.first.end()) {
        if (rem) {
            s.first.erase(s.first.find(val));
        }
        return 0;
    }
    else {
        if (rem) {
            s.second.erase(s.second.find(val));
        }
        return 1;
    }
}
int main() {
	cin.tie(0);
	cin.sync_with_stdio(0);
	int N;
	cin >> N;
	vector<int> order;
	order.resize(2*N);
	FR(i, N) {
	    int a, b;
	    cin >> a >> b;
	    a--, b--;
	    order[a] = b;
	    order[b] = -a;
	}
	bool zero = false;
	int cnt = 0;
	vector<pair<set<int>, set<int>>> intervals;
	for (int i = 0; i < 2*N; i++) {
        if (order[i] <= 0) {
            erase(intervals.back(), i, true);
            if (intervals.back().first.size() + intervals.back().second.size()  == 0) {
                intervals.pop_back();
                cnt++;
            }
        }
        else {
            if (intervals.size() == 0) {
                intervals.emplace_back();
                intervals.back().first.insert(order[i]);
            }
            else {
                int j = intervals.size()-1;
                pair<set<int>, set<int>> add;
                add.first.insert(order[i]);
                intervals.push_back(add);
                while (j >= 0) {
                    auto& next = intervals.back();
                    if (intervals[j].first.size() == 0) {
                        swap(intervals[j].first, intervals[j].second);
                    }
                    if (intervals[j].second.size() == 0) {
                        if (*intervals[j].first.begin() <= order[i]) {
                            int col = erase(next, order[i], false);
                            if (intervals[j].first.size() + intervals[j].second.size() > next.first.size() + next.second.size()) {
                                swap(intervals[j], next);
                            }
                            if (col == 0) {
                                swap(intervals[j].first, intervals[j].second);
                            }
                            next.first.insert(intervals[j].first.begin(), intervals[j].first.end());
                            next.second.insert(intervals[j].second.begin(), intervals[j].second.end());
                        }
                        else {
                            break;
                        }

                    }
                    else {
                        if (max(*intervals[j].first.begin(), *intervals[j].second.begin()) <= order[i]) {
                            zero = true;
                            i = 3*N;
                            break;
                        }
                        else if (min(*intervals[j].first.begin(), *intervals[j].second.begin()) >= order[i]){
                            break;
                        }
                        else {
                            int col = erase(next, order[i], false);
                            if (*intervals[j].first.begin() > *intervals[j].second.begin()) {
                                swap(intervals[j].first, intervals[j].second);
                            }
                            if (next.first.size() + next.second.size() < intervals[j].first.size() + intervals[j].second.size()) {
                                swap(next, intervals[j]);
                            }
                            if (col == 0) {
                                swap(intervals[j].first, intervals[j].second);
                            }
                            next.first.insert(intervals[j].first.begin(), intervals[j].first.end());
                            next.second.insert(intervals[j].second.begin(), intervals[j].second.end());

                        }
                    }
                    if (intervals.back().first.size() + intervals.back().second.size() > intervals[j].first.size() + intervals[j].second.size()) {
                        swap(intervals[j+1], intervals[j]);
                    }
                    intervals.pop_back();
                    j--;
                }
//                cout << track << '\n';
            }
        }
	}
	ll tot = !zero;
	ll MOD = (int)(1e9) + 7;
	FR(i, cnt) {
        tot += tot;
        if (tot >= MOD) {
            tot -= MOD;
        }
    }
    cout << tot << '\n';
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 376 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 0 ms 364 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 376 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 0 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 732 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 376 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 0 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 732 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 53 ms 3564 KB Output is correct
46 Correct 55 ms 4716 KB Output is correct
47 Correct 53 ms 4760 KB Output is correct
48 Correct 55 ms 4716 KB Output is correct
49 Correct 52 ms 4844 KB Output is correct
50 Correct 28 ms 3308 KB Output is correct
51 Correct 35 ms 4076 KB Output is correct
52 Correct 27 ms 2392 KB Output is correct
53 Correct 48 ms 17800 KB Output is correct
54 Correct 21 ms 2412 KB Output is correct
55 Correct 21 ms 2412 KB Output is correct
56 Correct 21 ms 2412 KB Output is correct
57 Correct 33 ms 2412 KB Output is correct
58 Correct 30 ms 2540 KB Output is correct
59 Correct 38 ms 6928 KB Output is correct
60 Correct 44 ms 6688 KB Output is correct
61 Correct 47 ms 4644 KB Output is correct
62 Correct 21 ms 2540 KB Output is correct
63 Correct 22 ms 2456 KB Output is correct
64 Correct 22 ms 2412 KB Output is correct
65 Correct 22 ms 2412 KB Output is correct
66 Correct 21 ms 2412 KB Output is correct
67 Correct 58 ms 10124 KB Output is correct
68 Correct 58 ms 10124 KB Output is correct
69 Correct 59 ms 10124 KB Output is correct
70 Correct 57 ms 10124 KB Output is correct
71 Correct 67 ms 11776 KB Output is correct
72 Correct 64 ms 11776 KB Output is correct
73 Correct 64 ms 10372 KB Output is correct
74 Correct 64 ms 10240 KB Output is correct
75 Correct 37 ms 2412 KB Output is correct
76 Correct 43 ms 2412 KB Output is correct
77 Correct 41 ms 2412 KB Output is correct
78 Correct 54 ms 4716 KB Output is correct
79 Correct 53 ms 4716 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 376 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 0 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 732 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 53 ms 3564 KB Output is correct
46 Correct 55 ms 4716 KB Output is correct
47 Correct 53 ms 4760 KB Output is correct
48 Correct 55 ms 4716 KB Output is correct
49 Correct 52 ms 4844 KB Output is correct
50 Correct 28 ms 3308 KB Output is correct
51 Correct 35 ms 4076 KB Output is correct
52 Correct 27 ms 2392 KB Output is correct
53 Correct 48 ms 17800 KB Output is correct
54 Correct 21 ms 2412 KB Output is correct
55 Correct 21 ms 2412 KB Output is correct
56 Correct 21 ms 2412 KB Output is correct
57 Correct 33 ms 2412 KB Output is correct
58 Correct 30 ms 2540 KB Output is correct
59 Correct 38 ms 6928 KB Output is correct
60 Correct 44 ms 6688 KB Output is correct
61 Correct 47 ms 4644 KB Output is correct
62 Correct 21 ms 2540 KB Output is correct
63 Correct 22 ms 2456 KB Output is correct
64 Correct 22 ms 2412 KB Output is correct
65 Correct 22 ms 2412 KB Output is correct
66 Correct 21 ms 2412 KB Output is correct
67 Correct 58 ms 10124 KB Output is correct
68 Correct 58 ms 10124 KB Output is correct
69 Correct 59 ms 10124 KB Output is correct
70 Correct 57 ms 10124 KB Output is correct
71 Correct 67 ms 11776 KB Output is correct
72 Correct 64 ms 11776 KB Output is correct
73 Correct 64 ms 10372 KB Output is correct
74 Correct 64 ms 10240 KB Output is correct
75 Correct 37 ms 2412 KB Output is correct
76 Correct 43 ms 2412 KB Output is correct
77 Correct 41 ms 2412 KB Output is correct
78 Correct 54 ms 4716 KB Output is correct
79 Correct 53 ms 4716 KB Output is correct
80 Correct 644 ms 46240 KB Output is correct
81 Correct 628 ms 46632 KB Output is correct
82 Correct 626 ms 46680 KB Output is correct
83 Correct 640 ms 46316 KB Output is correct
84 Correct 636 ms 46444 KB Output is correct
85 Correct 435 ms 38952 KB Output is correct
86 Correct 474 ms 42732 KB Output is correct
87 Correct 353 ms 22764 KB Output is correct
88 Correct 565 ms 163644 KB Output is correct
89 Correct 313 ms 22892 KB Output is correct
90 Correct 302 ms 22764 KB Output is correct
91 Correct 311 ms 22780 KB Output is correct
92 Correct 406 ms 22764 KB Output is correct
93 Correct 381 ms 22764 KB Output is correct
94 Correct 494 ms 86624 KB Output is correct
95 Correct 555 ms 48512 KB Output is correct
96 Correct 596 ms 41888 KB Output is correct
97 Correct 355 ms 40124 KB Output is correct
98 Correct 397 ms 38544 KB Output is correct
99 Correct 341 ms 26280 KB Output is correct
100 Correct 324 ms 22764 KB Output is correct
101 Correct 312 ms 22764 KB Output is correct
102 Correct 716 ms 93152 KB Output is correct
103 Correct 753 ms 93472 KB Output is correct
104 Correct 723 ms 85408 KB Output is correct
105 Correct 711 ms 85560 KB Output is correct
106 Correct 777 ms 117024 KB Output is correct
107 Correct 782 ms 116912 KB Output is correct
108 Correct 782 ms 101152 KB Output is correct
109 Correct 791 ms 101152 KB Output is correct
110 Correct 464 ms 22764 KB Output is correct
111 Correct 512 ms 22796 KB Output is correct
112 Correct 501 ms 22892 KB Output is correct
113 Correct 614 ms 46756 KB Output is correct
114 Correct 637 ms 46444 KB Output is correct