oj.uz

Submission #873152

# Submission time Handle Problem Language Result Execution time Memory
873152 2023-11-14T14:23:52 Z perohero Port Facility (JOI17_port_facility) C++17
100 / 100
 2365 ms 213968 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 2e6 + 7;
const int M = 1e9 + 7;
const int INF = 2e9;

int add(int a, int b) {
    return a + b >= M ? a + b - M : a + b;
}

int mul(int a, int b) {
    return a * 1ll * b % M;
}

int n;
pair<int, int> a[N];
int ind[N];
int color[N];

struct segtree {
    vector<int> tree;

    segtree() {}

    void init(int n) {
        tree.resize(4 * n + 1);
        build(1, 1, n);
    }

    void build(int v, int tl, int tr) {
        tree[v] = -INF;
        if (tl < tr) {
            int tm = (tl + tr) / 2;
            build(2 * v, tl, tm);
            build(2 * v + 1, tm + 1, tr);
        }
    }

    void update(int v, int tl, int tr, int pos, int val) {
        if (tl == tr) {
            tree[v] = val;
            return;
        }
        int tm = (tl + tr) / 2;
        if (pos <= tm) {
            update(2 * v, tl, tm, pos, val);
        } else {
            update(2 * v + 1, tm + 1, tr, pos, val);
        }
        tree[v] = max(tree[2 * v], tree[2 * v + 1]);
    }

    int query(int v, int tl, int tr, int l, int r, int val) {
        if (tr < l || tl > r) return -1;
        if (l <= tl && tr <= r) {
            if (tree[v] > val) {
                if (tree[v] > 0) {
                    return ind[tree[v]];
                } else {
                    return ind[tree[v] * -1];
                }
            }
            return -1;
        }
        int tm = (tl + tr) / 2;
        int ret = -1;
        ret = query(2 * v, tl, tm, l, r, val);
        if (ret != -1) {
            return ret;
        }
        ret = query(2 * v + 1, tm + 1, tr, l, r, val);
        return ret;
    }

    void delete_kek(int v, int tl, int tr, int pos) {
        if (tl == tr) {
            tree[v] = -INF;
            return;
        }
        int tm = (tl + tr) / 2;
        if (pos <= tm) {
            delete_kek(2 * v, tl, tm, pos);
        } else {
            delete_kek(2 * v + 1, tm + 1, tr, pos);
        }
        tree[v] = max(tree[2 * v], tree[2 * v + 1]);
    }
};

segtree kek1, kek2;

void dfs(int v, int c = 0) {
    kek1.delete_kek(1, 1, 2 * n, a[v].first);
    kek2.delete_kek(1, 1, 2 * n, a[v].second);
    color[v] = c;
    while (true) {
        int i = kek1.query(1, 1, 2 * n, a[v].first, a[v].second, a[v].second);
        if (i == -1) {
            break;
        }
        dfs(i, 1 - c);
    }
    while (true) {
        int i = kek2.query(1, 1, 2 * n, a[v].first, a[v].second, -a[v].first);
        if (i == -1) {
            break;
        }
        dfs(i, 1 - c);
    }
}

bool check(vector<pair<int, int>> a) {
    sort(a.begin(), a.end());
    priority_queue<int, vector<int>, greater<int>> q;
    for (int i = 0; i < a.size(); ++i) {
        while (!q.empty() && q.top() < a[i].first) {
            q.pop();
        }
        if (!q.empty() && q.top() < a[i].second) {
            return 0;
        }
        q.push(a[i].second);
    }
    return 1;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].first >> a[i].second;
    }
    kek1.init(2 * n);
    kek2.init(2 * n);
    for (int i = 1; i <= n; ++i) {
        kek1.update(1, 1, 2 * n, a[i].first, a[i].second);
        kek2.update(1, 1, 2 * n, a[i].second, -a[i].first);
        ind[a[i].first] = ind[a[i].second] = i;
    }
    for (int i = 1; i <= n; ++i) {
        color[i] = -1;
    }
    int ans = 1;
    for (int i = 1; i <= n; ++i) {
        if (color[i] == -1) {
            ans = mul(ans, 2);
            dfs(i);
        }
    }
    vector<vector<pair<int, int>>> v(2);
    for (int i = 1; i <= n; ++i) {
        v[color[i]].push_back(a[i]);
    }
    if (check(v[0]) && check(v[1])) {
        cout << ans << "\n";
    } else {
        cout << "0\n";
    }
    return 0;
}

Compilation message

port_facility.cpp: In function 'bool check(std::vector<std::pair<int, int> >)':
port_facility.cpp:119:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for (int i = 0; i < a.size(); ++i) {
      |                     ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 3 ms 4700 KB Output is correct
27 Correct 2 ms 4700 KB Output is correct
28 Correct 2 ms 4700 KB Output is correct
29 Correct 2 ms 4696 KB Output is correct
30 Correct 3 ms 4700 KB Output is correct
31 Correct 2 ms 4952 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 2 ms 4700 KB Output is correct
35 Correct 2 ms 4692 KB Output is correct
36 Correct 3 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4700 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 2 ms 4700 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 2 ms 4696 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 2 ms 4696 KB Output is correct
45 Correct 116 ms 17632 KB Output is correct
46 Correct 124 ms 19316 KB Output is correct
47 Correct 120 ms 17092 KB Output is correct
48 Correct 119 ms 18628 KB Output is correct
49 Correct 112 ms 17364 KB Output is correct
50 Correct 102 ms 18716 KB Output is correct
51 Correct 116 ms 18448 KB Output is correct
52 Correct 94 ms 16584 KB Output is correct
53 Correct 124 ms 17528 KB Output is correct
54 Correct 109 ms 25740 KB Output is correct
55 Correct 117 ms 21044 KB Output is correct
56 Correct 109 ms 21040 KB Output is correct
57 Correct 112 ms 16848 KB Output is correct
58 Correct 106 ms 16588 KB Output is correct
59 Correct 121 ms 16760 KB Output is correct
60 Correct 131 ms 16868 KB Output is correct
61 Correct 115 ms 16588 KB Output is correct
62 Correct 97 ms 16460 KB Output is correct
63 Correct 110 ms 16352 KB Output is correct
64 Correct 101 ms 16384 KB Output is correct
65 Correct 150 ms 24540 KB Output is correct
66 Correct 131 ms 24528 KB Output is correct
67 Correct 114 ms 25228 KB Output is correct
68 Correct 116 ms 25180 KB Output is correct
69 Correct 110 ms 23240 KB Output is correct
70 Correct 112 ms 23504 KB Output is correct
71 Correct 111 ms 26356 KB Output is correct
72 Correct 128 ms 26308 KB Output is correct
73 Correct 108 ms 23612 KB Output is correct
74 Correct 109 ms 23344 KB Output is correct
75 Correct 98 ms 22364 KB Output is correct
76 Correct 103 ms 25988 KB Output is correct
77 Correct 94 ms 25712 KB Output is correct
78 Correct 111 ms 19140 KB Output is correct
79 Correct 117 ms 18072 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 3 ms 4700 KB Output is correct
27 Correct 2 ms 4700 KB Output is correct
28 Correct 2 ms 4700 KB Output is correct
29 Correct 2 ms 4696 KB Output is correct
30 Correct 3 ms 4700 KB Output is correct
31 Correct 2 ms 4952 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 2 ms 4700 KB Output is correct
35 Correct 2 ms 4692 KB Output is correct
36 Correct 3 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4700 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 2 ms 4700 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 2 ms 4696 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 2 ms 4696 KB Output is correct
45 Correct 116 ms 17632 KB Output is correct
46 Correct 124 ms 19316 KB Output is correct
47 Correct 120 ms 17092 KB Output is correct
48 Correct 119 ms 18628 KB Output is correct
49 Correct 112 ms 17364 KB Output is correct
50 Correct 102 ms 18716 KB Output is correct
51 Correct 116 ms 18448 KB Output is correct
52 Correct 94 ms 16584 KB Output is correct
53 Correct 124 ms 17528 KB Output is correct
54 Correct 109 ms 25740 KB Output is correct
55 Correct 117 ms 21044 KB Output is correct
56 Correct 109 ms 21040 KB Output is correct
57 Correct 112 ms 16848 KB Output is correct
58 Correct 106 ms 16588 KB Output is correct
59 Correct 121 ms 16760 KB Output is correct
60 Correct 131 ms 16868 KB Output is correct
61 Correct 115 ms 16588 KB Output is correct
62 Correct 97 ms 16460 KB Output is correct
63 Correct 110 ms 16352 KB Output is correct
64 Correct 101 ms 16384 KB Output is correct
65 Correct 150 ms 24540 KB Output is correct
66 Correct 131 ms 24528 KB Output is correct
67 Correct 114 ms 25228 KB Output is correct
68 Correct 116 ms 25180 KB Output is correct
69 Correct 110 ms 23240 KB Output is correct
70 Correct 112 ms 23504 KB Output is correct
71 Correct 111 ms 26356 KB Output is correct
72 Correct 128 ms 26308 KB Output is correct
73 Correct 108 ms 23612 KB Output is correct
74 Correct 109 ms 23344 KB Output is correct
75 Correct 98 ms 22364 KB Output is correct
76 Correct 103 ms 25988 KB Output is correct
77 Correct 94 ms 25712 KB Output is correct
78 Correct 111 ms 19140 KB Output is correct
79 Correct 117 ms 18072 KB Output is correct
80 Correct 1623 ms 109728 KB Output is correct
81 Correct 1669 ms 123092 KB Output is correct
82 Correct 1593 ms 120072 KB Output is correct
83 Correct 1636 ms 124884 KB Output is correct
84 Correct 1647 ms 124616 KB Output is correct
85 Correct 1528 ms 116892 KB Output is correct
86 Correct 1529 ms 119668 KB Output is correct
87 Correct 1555 ms 116520 KB Output is correct
88 Correct 1980 ms 124056 KB Output is correct
89 Correct 1541 ms 206152 KB Output is correct
90 Correct 1442 ms 159144 KB Output is correct
91 Correct 1500 ms 159300 KB Output is correct
92 Correct 1604 ms 116372 KB Output is correct
93 Correct 1589 ms 116164 KB Output is correct
94 Correct 1837 ms 119176 KB Output is correct
95 Correct 1755 ms 118900 KB Output is correct
96 Correct 1618 ms 117904 KB Output is correct
97 Correct 1669 ms 117920 KB Output is correct
98 Correct 1728 ms 119220 KB Output is correct
99 Correct 1636 ms 116100 KB Output is correct
100 Correct 2312 ms 204480 KB Output is correct
101 Correct 2365 ms 204600 KB Output is correct
102 Correct 1748 ms 205008 KB Output is correct
103 Correct 1654 ms 205120 KB Output is correct
104 Correct 1636 ms 188564 KB Output is correct
105 Correct 1624 ms 187296 KB Output is correct
106 Correct 1550 ms 213956 KB Output is correct
107 Correct 1559 ms 213968 KB Output is correct
108 Correct 1446 ms 185104 KB Output is correct
109 Correct 1528 ms 184600 KB Output is correct
110 Correct 1411 ms 208124 KB Output is correct
111 Correct 1459 ms 210352 KB Output is correct
112 Correct 1390 ms 206292 KB Output is correct
113 Correct 1621 ms 120228 KB Output is correct
114 Correct 1654 ms 122576 KB Output is correct