oj.uz

Submission #953961

# Submission time Handle Problem Language Result Execution time Memory
953961 2024-03-27T02:11:20 Z Pring Port Facility (JOI17_port_facility) C++17
100 / 100
 1182 ms 228028 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 2000005, mod = 1000000007;
int n, a[MXN];
pii p[MXN];
int N;
bitset<MXN> b;
// vector<pii> st;
set<pii> st;

void PCOUT(priority_queue<pii> &pq) {
    vector<pii> v;
    cout << "PQ: ";
    while (pq.size()) {
        cout << '<' << pq.top().fs << ' ' << pq.top().sc << "> ";
        v.push_back(pq.top());
        pq.pop();
    }
    cout << endl;
    for (auto &i : v) pq.push(i);
}

void MERGE(priority_queue<pii> &a, priority_queue<pii> &b) {
    if (a.size() < b.size()) swap(a, b);
    while (b.size()) {
        a.push(b.top());
        b.pop();
    }
}

void UPDATE(priority_queue<pii> &pq) {
    while (pq.size() && !b[pq.top().sc]) pq.pop();
}

struct DSU {
    int p[MXN], nc;
    priority_queue<pii> pq[MXN];

    void init(int n) {
        fill(p + 1, p + n + 1, -1);
        nc = n;
    }

    int find(int x) {
        return (p[x] < 0 ? x : p[x] = find(p[x]));
    }

    bool onion(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        if (p[x] > p[y]) swap(x, y);
        p[x] += p[y];
        p[y] = x;
        MERGE(pq[x], pq[y]);
        nc--;
        return true;
    }
} dsu;

void ADD(int l, int id) {
    b[id] = true;
    st.insert(mp(l, id));
    // dsu.pq[id].push(mp(l, id));
}

void REMOVE(int l, int r, int id) {
    b[id] = false;
    while (st.size() && st.rbegin() -> fs >= l) {
        auto [l2, id2] = *st.rbegin();
        if (id2 != id) {
            dsu.onion(id, id2 + n);
            dsu.onion(id + n, id2);
        }
        st.erase(prev(st.end()));
    }
    UPDATE(dsu.pq[dsu.find(id)]);
    if (dsu.pq[dsu.find(id)].size()) st.insert(dsu.pq[dsu.find(id)].top());
    UPDATE(dsu.pq[dsu.find(id + n)]);
    if (dsu.pq[dsu.find(id + n)].size()) st.insert(dsu.pq[dsu.find(id + n)].top());
}

int POW(int a, int b) {
    int ans = 1;
    for (int i = 1 << 20; i > 0; i >>= 1) {
        ans = ans * ans % mod;
        if (i & b) ans = ans * a % mod;
    }
    return ans;
}

int miku() {
    cin >> n;
    N = n * 2;
    dsu.init(N);
    FOR(i, 1, n + 1) {
        cin >> p[i].fs >> p[i].sc;
        a[p[i].fs] = i;
        a[p[i].sc] = -i;
        dsu.pq[i].push(mp(p[i].fs, i));
    }
    FOR(i, 1, N + 1) {
        if (a[i] > 0) {
            ADD(i, a[i]);
        } else {
            REMOVE(p[-a[i]].fs, p[-a[i]].sc, -a[i]);
        }
    }
    FOR(i, 1, n) if (dsu.find(i) == dsu.find(i + n)) return 0;
    return POW(2, dsu.nc / 2);
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    cout << miku() << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 67932 KB Output is correct
2 Correct 14 ms 68184 KB Output is correct
3 Correct 13 ms 68084 KB Output is correct
4 Correct 15 ms 67932 KB Output is correct
5 Correct 16 ms 68220 KB Output is correct
6 Correct 14 ms 67932 KB Output is correct
7 Correct 13 ms 68112 KB Output is correct
8 Correct 13 ms 67932 KB Output is correct
9 Correct 14 ms 68188 KB Output is correct
10 Correct 13 ms 67932 KB Output is correct
11 Correct 16 ms 67928 KB Output is correct
12 Correct 13 ms 68172 KB Output is correct
13 Correct 13 ms 68176 KB Output is correct
14 Correct 13 ms 67932 KB Output is correct
15 Correct 13 ms 67932 KB Output is correct
16 Correct 14 ms 67932 KB Output is correct
17 Correct 15 ms 67932 KB Output is correct
18 Correct 14 ms 68176 KB Output is correct
19 Correct 13 ms 67932 KB Output is correct
20 Correct 14 ms 67932 KB Output is correct
21 Correct 14 ms 67932 KB Output is correct
22 Correct 14 ms 67932 KB Output is correct
23 Correct 14 ms 68052 KB Output is correct
24 Correct 14 ms 67932 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 67932 KB Output is correct
2 Correct 14 ms 68184 KB Output is correct
3 Correct 13 ms 68084 KB Output is correct
4 Correct 15 ms 67932 KB Output is correct
5 Correct 16 ms 68220 KB Output is correct
6 Correct 14 ms 67932 KB Output is correct
7 Correct 13 ms 68112 KB Output is correct
8 Correct 13 ms 67932 KB Output is correct
9 Correct 14 ms 68188 KB Output is correct
10 Correct 13 ms 67932 KB Output is correct
11 Correct 16 ms 67928 KB Output is correct
12 Correct 13 ms 68172 KB Output is correct
13 Correct 13 ms 68176 KB Output is correct
14 Correct 13 ms 67932 KB Output is correct
15 Correct 13 ms 67932 KB Output is correct
16 Correct 14 ms 67932 KB Output is correct
17 Correct 15 ms 67932 KB Output is correct
18 Correct 14 ms 68176 KB Output is correct
19 Correct 13 ms 67932 KB Output is correct
20 Correct 14 ms 67932 KB Output is correct
21 Correct 14 ms 67932 KB Output is correct
22 Correct 14 ms 67932 KB Output is correct
23 Correct 14 ms 68052 KB Output is correct
24 Correct 14 ms 67932 KB Output is correct
25 Correct 15 ms 68188 KB Output is correct
26 Correct 14 ms 68352 KB Output is correct
27 Correct 15 ms 68200 KB Output is correct
28 Correct 15 ms 68184 KB Output is correct
29 Correct 18 ms 68128 KB Output is correct
30 Correct 18 ms 68188 KB Output is correct
31 Correct 15 ms 68188 KB Output is correct
32 Correct 15 ms 68188 KB Output is correct
33 Correct 14 ms 68188 KB Output is correct
34 Correct 15 ms 68188 KB Output is correct
35 Correct 14 ms 68188 KB Output is correct
36 Correct 14 ms 68188 KB Output is correct
37 Correct 16 ms 68440 KB Output is correct
38 Correct 14 ms 68392 KB Output is correct
39 Correct 15 ms 68188 KB Output is correct
40 Correct 14 ms 68292 KB Output is correct
41 Correct 15 ms 68376 KB Output is correct
42 Correct 17 ms 68288 KB Output is correct
43 Correct 15 ms 68184 KB Output is correct
44 Correct 15 ms 68288 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 67932 KB Output is correct
2 Correct 14 ms 68184 KB Output is correct
3 Correct 13 ms 68084 KB Output is correct
4 Correct 15 ms 67932 KB Output is correct
5 Correct 16 ms 68220 KB Output is correct
6 Correct 14 ms 67932 KB Output is correct
7 Correct 13 ms 68112 KB Output is correct
8 Correct 13 ms 67932 KB Output is correct
9 Correct 14 ms 68188 KB Output is correct
10 Correct 13 ms 67932 KB Output is correct
11 Correct 16 ms 67928 KB Output is correct
12 Correct 13 ms 68172 KB Output is correct
13 Correct 13 ms 68176 KB Output is correct
14 Correct 13 ms 67932 KB Output is correct
15 Correct 13 ms 67932 KB Output is correct
16 Correct 14 ms 67932 KB Output is correct
17 Correct 15 ms 67932 KB Output is correct
18 Correct 14 ms 68176 KB Output is correct
19 Correct 13 ms 67932 KB Output is correct
20 Correct 14 ms 67932 KB Output is correct
21 Correct 14 ms 67932 KB Output is correct
22 Correct 14 ms 67932 KB Output is correct
23 Correct 14 ms 68052 KB Output is correct
24 Correct 14 ms 67932 KB Output is correct
25 Correct 15 ms 68188 KB Output is correct
26 Correct 14 ms 68352 KB Output is correct
27 Correct 15 ms 68200 KB Output is correct
28 Correct 15 ms 68184 KB Output is correct
29 Correct 18 ms 68128 KB Output is correct
30 Correct 18 ms 68188 KB Output is correct
31 Correct 15 ms 68188 KB Output is correct
32 Correct 15 ms 68188 KB Output is correct
33 Correct 14 ms 68188 KB Output is correct
34 Correct 15 ms 68188 KB Output is correct
35 Correct 14 ms 68188 KB Output is correct
36 Correct 14 ms 68188 KB Output is correct
37 Correct 16 ms 68440 KB Output is correct
38 Correct 14 ms 68392 KB Output is correct
39 Correct 15 ms 68188 KB Output is correct
40 Correct 14 ms 68292 KB Output is correct
41 Correct 15 ms 68376 KB Output is correct
42 Correct 17 ms 68288 KB Output is correct
43 Correct 15 ms 68184 KB Output is correct
44 Correct 15 ms 68288 KB Output is correct
45 Correct 74 ms 79768 KB Output is correct
46 Correct 81 ms 79844 KB Output is correct
47 Correct 74 ms 79928 KB Output is correct
48 Correct 82 ms 79944 KB Output is correct
49 Correct 79 ms 79696 KB Output is correct
50 Correct 98 ms 80024 KB Output is correct
51 Correct 83 ms 80232 KB Output is correct
52 Correct 59 ms 76816 KB Output is correct
53 Correct 71 ms 82872 KB Output is correct
54 Correct 78 ms 84684 KB Output is correct
55 Correct 80 ms 82004 KB Output is correct
56 Correct 86 ms 82020 KB Output is correct
57 Correct 58 ms 76760 KB Output is correct
58 Correct 51 ms 76640 KB Output is correct
59 Correct 60 ms 78844 KB Output is correct
60 Correct 63 ms 78932 KB Output is correct
61 Correct 70 ms 78716 KB Output is correct
62 Correct 63 ms 79140 KB Output is correct
63 Correct 83 ms 78484 KB Output is correct
64 Correct 73 ms 79196 KB Output is correct
65 Correct 80 ms 80972 KB Output is correct
66 Correct 78 ms 81524 KB Output is correct
67 Correct 90 ms 80716 KB Output is correct
68 Correct 83 ms 81136 KB Output is correct
69 Correct 84 ms 81128 KB Output is correct
70 Correct 83 ms 81144 KB Output is correct
71 Correct 86 ms 83568 KB Output is correct
72 Correct 100 ms 83612 KB Output is correct
73 Correct 88 ms 84024 KB Output is correct
74 Correct 80 ms 84144 KB Output is correct
75 Correct 64 ms 76820 KB Output is correct
76 Correct 58 ms 76816 KB Output is correct
77 Correct 59 ms 76616 KB Output is correct
78 Correct 68 ms 79956 KB Output is correct
79 Correct 87 ms 79928 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 67932 KB Output is correct
2 Correct 14 ms 68184 KB Output is correct
3 Correct 13 ms 68084 KB Output is correct
4 Correct 15 ms 67932 KB Output is correct
5 Correct 16 ms 68220 KB Output is correct
6 Correct 14 ms 67932 KB Output is correct
7 Correct 13 ms 68112 KB Output is correct
8 Correct 13 ms 67932 KB Output is correct
9 Correct 14 ms 68188 KB Output is correct
10 Correct 13 ms 67932 KB Output is correct
11 Correct 16 ms 67928 KB Output is correct
12 Correct 13 ms 68172 KB Output is correct
13 Correct 13 ms 68176 KB Output is correct
14 Correct 13 ms 67932 KB Output is correct
15 Correct 13 ms 67932 KB Output is correct
16 Correct 14 ms 67932 KB Output is correct
17 Correct 15 ms 67932 KB Output is correct
18 Correct 14 ms 68176 KB Output is correct
19 Correct 13 ms 67932 KB Output is correct
20 Correct 14 ms 67932 KB Output is correct
21 Correct 14 ms 67932 KB Output is correct
22 Correct 14 ms 67932 KB Output is correct
23 Correct 14 ms 68052 KB Output is correct
24 Correct 14 ms 67932 KB Output is correct
25 Correct 15 ms 68188 KB Output is correct
26 Correct 14 ms 68352 KB Output is correct
27 Correct 15 ms 68200 KB Output is correct
28 Correct 15 ms 68184 KB Output is correct
29 Correct 18 ms 68128 KB Output is correct
30 Correct 18 ms 68188 KB Output is correct
31 Correct 15 ms 68188 KB Output is correct
32 Correct 15 ms 68188 KB Output is correct
33 Correct 14 ms 68188 KB Output is correct
34 Correct 15 ms 68188 KB Output is correct
35 Correct 14 ms 68188 KB Output is correct
36 Correct 14 ms 68188 KB Output is correct
37 Correct 16 ms 68440 KB Output is correct
38 Correct 14 ms 68392 KB Output is correct
39 Correct 15 ms 68188 KB Output is correct
40 Correct 14 ms 68292 KB Output is correct
41 Correct 15 ms 68376 KB Output is correct
42 Correct 17 ms 68288 KB Output is correct
43 Correct 15 ms 68184 KB Output is correct
44 Correct 15 ms 68288 KB Output is correct
45 Correct 74 ms 79768 KB Output is correct
46 Correct 81 ms 79844 KB Output is correct
47 Correct 74 ms 79928 KB Output is correct
48 Correct 82 ms 79944 KB Output is correct
49 Correct 79 ms 79696 KB Output is correct
50 Correct 98 ms 80024 KB Output is correct
51 Correct 83 ms 80232 KB Output is correct
52 Correct 59 ms 76816 KB Output is correct
53 Correct 71 ms 82872 KB Output is correct
54 Correct 78 ms 84684 KB Output is correct
55 Correct 80 ms 82004 KB Output is correct
56 Correct 86 ms 82020 KB Output is correct
57 Correct 58 ms 76760 KB Output is correct
58 Correct 51 ms 76640 KB Output is correct
59 Correct 60 ms 78844 KB Output is correct
60 Correct 63 ms 78932 KB Output is correct
61 Correct 70 ms 78716 KB Output is correct
62 Correct 63 ms 79140 KB Output is correct
63 Correct 83 ms 78484 KB Output is correct
64 Correct 73 ms 79196 KB Output is correct
65 Correct 80 ms 80972 KB Output is correct
66 Correct 78 ms 81524 KB Output is correct
67 Correct 90 ms 80716 KB Output is correct
68 Correct 83 ms 81136 KB Output is correct
69 Correct 84 ms 81128 KB Output is correct
70 Correct 83 ms 81144 KB Output is correct
71 Correct 86 ms 83568 KB Output is correct
72 Correct 100 ms 83612 KB Output is correct
73 Correct 88 ms 84024 KB Output is correct
74 Correct 80 ms 84144 KB Output is correct
75 Correct 64 ms 76820 KB Output is correct
76 Correct 58 ms 76816 KB Output is correct
77 Correct 59 ms 76616 KB Output is correct
78 Correct 68 ms 79956 KB Output is correct
79 Correct 87 ms 79928 KB Output is correct
80 Correct 1095 ms 187528 KB Output is correct
81 Correct 1055 ms 187904 KB Output is correct
82 Correct 993 ms 187760 KB Output is correct
83 Correct 1008 ms 187768 KB Output is correct
84 Correct 984 ms 187768 KB Output is correct
85 Correct 1000 ms 189964 KB Output is correct
86 Correct 937 ms 188428 KB Output is correct
87 Correct 610 ms 157024 KB Output is correct
88 Correct 804 ms 219480 KB Output is correct
89 Correct 1153 ms 228028 KB Output is correct
90 Correct 1047 ms 201080 KB Output is correct
91 Correct 1074 ms 201604 KB Output is correct
92 Correct 581 ms 157024 KB Output is correct
93 Correct 609 ms 157128 KB Output is correct
94 Correct 719 ms 178572 KB Output is correct
95 Correct 848 ms 178072 KB Output is correct
96 Correct 898 ms 178740 KB Output is correct
97 Correct 789 ms 181440 KB Output is correct
98 Correct 846 ms 177852 KB Output is correct
99 Correct 881 ms 182480 KB Output is correct
100 Correct 1048 ms 196768 KB Output is correct
101 Correct 1014 ms 196468 KB Output is correct
102 Correct 1053 ms 196704 KB Output is correct
103 Correct 1162 ms 196656 KB Output is correct
104 Correct 1055 ms 194548 KB Output is correct
105 Correct 1118 ms 194620 KB Output is correct
106 Correct 1022 ms 227588 KB Output is correct
107 Correct 1048 ms 227528 KB Output is correct
108 Correct 1168 ms 227864 KB Output is correct
109 Correct 1182 ms 226952 KB Output is correct
110 Correct 755 ms 157268 KB Output is correct
111 Correct 743 ms 156120 KB Output is correct
112 Correct 703 ms 156176 KB Output is correct
113 Correct 939 ms 188016 KB Output is correct
114 Correct 980 ms 187952 KB Output is correct