oj.uz

Submission #894738

# Submission time Handle Problem Language Result Execution time Memory
894738 2023-12-28T20:28:20 Z Hando Port Facility (JOI17_port_facility) C++17
100 / 100
 3079 ms 617672 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back
#define mt make_tuple
 
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()
#define uniq(x) unique(all(x)), x.end()
 
using ll = long long;
using ld = long double;
using ull = unsigned long long;
 
template<class Fun> class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }
 
template <class T, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);
 
template <class T> 
void re(T& x) {
    cin >> x;
}
 
template <class T, class... M> 
void re(T& x, M&... args) {
    re(x), re(args...);
}
 
template <class T> 
void re(vt <T>& x) {
    for(auto& it : x) re(it);
}
 
template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x) re(it);
}
 
template <class T, size_t N>
void wr(const array <T, N>& x);
template <class T> 
void wr(const vt <T>& x);
 
template <class T> 
void wr(const T& x) {
    cout << x;
}
 
template <class T, class ...M>  
void wr(const T& x, const M&... args) {
    wr(x), wr(args...);
}
 
template <class T> 
void wr(const vt <T>& x) {
    for(auto it : x) wr(it, ' ');
}
 
template <class T, size_t N>
void wr(const array <T, N>& x) {
    for(auto it : x) wr(it, ' ');
}
 
template<class T, class... M>
auto mvt(size_t n, M&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector<T>(n, args...);
    else
        return vector(n, mvt<T>(args...));
}
 
void set_fixed(int p = 0) {
    cout << fixed << setprecision(p);
}
 
void set_scientific() {
    cout << scientific;
}
 
void Open(const string& name) {
// #ifndef ONLINE_JUDGE
    (void)!freopen((name + ".in").c_str(), "r", stdin);
    (void)!freopen((name + ".out").c_str(), "w", stdout);
// #endif
}
 
const int N = 1e6 + 5;

vt <int> t[N << 4];
int idx[N << 4], par[N], d[N], a[N], b[N], mn[N], m[N << 1], vis[N];
 

inline int find(int u) {
    if (par[u] == u)
        return u;

    int p = find(par[u]);
    d[u] ^= d[par[u]];
    return par[u] = p;
}

inline bool unite(int u, int v, int w)  {
    int ru = find(u), rv = find(v);
    if (ru == rv) {
        return (d[u] ^ d[v]) == w;
    } else {
        d[ru] = w ^ d[u] ^ d[v];
        par[ru] = rv;
        return true;
    }

    assert(false);
    return false;
}

void build(int v, int tl, int tr) {
    idx[v] = 1;
    if (tl == tr) {
        if (m[tl]) {
            t[v].pub(m[tl]);
        }
        return;
    }

    int tm = (tl + tr) / 2;
    build(v * 2, tl, tm);
    build(v * 2 + 1, tm + 1, tr);
    merge(all(t[v * 2]), all(t[v * 2 + 1]), back_inserter(t[v]),
        [&](const int& i, const int& j) {
            return a[i] < a[j];
    });
}

bool query(int i, int v, int tl, int tr, int l, int r) {
    if (l <= tl && tr <= r) {
        if (len(t[v]) == 0 || a[t[v][0]] > a[i])
            return true;

        bool ret = 1;   
        ret &= unite(i, t[v][0], 1);
        while (idx[v] < len(t[v]) && a[t[v][idx[v]]] < a[i]) {
            ret &= unite(t[v][idx[v]], t[v][0], 0);
            idx[v]++;
        }
        return ret;
    } else {
        int tm = (tl + tr) / 2;
        if (r <= tm) return query(i, v * 2, tl, tm, l, r);
        else if (l > tm) return query(i, v * 2 + 1, tm + 1, tr, l, r);
        else return query(i, v * 2, tl, tm, l, r) & query(i, v * 2 + 1, tm + 1, tr, l, r);
    }

    assert(false);
    return false;
}
 
void solve() {
    int n; re(n);
    for (int i = 1; i <= n; ++i) {
        re(a[i], b[i]);
        par[i] = m[b[i]] = i;
    }
    
    build(1, 1, 2 * n);
    bool can = 1;
    for (int i = 1; i <= n; ++i)
        can &= query(i, 1, 1, 2 * n, a[i], b[i] - 1);

    if (!can) {
        return wr("0\n");
    }
    
    const int mod = 1e9 + 7;
    ll res = 1;
    for (int i = 1; i <= n; ++i) {
        if(vis[find(i)]) {
            continue;
        }
        vis[find(i)] = 1;
        res = (res * 2) % mod;
    }
    wr(res);
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
 
    //Open("a");
 
    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 377404 KB Output is correct
2 Correct 87 ms 377640 KB Output is correct
3 Correct 88 ms 377644 KB Output is correct
4 Correct 87 ms 377836 KB Output is correct
5 Correct 88 ms 377636 KB Output is correct
6 Correct 86 ms 377424 KB Output is correct
7 Correct 86 ms 377544 KB Output is correct
8 Correct 88 ms 377424 KB Output is correct
9 Correct 87 ms 377648 KB Output is correct
10 Correct 88 ms 377616 KB Output is correct
11 Correct 90 ms 383772 KB Output is correct
12 Correct 85 ms 387864 KB Output is correct
13 Correct 84 ms 387668 KB Output is correct
14 Correct 82 ms 387668 KB Output is correct
15 Correct 83 ms 387676 KB Output is correct
16 Correct 83 ms 387824 KB Output is correct
17 Correct 84 ms 387664 KB Output is correct
18 Correct 84 ms 387856 KB Output is correct
19 Correct 104 ms 387652 KB Output is correct
20 Correct 86 ms 387768 KB Output is correct
21 Correct 82 ms 387844 KB Output is correct
22 Correct 83 ms 387664 KB Output is correct
23 Correct 83 ms 387856 KB Output is correct
24 Correct 84 ms 387636 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 377404 KB Output is correct
2 Correct 87 ms 377640 KB Output is correct
3 Correct 88 ms 377644 KB Output is correct
4 Correct 87 ms 377836 KB Output is correct
5 Correct 88 ms 377636 KB Output is correct
6 Correct 86 ms 377424 KB Output is correct
7 Correct 86 ms 377544 KB Output is correct
8 Correct 88 ms 377424 KB Output is correct
9 Correct 87 ms 377648 KB Output is correct
10 Correct 88 ms 377616 KB Output is correct
11 Correct 90 ms 383772 KB Output is correct
12 Correct 85 ms 387864 KB Output is correct
13 Correct 84 ms 387668 KB Output is correct
14 Correct 82 ms 387668 KB Output is correct
15 Correct 83 ms 387676 KB Output is correct
16 Correct 83 ms 387824 KB Output is correct
17 Correct 84 ms 387664 KB Output is correct
18 Correct 84 ms 387856 KB Output is correct
19 Correct 104 ms 387652 KB Output is correct
20 Correct 86 ms 387768 KB Output is correct
21 Correct 82 ms 387844 KB Output is correct
22 Correct 83 ms 387664 KB Output is correct
23 Correct 83 ms 387856 KB Output is correct
24 Correct 84 ms 387636 KB Output is correct
25 Correct 84 ms 387924 KB Output is correct
26 Correct 87 ms 388140 KB Output is correct
27 Correct 84 ms 387920 KB Output is correct
28 Correct 85 ms 388156 KB Output is correct
29 Correct 85 ms 388148 KB Output is correct
30 Correct 83 ms 387924 KB Output is correct
31 Correct 83 ms 388056 KB Output is correct
32 Correct 85 ms 388080 KB Output is correct
33 Correct 86 ms 388088 KB Output is correct
34 Correct 83 ms 388124 KB Output is correct
35 Correct 83 ms 387920 KB Output is correct
36 Correct 84 ms 388080 KB Output is correct
37 Correct 88 ms 388152 KB Output is correct
38 Correct 87 ms 387944 KB Output is correct
39 Correct 83 ms 388132 KB Output is correct
40 Correct 83 ms 387880 KB Output is correct
41 Correct 85 ms 387912 KB Output is correct
42 Correct 83 ms 388084 KB Output is correct
43 Correct 83 ms 387924 KB Output is correct
44 Correct 85 ms 387940 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 377404 KB Output is correct
2 Correct 87 ms 377640 KB Output is correct
3 Correct 88 ms 377644 KB Output is correct
4 Correct 87 ms 377836 KB Output is correct
5 Correct 88 ms 377636 KB Output is correct
6 Correct 86 ms 377424 KB Output is correct
7 Correct 86 ms 377544 KB Output is correct
8 Correct 88 ms 377424 KB Output is correct
9 Correct 87 ms 377648 KB Output is correct
10 Correct 88 ms 377616 KB Output is correct
11 Correct 90 ms 383772 KB Output is correct
12 Correct 85 ms 387864 KB Output is correct
13 Correct 84 ms 387668 KB Output is correct
14 Correct 82 ms 387668 KB Output is correct
15 Correct 83 ms 387676 KB Output is correct
16 Correct 83 ms 387824 KB Output is correct
17 Correct 84 ms 387664 KB Output is correct
18 Correct 84 ms 387856 KB Output is correct
19 Correct 104 ms 387652 KB Output is correct
20 Correct 86 ms 387768 KB Output is correct
21 Correct 82 ms 387844 KB Output is correct
22 Correct 83 ms 387664 KB Output is correct
23 Correct 83 ms 387856 KB Output is correct
24 Correct 84 ms 387636 KB Output is correct
25 Correct 84 ms 387924 KB Output is correct
26 Correct 87 ms 388140 KB Output is correct
27 Correct 84 ms 387920 KB Output is correct
28 Correct 85 ms 388156 KB Output is correct
29 Correct 85 ms 388148 KB Output is correct
30 Correct 83 ms 387924 KB Output is correct
31 Correct 83 ms 388056 KB Output is correct
32 Correct 85 ms 388080 KB Output is correct
33 Correct 86 ms 388088 KB Output is correct
34 Correct 83 ms 388124 KB Output is correct
35 Correct 83 ms 387920 KB Output is correct
36 Correct 84 ms 388080 KB Output is correct
37 Correct 88 ms 388152 KB Output is correct
38 Correct 87 ms 387944 KB Output is correct
39 Correct 83 ms 388132 KB Output is correct
40 Correct 83 ms 387880 KB Output is correct
41 Correct 85 ms 387912 KB Output is correct
42 Correct 83 ms 388084 KB Output is correct
43 Correct 83 ms 387924 KB Output is correct
44 Correct 85 ms 387940 KB Output is correct
45 Correct 191 ms 409324 KB Output is correct
46 Correct 186 ms 409204 KB Output is correct
47 Correct 185 ms 409220 KB Output is correct
48 Correct 196 ms 409496 KB Output is correct
49 Correct 186 ms 409292 KB Output is correct
50 Correct 217 ms 408776 KB Output is correct
51 Correct 193 ms 409256 KB Output is correct
52 Correct 145 ms 409292 KB Output is correct
53 Correct 167 ms 404680 KB Output is correct
54 Correct 205 ms 405196 KB Output is correct
55 Correct 193 ms 406728 KB Output is correct
56 Correct 189 ms 406600 KB Output is correct
57 Correct 151 ms 409272 KB Output is correct
58 Correct 147 ms 409172 KB Output is correct
59 Correct 175 ms 410276 KB Output is correct
60 Correct 181 ms 409804 KB Output is correct
61 Correct 174 ms 409464 KB Output is correct
62 Correct 165 ms 409804 KB Output is correct
63 Correct 170 ms 409232 KB Output is correct
64 Correct 186 ms 409232 KB Output is correct
65 Correct 220 ms 407756 KB Output is correct
66 Correct 232 ms 407676 KB Output is correct
67 Correct 188 ms 407672 KB Output is correct
68 Correct 192 ms 407628 KB Output is correct
69 Correct 192 ms 408136 KB Output is correct
70 Correct 191 ms 407952 KB Output is correct
71 Correct 167 ms 404936 KB Output is correct
72 Correct 173 ms 405192 KB Output is correct
73 Correct 171 ms 404940 KB Output is correct
74 Correct 170 ms 404944 KB Output is correct
75 Correct 178 ms 409288 KB Output is correct
76 Correct 157 ms 409292 KB Output is correct
77 Correct 161 ms 409288 KB Output is correct
78 Correct 184 ms 409292 KB Output is correct
79 Correct 187 ms 409268 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 377404 KB Output is correct
2 Correct 87 ms 377640 KB Output is correct
3 Correct 88 ms 377644 KB Output is correct
4 Correct 87 ms 377836 KB Output is correct
5 Correct 88 ms 377636 KB Output is correct
6 Correct 86 ms 377424 KB Output is correct
7 Correct 86 ms 377544 KB Output is correct
8 Correct 88 ms 377424 KB Output is correct
9 Correct 87 ms 377648 KB Output is correct
10 Correct 88 ms 377616 KB Output is correct
11 Correct 90 ms 383772 KB Output is correct
12 Correct 85 ms 387864 KB Output is correct
13 Correct 84 ms 387668 KB Output is correct
14 Correct 82 ms 387668 KB Output is correct
15 Correct 83 ms 387676 KB Output is correct
16 Correct 83 ms 387824 KB Output is correct
17 Correct 84 ms 387664 KB Output is correct
18 Correct 84 ms 387856 KB Output is correct
19 Correct 104 ms 387652 KB Output is correct
20 Correct 86 ms 387768 KB Output is correct
21 Correct 82 ms 387844 KB Output is correct
22 Correct 83 ms 387664 KB Output is correct
23 Correct 83 ms 387856 KB Output is correct
24 Correct 84 ms 387636 KB Output is correct
25 Correct 84 ms 387924 KB Output is correct
26 Correct 87 ms 388140 KB Output is correct
27 Correct 84 ms 387920 KB Output is correct
28 Correct 85 ms 388156 KB Output is correct
29 Correct 85 ms 388148 KB Output is correct
30 Correct 83 ms 387924 KB Output is correct
31 Correct 83 ms 388056 KB Output is correct
32 Correct 85 ms 388080 KB Output is correct
33 Correct 86 ms 388088 KB Output is correct
34 Correct 83 ms 388124 KB Output is correct
35 Correct 83 ms 387920 KB Output is correct
36 Correct 84 ms 388080 KB Output is correct
37 Correct 88 ms 388152 KB Output is correct
38 Correct 87 ms 387944 KB Output is correct
39 Correct 83 ms 388132 KB Output is correct
40 Correct 83 ms 387880 KB Output is correct
41 Correct 85 ms 387912 KB Output is correct
42 Correct 83 ms 388084 KB Output is correct
43 Correct 83 ms 387924 KB Output is correct
44 Correct 85 ms 387940 KB Output is correct
45 Correct 191 ms 409324 KB Output is correct
46 Correct 186 ms 409204 KB Output is correct
47 Correct 185 ms 409220 KB Output is correct
48 Correct 196 ms 409496 KB Output is correct
49 Correct 186 ms 409292 KB Output is correct
50 Correct 217 ms 408776 KB Output is correct
51 Correct 193 ms 409256 KB Output is correct
52 Correct 145 ms 409292 KB Output is correct
53 Correct 167 ms 404680 KB Output is correct
54 Correct 205 ms 405196 KB Output is correct
55 Correct 193 ms 406728 KB Output is correct
56 Correct 189 ms 406600 KB Output is correct
57 Correct 151 ms 409272 KB Output is correct
58 Correct 147 ms 409172 KB Output is correct
59 Correct 175 ms 410276 KB Output is correct
60 Correct 181 ms 409804 KB Output is correct
61 Correct 174 ms 409464 KB Output is correct
62 Correct 165 ms 409804 KB Output is correct
63 Correct 170 ms 409232 KB Output is correct
64 Correct 186 ms 409232 KB Output is correct
65 Correct 220 ms 407756 KB Output is correct
66 Correct 232 ms 407676 KB Output is correct
67 Correct 188 ms 407672 KB Output is correct
68 Correct 192 ms 407628 KB Output is correct
69 Correct 192 ms 408136 KB Output is correct
70 Correct 191 ms 407952 KB Output is correct
71 Correct 167 ms 404936 KB Output is correct
72 Correct 173 ms 405192 KB Output is correct
73 Correct 171 ms 404940 KB Output is correct
74 Correct 170 ms 404944 KB Output is correct
75 Correct 178 ms 409288 KB Output is correct
76 Correct 157 ms 409292 KB Output is correct
77 Correct 161 ms 409288 KB Output is correct
78 Correct 184 ms 409292 KB Output is correct
79 Correct 187 ms 409268 KB Output is correct
80 Correct 1958 ms 597568 KB Output is correct
81 Correct 1856 ms 604780 KB Output is correct
82 Correct 1766 ms 604800 KB Output is correct
83 Correct 1886 ms 604832 KB Output is correct
84 Correct 1830 ms 605376 KB Output is correct
85 Correct 1835 ms 602948 KB Output is correct
86 Correct 1851 ms 603008 KB Output is correct
87 Correct 860 ms 602320 KB Output is correct
88 Correct 1517 ms 574768 KB Output is correct
89 Correct 1998 ms 572604 KB Output is correct
90 Correct 2072 ms 572608 KB Output is correct
91 Correct 2056 ms 572532 KB Output is correct
92 Correct 1048 ms 597048 KB Output is correct
93 Correct 931 ms 594704 KB Output is correct
94 Correct 1451 ms 617672 KB Output is correct
95 Correct 1598 ms 613064 KB Output is correct
96 Correct 1707 ms 608752 KB Output is correct
97 Correct 1396 ms 614216 KB Output is correct
98 Correct 1661 ms 610560 KB Output is correct
99 Correct 1799 ms 607024 KB Output is correct
100 Correct 2884 ms 588304 KB Output is correct
101 Correct 3079 ms 588204 KB Output is correct
102 Correct 2105 ms 588264 KB Output is correct
103 Correct 2048 ms 588068 KB Output is correct
104 Correct 2212 ms 591344 KB Output is correct
105 Correct 2237 ms 591328 KB Output is correct
106 Correct 1498 ms 572536 KB Output is correct
107 Correct 1502 ms 572724 KB Output is correct
108 Correct 1478 ms 572728 KB Output is correct
109 Correct 1487 ms 572864 KB Output is correct
110 Correct 1219 ms 602064 KB Output is correct
111 Correct 1206 ms 602188 KB Output is correct
112 Correct 1180 ms 602152 KB Output is correct
113 Correct 1910 ms 604928 KB Output is correct
114 Correct 1816 ms 605108 KB Output is correct