oj.uz

Submission #894461

# Submission time Handle Problem Language Result Execution time Memory
894461 2023-12-28T10:13:24 Z Hando Port Facility (JOI17_port_facility) C++17
100 / 100
 1734 ms 180612 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> adj[N];

int cnt;
int col[N];
int nxt[N], par[N], le[N], id[N << 1], a[N];


inline int find(int u) {
    return par[u] == u? u : par[u] = find(par[u]);
}

inline void add_edge(int u, int v) {
    adj[u].emb(v);
    adj[v].emb(u);
}

bool ok;

void dfs(int u, int c) {
    col[u] = c;
    for (auto& v : adj[u]) {
        if (!col[v]) {
            dfs(v, 3 - c);
        }

        if (col[v] == col[u]) {
            ok &= false;
        }
    }
}

void solve() {
    int n; re(n);
    for (int i = 1; i <= n; ++i) {
        int l, r; re(l, r);
        id[l] = id[r] = i;
    }

    for (int i = 1; i <= n; ++i)
        nxt[i] = par[i] = i;
    par[n + 1] = n + 1;


    for (int i = 1; i <= 2 * n; ++i) {
        int p = id[i];
        if (!le[p]) a[++cnt] = p, le[p] = cnt;
        else {
            int u = le[p];
            par[u] = find(u + 1);
            for (int j = par[u], k; j <= cnt; j = k) {
                add_edge(a[j], p);
                k = find(nxt[j] + 1);
                nxt[j] = cnt;
            }
        }
    }

    int cc = 0;
    for (int i = 1; i <= n; ++i)
        if (!col[i]) {
            ok = true;
            dfs(i, 1);
            if (ok) ++cc;
            else return wr("0\n");
        }

    const int mod = 1e9 + 7;
    ll res = 1;
    for (int i = 0; i < cc; ++i)
        res = (res * 2) % mod;

    wr(res);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    //Open("");

    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 30556 KB Output is correct
2 Correct 6 ms 30556 KB Output is correct
3 Correct 6 ms 30556 KB Output is correct
4 Correct 7 ms 30556 KB Output is correct
5 Correct 6 ms 30556 KB Output is correct
6 Correct 7 ms 30556 KB Output is correct
7 Correct 7 ms 30556 KB Output is correct
8 Correct 7 ms 30712 KB Output is correct
9 Correct 7 ms 30624 KB Output is correct
10 Correct 6 ms 30556 KB Output is correct
11 Correct 6 ms 30556 KB Output is correct
12 Correct 6 ms 30556 KB Output is correct
13 Correct 6 ms 30556 KB Output is correct
14 Correct 6 ms 30640 KB Output is correct
15 Correct 6 ms 30552 KB Output is correct
16 Correct 7 ms 30552 KB Output is correct
17 Correct 6 ms 30556 KB Output is correct
18 Correct 6 ms 30660 KB Output is correct
19 Correct 7 ms 30556 KB Output is correct
20 Correct 7 ms 30556 KB Output is correct
21 Correct 6 ms 30552 KB Output is correct
22 Correct 7 ms 30556 KB Output is correct
23 Correct 6 ms 30556 KB Output is correct
24 Correct 6 ms 30556 KB Output is correct
25 Correct 8 ms 30808 KB Output is correct
26 Correct 7 ms 30556 KB Output is correct
27 Correct 8 ms 30552 KB Output is correct
28 Correct 7 ms 30556 KB Output is correct
29 Correct 7 ms 30556 KB Output is correct
30 Correct 7 ms 30556 KB Output is correct
31 Correct 7 ms 30556 KB Output is correct
32 Correct 7 ms 30640 KB Output is correct
33 Correct 7 ms 30556 KB Output is correct
34 Correct 7 ms 30556 KB Output is correct
35 Correct 7 ms 30552 KB Output is correct
36 Correct 8 ms 30556 KB Output is correct
37 Correct 8 ms 30812 KB Output is correct
38 Correct 7 ms 30812 KB Output is correct
39 Correct 7 ms 30556 KB Output is correct
40 Correct 7 ms 30556 KB Output is correct
41 Correct 7 ms 30592 KB Output is correct
42 Correct 7 ms 30556 KB Output is correct
43 Correct 7 ms 30808 KB Output is correct
44 Correct 7 ms 30808 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 30556 KB Output is correct
2 Correct 6 ms 30556 KB Output is correct
3 Correct 6 ms 30556 KB Output is correct
4 Correct 7 ms 30556 KB Output is correct
5 Correct 6 ms 30556 KB Output is correct
6 Correct 7 ms 30556 KB Output is correct
7 Correct 7 ms 30556 KB Output is correct
8 Correct 7 ms 30712 KB Output is correct
9 Correct 7 ms 30624 KB Output is correct
10 Correct 6 ms 30556 KB Output is correct
11 Correct 6 ms 30556 KB Output is correct
12 Correct 6 ms 30556 KB Output is correct
13 Correct 6 ms 30556 KB Output is correct
14 Correct 6 ms 30640 KB Output is correct
15 Correct 6 ms 30552 KB Output is correct
16 Correct 7 ms 30552 KB Output is correct
17 Correct 6 ms 30556 KB Output is correct
18 Correct 6 ms 30660 KB Output is correct
19 Correct 7 ms 30556 KB Output is correct
20 Correct 7 ms 30556 KB Output is correct
21 Correct 6 ms 30552 KB Output is correct
22 Correct 7 ms 30556 KB Output is correct
23 Correct 6 ms 30556 KB Output is correct
24 Correct 6 ms 30556 KB Output is correct
25 Correct 8 ms 30808 KB Output is correct
26 Correct 7 ms 30556 KB Output is correct
27 Correct 8 ms 30552 KB Output is correct
28 Correct 7 ms 30556 KB Output is correct
29 Correct 7 ms 30556 KB Output is correct
30 Correct 7 ms 30556 KB Output is correct
31 Correct 7 ms 30556 KB Output is correct
32 Correct 7 ms 30640 KB Output is correct
33 Correct 7 ms 30556 KB Output is correct
34 Correct 7 ms 30556 KB Output is correct
35 Correct 7 ms 30552 KB Output is correct
36 Correct 8 ms 30556 KB Output is correct
37 Correct 8 ms 30812 KB Output is correct
38 Correct 7 ms 30812 KB Output is correct
39 Correct 7 ms 30556 KB Output is correct
40 Correct 7 ms 30556 KB Output is correct
41 Correct 7 ms 30592 KB Output is correct
42 Correct 7 ms 30556 KB Output is correct
43 Correct 7 ms 30808 KB Output is correct
44 Correct 7 ms 30808 KB Output is correct
45 Correct 39 ms 39836 KB Output is correct
46 Correct 44 ms 40016 KB Output is correct
47 Correct 35 ms 39508 KB Output is correct
48 Correct 35 ms 40144 KB Output is correct
49 Correct 34 ms 39772 KB Output is correct
50 Correct 33 ms 40016 KB Output is correct
51 Correct 37 ms 39760 KB Output is correct
52 Correct 23 ms 36764 KB Output is correct
53 Correct 20 ms 36828 KB Output is correct
54 Correct 38 ms 44232 KB Output is correct
55 Correct 38 ms 42160 KB Output is correct
56 Correct 36 ms 43212 KB Output is correct
57 Correct 30 ms 40024 KB Output is correct
58 Correct 21 ms 36948 KB Output is correct
59 Correct 24 ms 37404 KB Output is correct
60 Correct 31 ms 38740 KB Output is correct
61 Correct 36 ms 39404 KB Output is correct
62 Correct 28 ms 38252 KB Output is correct
63 Correct 31 ms 38996 KB Output is correct
64 Correct 33 ms 39516 KB Output is correct
65 Correct 67 ms 47704 KB Output is correct
66 Correct 70 ms 48012 KB Output is correct
67 Correct 32 ms 40348 KB Output is correct
68 Correct 30 ms 40144 KB Output is correct
69 Correct 30 ms 40144 KB Output is correct
70 Correct 32 ms 40340 KB Output is correct
71 Correct 29 ms 40412 KB Output is correct
72 Correct 34 ms 40492 KB Output is correct
73 Correct 32 ms 40484 KB Output is correct
74 Correct 30 ms 40404 KB Output is correct
75 Correct 33 ms 43612 KB Output is correct
76 Correct 35 ms 46256 KB Output is correct
77 Correct 35 ms 46164 KB Output is correct
78 Correct 35 ms 40024 KB Output is correct
79 Correct 38 ms 39704 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 30556 KB Output is correct
2 Correct 6 ms 30556 KB Output is correct
3 Correct 6 ms 30556 KB Output is correct
4 Correct 7 ms 30556 KB Output is correct
5 Correct 6 ms 30556 KB Output is correct
6 Correct 7 ms 30556 KB Output is correct
7 Correct 7 ms 30556 KB Output is correct
8 Correct 7 ms 30712 KB Output is correct
9 Correct 7 ms 30624 KB Output is correct
10 Correct 6 ms 30556 KB Output is correct
11 Correct 6 ms 30556 KB Output is correct
12 Correct 6 ms 30556 KB Output is correct
13 Correct 6 ms 30556 KB Output is correct
14 Correct 6 ms 30640 KB Output is correct
15 Correct 6 ms 30552 KB Output is correct
16 Correct 7 ms 30552 KB Output is correct
17 Correct 6 ms 30556 KB Output is correct
18 Correct 6 ms 30660 KB Output is correct
19 Correct 7 ms 30556 KB Output is correct
20 Correct 7 ms 30556 KB Output is correct
21 Correct 6 ms 30552 KB Output is correct
22 Correct 7 ms 30556 KB Output is correct
23 Correct 6 ms 30556 KB Output is correct
24 Correct 6 ms 30556 KB Output is correct
25 Correct 8 ms 30808 KB Output is correct
26 Correct 7 ms 30556 KB Output is correct
27 Correct 8 ms 30552 KB Output is correct
28 Correct 7 ms 30556 KB Output is correct
29 Correct 7 ms 30556 KB Output is correct
30 Correct 7 ms 30556 KB Output is correct
31 Correct 7 ms 30556 KB Output is correct
32 Correct 7 ms 30640 KB Output is correct
33 Correct 7 ms 30556 KB Output is correct
34 Correct 7 ms 30556 KB Output is correct
35 Correct 7 ms 30552 KB Output is correct
36 Correct 8 ms 30556 KB Output is correct
37 Correct 8 ms 30812 KB Output is correct
38 Correct 7 ms 30812 KB Output is correct
39 Correct 7 ms 30556 KB Output is correct
40 Correct 7 ms 30556 KB Output is correct
41 Correct 7 ms 30592 KB Output is correct
42 Correct 7 ms 30556 KB Output is correct
43 Correct 7 ms 30808 KB Output is correct
44 Correct 7 ms 30808 KB Output is correct
45 Correct 39 ms 39836 KB Output is correct
46 Correct 44 ms 40016 KB Output is correct
47 Correct 35 ms 39508 KB Output is correct
48 Correct 35 ms 40144 KB Output is correct
49 Correct 34 ms 39772 KB Output is correct
50 Correct 33 ms 40016 KB Output is correct
51 Correct 37 ms 39760 KB Output is correct
52 Correct 23 ms 36764 KB Output is correct
53 Correct 20 ms 36828 KB Output is correct
54 Correct 38 ms 44232 KB Output is correct
55 Correct 38 ms 42160 KB Output is correct
56 Correct 36 ms 43212 KB Output is correct
57 Correct 30 ms 40024 KB Output is correct
58 Correct 21 ms 36948 KB Output is correct
59 Correct 24 ms 37404 KB Output is correct
60 Correct 31 ms 38740 KB Output is correct
61 Correct 36 ms 39404 KB Output is correct
62 Correct 28 ms 38252 KB Output is correct
63 Correct 31 ms 38996 KB Output is correct
64 Correct 33 ms 39516 KB Output is correct
65 Correct 67 ms 47704 KB Output is correct
66 Correct 70 ms 48012 KB Output is correct
67 Correct 32 ms 40348 KB Output is correct
68 Correct 30 ms 40144 KB Output is correct
69 Correct 30 ms 40144 KB Output is correct
70 Correct 32 ms 40340 KB Output is correct
71 Correct 29 ms 40412 KB Output is correct
72 Correct 34 ms 40492 KB Output is correct
73 Correct 32 ms 40484 KB Output is correct
74 Correct 30 ms 40404 KB Output is correct
75 Correct 33 ms 43612 KB Output is correct
76 Correct 35 ms 46256 KB Output is correct
77 Correct 35 ms 46164 KB Output is correct
78 Correct 35 ms 40024 KB Output is correct
79 Correct 38 ms 39704 KB Output is correct
80 Correct 454 ms 94036 KB Output is correct
81 Correct 442 ms 93844 KB Output is correct
82 Correct 460 ms 92756 KB Output is correct
83 Correct 466 ms 93724 KB Output is correct
84 Correct 467 ms 94276 KB Output is correct
85 Correct 386 ms 92960 KB Output is correct
86 Correct 430 ms 93164 KB Output is correct
87 Correct 151 ms 65876 KB Output is correct
88 Correct 159 ms 65820 KB Output is correct
89 Correct 764 ms 134656 KB Output is correct
90 Correct 596 ms 129032 KB Output is correct
91 Correct 600 ms 126704 KB Output is correct
92 Correct 481 ms 97044 KB Output is correct
93 Correct 157 ms 65720 KB Output is correct
94 Correct 356 ms 77392 KB Output is correct
95 Correct 481 ms 89620 KB Output is correct
96 Correct 460 ms 92180 KB Output is correct
97 Correct 325 ms 81604 KB Output is correct
98 Correct 412 ms 90264 KB Output is correct
99 Correct 450 ms 93604 KB Output is correct
100 Correct 1734 ms 180612 KB Output is correct
101 Correct 1638 ms 179568 KB Output is correct
102 Correct 419 ms 99600 KB Output is correct
103 Correct 397 ms 99520 KB Output is correct
104 Correct 419 ms 99776 KB Output is correct
105 Correct 443 ms 99908 KB Output is correct
106 Correct 376 ms 100872 KB Output is correct
107 Correct 375 ms 101256 KB Output is correct
108 Correct 488 ms 101560 KB Output is correct
109 Correct 471 ms 102160 KB Output is correct
110 Correct 549 ms 158532 KB Output is correct
111 Correct 536 ms 159804 KB Output is correct
112 Correct 563 ms 159940 KB Output is correct
113 Correct 458 ms 92760 KB Output is correct
114 Correct 489 ms 93524 KB Output is correct