oj.uz

Submission #894466

# Submission time Handle Problem Language Result Execution time Memory
894466 2023-12-28T10:18:46 Z Hando Port Facility (JOI17_port_facility) C++17
100 / 100
 1365 ms 145132 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 dfs(int u, int c) {
    col[u] = c;
    for (auto& v : adj[u]) {
        if (!col[v]) {
            if (!dfs(v, 3 - c))
                return false;
        }

        if (col[v] == col[u]) {
            return false;
        }
    }
    return true;
}

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]) {
            if (dfs(i, 1)) ++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 30552 KB Output is correct
2 Correct 7 ms 30628 KB Output is correct
3 Correct 7 ms 30632 KB Output is correct
4 Correct 7 ms 30552 KB Output is correct
5 Correct 7 ms 30556 KB Output is correct
6 Correct 10 ms 30552 KB Output is correct
7 Correct 7 ms 30556 KB Output is correct
8 Correct 7 ms 30556 KB Output is correct
9 Correct 7 ms 30556 KB Output is correct
10 Correct 8 ms 30644 KB Output is correct
11 Correct 7 ms 30620 KB Output is correct
12 Correct 8 ms 30632 KB Output is correct
13 Correct 8 ms 30556 KB Output is correct
14 Correct 7 ms 30552 KB Output is correct
15 Correct 7 ms 30556 KB Output is correct
16 Correct 7 ms 30556 KB Output is correct
17 Correct 7 ms 30556 KB Output is correct
18 Correct 7 ms 30576 KB Output is correct
19 Correct 8 ms 30556 KB Output is correct
20 Correct 7 ms 30652 KB Output is correct
21 Correct 7 ms 30628 KB Output is correct
22 Correct 8 ms 30556 KB Output is correct
23 Correct 7 ms 30552 KB Output is correct
24 Correct 7 ms 30556 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 30552 KB Output is correct
2 Correct 7 ms 30628 KB Output is correct
3 Correct 7 ms 30632 KB Output is correct
4 Correct 7 ms 30552 KB Output is correct
5 Correct 7 ms 30556 KB Output is correct
6 Correct 10 ms 30552 KB Output is correct
7 Correct 7 ms 30556 KB Output is correct
8 Correct 7 ms 30556 KB Output is correct
9 Correct 7 ms 30556 KB Output is correct
10 Correct 8 ms 30644 KB Output is correct
11 Correct 7 ms 30620 KB Output is correct
12 Correct 8 ms 30632 KB Output is correct
13 Correct 8 ms 30556 KB Output is correct
14 Correct 7 ms 30552 KB Output is correct
15 Correct 7 ms 30556 KB Output is correct
16 Correct 7 ms 30556 KB Output is correct
17 Correct 7 ms 30556 KB Output is correct
18 Correct 7 ms 30576 KB Output is correct
19 Correct 8 ms 30556 KB Output is correct
20 Correct 7 ms 30652 KB Output is correct
21 Correct 7 ms 30628 KB Output is correct
22 Correct 8 ms 30556 KB Output is correct
23 Correct 7 ms 30552 KB Output is correct
24 Correct 7 ms 30556 KB Output is correct
25 Correct 7 ms 30556 KB Output is correct
26 Correct 8 ms 30556 KB Output is correct
27 Correct 7 ms 30644 KB Output is correct
28 Correct 7 ms 30552 KB Output is correct
29 Correct 8 ms 30556 KB Output is correct
30 Correct 8 ms 30732 KB Output is correct
31 Correct 8 ms 30552 KB Output is correct
32 Correct 7 ms 30556 KB Output is correct
33 Correct 7 ms 30556 KB Output is correct
34 Correct 9 ms 30552 KB Output is correct
35 Correct 8 ms 30552 KB Output is correct
36 Correct 7 ms 30644 KB Output is correct
37 Correct 7 ms 30552 KB Output is correct
38 Correct 7 ms 30556 KB Output is correct
39 Correct 8 ms 30656 KB Output is correct
40 Correct 7 ms 30556 KB Output is correct
41 Correct 7 ms 30556 KB Output is correct
42 Correct 9 ms 30556 KB Output is correct
43 Correct 7 ms 30812 KB Output is correct
44 Correct 8 ms 30812 KB Output is correct
45 Correct 36 ms 39252 KB Output is correct
46 Correct 47 ms 39504 KB Output is correct
47 Correct 50 ms 39172 KB Output is correct
48 Correct 51 ms 39836 KB Output is correct
49 Correct 37 ms 39168 KB Output is correct
50 Correct 34 ms 39252 KB Output is correct
51 Correct 34 ms 38992 KB Output is correct
52 Correct 21 ms 36436 KB Output is correct
53 Correct 30 ms 36232 KB Output is correct
54 Correct 35 ms 39368 KB Output is correct
55 Correct 34 ms 39384 KB Output is correct
56 Correct 35 ms 39580 KB Output is correct
57 Correct 32 ms 39504 KB Output is correct
58 Correct 21 ms 36272 KB Output is correct
59 Correct 33 ms 37200 KB Output is correct
60 Correct 32 ms 38312 KB Output is correct
61 Correct 48 ms 38828 KB Output is correct
62 Correct 36 ms 37536 KB Output is correct
63 Correct 39 ms 38224 KB Output is correct
64 Correct 44 ms 38740 KB Output is correct
65 Correct 70 ms 42964 KB Output is correct
66 Correct 71 ms 42860 KB Output is correct
67 Correct 32 ms 39640 KB Output is correct
68 Correct 43 ms 39700 KB Output is correct
69 Correct 39 ms 39752 KB Output is correct
70 Correct 32 ms 39884 KB Output is correct
71 Correct 32 ms 39948 KB Output is correct
72 Correct 30 ms 39888 KB Output is correct
73 Correct 36 ms 40068 KB Output is correct
74 Correct 31 ms 39884 KB Output is correct
75 Correct 40 ms 43092 KB Output is correct
76 Correct 38 ms 45752 KB Output is correct
77 Correct 39 ms 45908 KB Output is correct
78 Correct 35 ms 39504 KB Output is correct
79 Correct 48 ms 39252 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 30552 KB Output is correct
2 Correct 7 ms 30628 KB Output is correct
3 Correct 7 ms 30632 KB Output is correct
4 Correct 7 ms 30552 KB Output is correct
5 Correct 7 ms 30556 KB Output is correct
6 Correct 10 ms 30552 KB Output is correct
7 Correct 7 ms 30556 KB Output is correct
8 Correct 7 ms 30556 KB Output is correct
9 Correct 7 ms 30556 KB Output is correct
10 Correct 8 ms 30644 KB Output is correct
11 Correct 7 ms 30620 KB Output is correct
12 Correct 8 ms 30632 KB Output is correct
13 Correct 8 ms 30556 KB Output is correct
14 Correct 7 ms 30552 KB Output is correct
15 Correct 7 ms 30556 KB Output is correct
16 Correct 7 ms 30556 KB Output is correct
17 Correct 7 ms 30556 KB Output is correct
18 Correct 7 ms 30576 KB Output is correct
19 Correct 8 ms 30556 KB Output is correct
20 Correct 7 ms 30652 KB Output is correct
21 Correct 7 ms 30628 KB Output is correct
22 Correct 8 ms 30556 KB Output is correct
23 Correct 7 ms 30552 KB Output is correct
24 Correct 7 ms 30556 KB Output is correct
25 Correct 7 ms 30556 KB Output is correct
26 Correct 8 ms 30556 KB Output is correct
27 Correct 7 ms 30644 KB Output is correct
28 Correct 7 ms 30552 KB Output is correct
29 Correct 8 ms 30556 KB Output is correct
30 Correct 8 ms 30732 KB Output is correct
31 Correct 8 ms 30552 KB Output is correct
32 Correct 7 ms 30556 KB Output is correct
33 Correct 7 ms 30556 KB Output is correct
34 Correct 9 ms 30552 KB Output is correct
35 Correct 8 ms 30552 KB Output is correct
36 Correct 7 ms 30644 KB Output is correct
37 Correct 7 ms 30552 KB Output is correct
38 Correct 7 ms 30556 KB Output is correct
39 Correct 8 ms 30656 KB Output is correct
40 Correct 7 ms 30556 KB Output is correct
41 Correct 7 ms 30556 KB Output is correct
42 Correct 9 ms 30556 KB Output is correct
43 Correct 7 ms 30812 KB Output is correct
44 Correct 8 ms 30812 KB Output is correct
45 Correct 36 ms 39252 KB Output is correct
46 Correct 47 ms 39504 KB Output is correct
47 Correct 50 ms 39172 KB Output is correct
48 Correct 51 ms 39836 KB Output is correct
49 Correct 37 ms 39168 KB Output is correct
50 Correct 34 ms 39252 KB Output is correct
51 Correct 34 ms 38992 KB Output is correct
52 Correct 21 ms 36436 KB Output is correct
53 Correct 30 ms 36232 KB Output is correct
54 Correct 35 ms 39368 KB Output is correct
55 Correct 34 ms 39384 KB Output is correct
56 Correct 35 ms 39580 KB Output is correct
57 Correct 32 ms 39504 KB Output is correct
58 Correct 21 ms 36272 KB Output is correct
59 Correct 33 ms 37200 KB Output is correct
60 Correct 32 ms 38312 KB Output is correct
61 Correct 48 ms 38828 KB Output is correct
62 Correct 36 ms 37536 KB Output is correct
63 Correct 39 ms 38224 KB Output is correct
64 Correct 44 ms 38740 KB Output is correct
65 Correct 70 ms 42964 KB Output is correct
66 Correct 71 ms 42860 KB Output is correct
67 Correct 32 ms 39640 KB Output is correct
68 Correct 43 ms 39700 KB Output is correct
69 Correct 39 ms 39752 KB Output is correct
70 Correct 32 ms 39884 KB Output is correct
71 Correct 32 ms 39948 KB Output is correct
72 Correct 30 ms 39888 KB Output is correct
73 Correct 36 ms 40068 KB Output is correct
74 Correct 31 ms 39884 KB Output is correct
75 Correct 40 ms 43092 KB Output is correct
76 Correct 38 ms 45752 KB Output is correct
77 Correct 39 ms 45908 KB Output is correct
78 Correct 35 ms 39504 KB Output is correct
79 Correct 48 ms 39252 KB Output is correct
80 Correct 573 ms 87076 KB Output is correct
81 Correct 539 ms 86612 KB Output is correct
82 Correct 588 ms 85416 KB Output is correct
83 Correct 595 ms 86548 KB Output is correct
84 Correct 581 ms 87380 KB Output is correct
85 Correct 493 ms 85528 KB Output is correct
86 Correct 507 ms 83652 KB Output is correct
87 Correct 204 ms 58708 KB Output is correct
88 Correct 225 ms 58532 KB Output is correct
89 Correct 605 ms 91928 KB Output is correct
90 Correct 600 ms 91908 KB Output is correct
91 Correct 650 ms 92108 KB Output is correct
92 Correct 546 ms 90088 KB Output is correct
93 Correct 261 ms 58736 KB Output is correct
94 Correct 357 ms 70372 KB Output is correct
95 Correct 528 ms 81976 KB Output is correct
96 Correct 537 ms 84720 KB Output is correct
97 Correct 359 ms 72604 KB Output is correct
98 Correct 431 ms 81352 KB Output is correct
99 Correct 477 ms 84868 KB Output is correct
100 Correct 1365 ms 129888 KB Output is correct
101 Correct 1247 ms 129288 KB Output is correct
102 Correct 446 ms 92548 KB Output is correct
103 Correct 421 ms 92684 KB Output is correct
104 Correct 410 ms 92772 KB Output is correct
105 Correct 479 ms 92752 KB Output is correct
106 Correct 411 ms 93888 KB Output is correct
107 Correct 437 ms 93804 KB Output is correct
108 Correct 499 ms 86792 KB Output is correct
109 Correct 395 ms 86972 KB Output is correct
110 Correct 576 ms 143956 KB Output is correct
111 Correct 554 ms 145132 KB Output is correct
112 Correct 517 ms 145076 KB Output is correct
113 Correct 462 ms 78124 KB Output is correct
114 Correct 509 ms 79188 KB Output is correct