oj.uz

Submission #873150

# Submission time Handle Problem Language Result Execution time Memory
873150 2023-11-14T14:22:21 Z tvladm2009 Port Facility (JOI17_port_facility) C++17
78 / 100
 6000 ms 93128 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 1e6 + 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 4568 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 4448 KB Output is correct
11 Correct 1 ms 4564 KB Output is correct
12 Correct 1 ms 4448 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 1 ms 4564 KB Output is correct
20 Correct 1 ms 4700 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 4452 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 4568 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 4448 KB Output is correct
11 Correct 1 ms 4564 KB Output is correct
12 Correct 1 ms 4448 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 1 ms 4564 KB Output is correct
20 Correct 1 ms 4700 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 4452 KB Output is correct
25 Correct 3 ms 4596 KB Output is correct
26 Correct 3 ms 4708 KB Output is correct
27 Correct 3 ms 4832 KB Output is correct
28 Correct 3 ms 4708 KB Output is correct
29 Correct 2 ms 4712 KB Output is correct
30 Correct 2 ms 4712 KB Output is correct
31 Correct 3 ms 5084 KB Output is correct
32 Correct 3 ms 4712 KB Output is correct
33 Correct 3 ms 4580 KB Output is correct
34 Correct 2 ms 4828 KB Output is correct
35 Correct 2 ms 4576 KB Output is correct
36 Correct 2 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 3 ms 4568 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 3 ms 4700 KB Output is correct
43 Correct 3 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 4568 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 4448 KB Output is correct
11 Correct 1 ms 4564 KB Output is correct
12 Correct 1 ms 4448 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 1 ms 4564 KB Output is correct
20 Correct 1 ms 4700 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 4452 KB Output is correct
25 Correct 3 ms 4596 KB Output is correct
26 Correct 3 ms 4708 KB Output is correct
27 Correct 3 ms 4832 KB Output is correct
28 Correct 3 ms 4708 KB Output is correct
29 Correct 2 ms 4712 KB Output is correct
30 Correct 2 ms 4712 KB Output is correct
31 Correct 3 ms 5084 KB Output is correct
32 Correct 3 ms 4712 KB Output is correct
33 Correct 3 ms 4580 KB Output is correct
34 Correct 2 ms 4828 KB Output is correct
35 Correct 2 ms 4576 KB Output is correct
36 Correct 2 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 3 ms 4568 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 3 ms 4700 KB Output is correct
43 Correct 3 ms 4700 KB Output is correct
44 Correct 2 ms 4696 KB Output is correct
45 Correct 130 ms 21052 KB Output is correct
46 Correct 124 ms 22728 KB Output is correct
47 Correct 119 ms 20428 KB Output is correct
48 Correct 124 ms 22100 KB Output is correct
49 Correct 119 ms 20808 KB Output is correct
50 Correct 118 ms 21964 KB Output is correct
51 Correct 119 ms 21940 KB Output is correct
52 Correct 103 ms 20080 KB Output is correct
53 Correct 135 ms 20832 KB Output is correct
54 Correct 111 ms 28936 KB Output is correct
55 Correct 108 ms 24240 KB Output is correct
56 Correct 106 ms 24348 KB Output is correct
57 Correct 103 ms 20204 KB Output is correct
58 Correct 102 ms 19916 KB Output is correct
59 Correct 123 ms 19916 KB Output is correct
60 Correct 117 ms 19944 KB Output is correct
61 Correct 131 ms 19896 KB Output is correct
62 Correct 97 ms 19944 KB Output is correct
63 Correct 111 ms 19816 KB Output is correct
64 Correct 116 ms 19684 KB Output is correct
65 Correct 147 ms 27844 KB Output is correct
66 Correct 148 ms 27940 KB Output is correct
67 Correct 124 ms 28600 KB Output is correct
68 Correct 137 ms 28684 KB Output is correct
69 Correct 120 ms 26572 KB Output is correct
70 Correct 118 ms 26792 KB Output is correct
71 Correct 118 ms 29752 KB Output is correct
72 Correct 118 ms 29612 KB Output is correct
73 Correct 108 ms 26912 KB Output is correct
74 Correct 116 ms 26604 KB Output is correct
75 Correct 104 ms 25540 KB Output is correct
76 Correct 103 ms 29260 KB Output is correct
77 Correct 113 ms 29152 KB Output is correct
78 Correct 127 ms 22372 KB Output is correct
79 Correct 116 ms 21164 KB Output is correct

Subtask #4
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 4568 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 4448 KB Output is correct
11 Correct 1 ms 4564 KB Output is correct
12 Correct 1 ms 4448 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4448 KB Output is correct
19 Correct 1 ms 4564 KB Output is correct
20 Correct 1 ms 4700 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 4452 KB Output is correct
25 Correct 3 ms 4596 KB Output is correct
26 Correct 3 ms 4708 KB Output is correct
27 Correct 3 ms 4832 KB Output is correct
28 Correct 3 ms 4708 KB Output is correct
29 Correct 2 ms 4712 KB Output is correct
30 Correct 2 ms 4712 KB Output is correct
31 Correct 3 ms 5084 KB Output is correct
32 Correct 3 ms 4712 KB Output is correct
33 Correct 3 ms 4580 KB Output is correct
34 Correct 2 ms 4828 KB Output is correct
35 Correct 2 ms 4576 KB Output is correct
36 Correct 2 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 3 ms 4568 KB Output is correct
41 Correct 2 ms 4700 KB Output is correct
42 Correct 3 ms 4700 KB Output is correct
43 Correct 3 ms 4700 KB Output is correct
44 Correct 2 ms 4696 KB Output is correct
45 Correct 130 ms 21052 KB Output is correct
46 Correct 124 ms 22728 KB Output is correct
47 Correct 119 ms 20428 KB Output is correct
48 Correct 124 ms 22100 KB Output is correct
49 Correct 119 ms 20808 KB Output is correct
50 Correct 118 ms 21964 KB Output is correct
51 Correct 119 ms 21940 KB Output is correct
52 Correct 103 ms 20080 KB Output is correct
53 Correct 135 ms 20832 KB Output is correct
54 Correct 111 ms 28936 KB Output is correct
55 Correct 108 ms 24240 KB Output is correct
56 Correct 106 ms 24348 KB Output is correct
57 Correct 103 ms 20204 KB Output is correct
58 Correct 102 ms 19916 KB Output is correct
59 Correct 123 ms 19916 KB Output is correct
60 Correct 117 ms 19944 KB Output is correct
61 Correct 131 ms 19896 KB Output is correct
62 Correct 97 ms 19944 KB Output is correct
63 Correct 111 ms 19816 KB Output is correct
64 Correct 116 ms 19684 KB Output is correct
65 Correct 147 ms 27844 KB Output is correct
66 Correct 148 ms 27940 KB Output is correct
67 Correct 124 ms 28600 KB Output is correct
68 Correct 137 ms 28684 KB Output is correct
69 Correct 120 ms 26572 KB Output is correct
70 Correct 118 ms 26792 KB Output is correct
71 Correct 118 ms 29752 KB Output is correct
72 Correct 118 ms 29612 KB Output is correct
73 Correct 108 ms 26912 KB Output is correct
74 Correct 116 ms 26604 KB Output is correct
75 Correct 104 ms 25540 KB Output is correct
76 Correct 103 ms 29260 KB Output is correct
77 Correct 113 ms 29152 KB Output is correct
78 Correct 127 ms 22372 KB Output is correct
79 Correct 116 ms 21164 KB Output is correct
80 Execution timed out 6022 ms 93128 KB Time limit exceeded
81 Halted 0 ms 0 KB -