oj.uz

Submission #894735

# Submission time Handle Problem Language Result Execution time Memory
894735 2023-12-28T20:25:58 Z Hando Port Facility (JOI17_port_facility) C++17
78 / 100
 175 ms 71700 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 = 2e5 + 5;

vt <int> t[N << 2];
int idx[N << 2], 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;
    vt <bool> vis(n + 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 5 ms 26204 KB Output is correct
2 Correct 7 ms 26308 KB Output is correct
3 Correct 6 ms 26204 KB Output is correct
4 Correct 7 ms 26204 KB Output is correct
5 Correct 7 ms 26204 KB Output is correct
6 Correct 5 ms 26200 KB Output is correct
7 Correct 7 ms 26204 KB Output is correct
8 Correct 5 ms 26204 KB Output is correct
9 Correct 5 ms 26204 KB Output is correct
10 Correct 5 ms 26204 KB Output is correct
11 Correct 6 ms 26204 KB Output is correct
12 Correct 6 ms 26204 KB Output is correct
13 Correct 5 ms 26328 KB Output is correct
14 Correct 5 ms 26204 KB Output is correct
15 Correct 6 ms 26456 KB Output is correct
16 Correct 6 ms 26304 KB Output is correct
17 Correct 5 ms 26200 KB Output is correct
18 Correct 7 ms 26204 KB Output is correct
19 Correct 5 ms 26204 KB Output is correct
20 Correct 5 ms 26200 KB Output is correct
21 Correct 5 ms 26404 KB Output is correct
22 Correct 5 ms 26204 KB Output is correct
23 Correct 5 ms 26420 KB Output is correct
24 Correct 5 ms 26308 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26204 KB Output is correct
2 Correct 7 ms 26308 KB Output is correct
3 Correct 6 ms 26204 KB Output is correct
4 Correct 7 ms 26204 KB Output is correct
5 Correct 7 ms 26204 KB Output is correct
6 Correct 5 ms 26200 KB Output is correct
7 Correct 7 ms 26204 KB Output is correct
8 Correct 5 ms 26204 KB Output is correct
9 Correct 5 ms 26204 KB Output is correct
10 Correct 5 ms 26204 KB Output is correct
11 Correct 6 ms 26204 KB Output is correct
12 Correct 6 ms 26204 KB Output is correct
13 Correct 5 ms 26328 KB Output is correct
14 Correct 5 ms 26204 KB Output is correct
15 Correct 6 ms 26456 KB Output is correct
16 Correct 6 ms 26304 KB Output is correct
17 Correct 5 ms 26200 KB Output is correct
18 Correct 7 ms 26204 KB Output is correct
19 Correct 5 ms 26204 KB Output is correct
20 Correct 5 ms 26200 KB Output is correct
21 Correct 5 ms 26404 KB Output is correct
22 Correct 5 ms 26204 KB Output is correct
23 Correct 5 ms 26420 KB Output is correct
24 Correct 5 ms 26308 KB Output is correct
25 Correct 7 ms 26456 KB Output is correct
26 Correct 6 ms 26456 KB Output is correct
27 Correct 7 ms 26460 KB Output is correct
28 Correct 7 ms 26580 KB Output is correct
29 Correct 7 ms 26460 KB Output is correct
30 Correct 6 ms 26440 KB Output is correct
31 Correct 8 ms 26560 KB Output is correct
32 Correct 7 ms 26460 KB Output is correct
33 Correct 7 ms 26460 KB Output is correct
34 Correct 7 ms 26460 KB Output is correct
35 Correct 6 ms 26460 KB Output is correct
36 Correct 7 ms 26460 KB Output is correct
37 Correct 7 ms 26460 KB Output is correct
38 Correct 7 ms 26416 KB Output is correct
39 Correct 6 ms 26460 KB Output is correct
40 Correct 6 ms 26660 KB Output is correct
41 Correct 7 ms 26420 KB Output is correct
42 Correct 6 ms 26560 KB Output is correct
43 Correct 6 ms 26460 KB Output is correct
44 Correct 6 ms 26460 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26204 KB Output is correct
2 Correct 7 ms 26308 KB Output is correct
3 Correct 6 ms 26204 KB Output is correct
4 Correct 7 ms 26204 KB Output is correct
5 Correct 7 ms 26204 KB Output is correct
6 Correct 5 ms 26200 KB Output is correct
7 Correct 7 ms 26204 KB Output is correct
8 Correct 5 ms 26204 KB Output is correct
9 Correct 5 ms 26204 KB Output is correct
10 Correct 5 ms 26204 KB Output is correct
11 Correct 6 ms 26204 KB Output is correct
12 Correct 6 ms 26204 KB Output is correct
13 Correct 5 ms 26328 KB Output is correct
14 Correct 5 ms 26204 KB Output is correct
15 Correct 6 ms 26456 KB Output is correct
16 Correct 6 ms 26304 KB Output is correct
17 Correct 5 ms 26200 KB Output is correct
18 Correct 7 ms 26204 KB Output is correct
19 Correct 5 ms 26204 KB Output is correct
20 Correct 5 ms 26200 KB Output is correct
21 Correct 5 ms 26404 KB Output is correct
22 Correct 5 ms 26204 KB Output is correct
23 Correct 5 ms 26420 KB Output is correct
24 Correct 5 ms 26308 KB Output is correct
25 Correct 7 ms 26456 KB Output is correct
26 Correct 6 ms 26456 KB Output is correct
27 Correct 7 ms 26460 KB Output is correct
28 Correct 7 ms 26580 KB Output is correct
29 Correct 7 ms 26460 KB Output is correct
30 Correct 6 ms 26440 KB Output is correct
31 Correct 8 ms 26560 KB Output is correct
32 Correct 7 ms 26460 KB Output is correct
33 Correct 7 ms 26460 KB Output is correct
34 Correct 7 ms 26460 KB Output is correct
35 Correct 6 ms 26460 KB Output is correct
36 Correct 7 ms 26460 KB Output is correct
37 Correct 7 ms 26460 KB Output is correct
38 Correct 7 ms 26416 KB Output is correct
39 Correct 6 ms 26460 KB Output is correct
40 Correct 6 ms 26660 KB Output is correct
41 Correct 7 ms 26420 KB Output is correct
42 Correct 6 ms 26560 KB Output is correct
43 Correct 6 ms 26460 KB Output is correct
44 Correct 6 ms 26460 KB Output is correct
45 Correct 119 ms 45512 KB Output is correct
46 Correct 105 ms 45444 KB Output is correct
47 Correct 116 ms 45260 KB Output is correct
48 Correct 105 ms 45392 KB Output is correct
49 Correct 117 ms 45328 KB Output is correct
50 Correct 106 ms 45256 KB Output is correct
51 Correct 106 ms 45260 KB Output is correct
52 Correct 64 ms 46028 KB Output is correct
53 Correct 92 ms 43568 KB Output is correct
54 Correct 117 ms 43464 KB Output is correct
55 Correct 113 ms 43216 KB Output is correct
56 Correct 110 ms 43284 KB Output is correct
57 Correct 75 ms 45568 KB Output is correct
58 Correct 71 ms 45516 KB Output is correct
59 Correct 88 ms 46496 KB Output is correct
60 Correct 97 ms 45868 KB Output is correct
61 Correct 117 ms 45792 KB Output is correct
62 Correct 90 ms 46604 KB Output is correct
63 Correct 92 ms 46000 KB Output is correct
64 Correct 99 ms 45820 KB Output is correct
65 Correct 143 ms 44560 KB Output is correct
66 Correct 175 ms 44620 KB Output is correct
67 Correct 109 ms 44428 KB Output is correct
68 Correct 108 ms 44364 KB Output is correct
69 Correct 109 ms 44688 KB Output is correct
70 Correct 116 ms 44812 KB Output is correct
71 Correct 93 ms 43468 KB Output is correct
72 Correct 100 ms 43392 KB Output is correct
73 Correct 92 ms 43464 KB Output is correct
74 Correct 107 ms 43580 KB Output is correct
75 Correct 87 ms 46112 KB Output is correct
76 Correct 78 ms 46284 KB Output is correct
77 Correct 76 ms 46028 KB Output is correct
78 Correct 106 ms 45328 KB Output is correct
79 Correct 106 ms 45256 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26204 KB Output is correct
2 Correct 7 ms 26308 KB Output is correct
3 Correct 6 ms 26204 KB Output is correct
4 Correct 7 ms 26204 KB Output is correct
5 Correct 7 ms 26204 KB Output is correct
6 Correct 5 ms 26200 KB Output is correct
7 Correct 7 ms 26204 KB Output is correct
8 Correct 5 ms 26204 KB Output is correct
9 Correct 5 ms 26204 KB Output is correct
10 Correct 5 ms 26204 KB Output is correct
11 Correct 6 ms 26204 KB Output is correct
12 Correct 6 ms 26204 KB Output is correct
13 Correct 5 ms 26328 KB Output is correct
14 Correct 5 ms 26204 KB Output is correct
15 Correct 6 ms 26456 KB Output is correct
16 Correct 6 ms 26304 KB Output is correct
17 Correct 5 ms 26200 KB Output is correct
18 Correct 7 ms 26204 KB Output is correct
19 Correct 5 ms 26204 KB Output is correct
20 Correct 5 ms 26200 KB Output is correct
21 Correct 5 ms 26404 KB Output is correct
22 Correct 5 ms 26204 KB Output is correct
23 Correct 5 ms 26420 KB Output is correct
24 Correct 5 ms 26308 KB Output is correct
25 Correct 7 ms 26456 KB Output is correct
26 Correct 6 ms 26456 KB Output is correct
27 Correct 7 ms 26460 KB Output is correct
28 Correct 7 ms 26580 KB Output is correct
29 Correct 7 ms 26460 KB Output is correct
30 Correct 6 ms 26440 KB Output is correct
31 Correct 8 ms 26560 KB Output is correct
32 Correct 7 ms 26460 KB Output is correct
33 Correct 7 ms 26460 KB Output is correct
34 Correct 7 ms 26460 KB Output is correct
35 Correct 6 ms 26460 KB Output is correct
36 Correct 7 ms 26460 KB Output is correct
37 Correct 7 ms 26460 KB Output is correct
38 Correct 7 ms 26416 KB Output is correct
39 Correct 6 ms 26460 KB Output is correct
40 Correct 6 ms 26660 KB Output is correct
41 Correct 7 ms 26420 KB Output is correct
42 Correct 6 ms 26560 KB Output is correct
43 Correct 6 ms 26460 KB Output is correct
44 Correct 6 ms 26460 KB Output is correct
45 Correct 119 ms 45512 KB Output is correct
46 Correct 105 ms 45444 KB Output is correct
47 Correct 116 ms 45260 KB Output is correct
48 Correct 105 ms 45392 KB Output is correct
49 Correct 117 ms 45328 KB Output is correct
50 Correct 106 ms 45256 KB Output is correct
51 Correct 106 ms 45260 KB Output is correct
52 Correct 64 ms 46028 KB Output is correct
53 Correct 92 ms 43568 KB Output is correct
54 Correct 117 ms 43464 KB Output is correct
55 Correct 113 ms 43216 KB Output is correct
56 Correct 110 ms 43284 KB Output is correct
57 Correct 75 ms 45568 KB Output is correct
58 Correct 71 ms 45516 KB Output is correct
59 Correct 88 ms 46496 KB Output is correct
60 Correct 97 ms 45868 KB Output is correct
61 Correct 117 ms 45792 KB Output is correct
62 Correct 90 ms 46604 KB Output is correct
63 Correct 92 ms 46000 KB Output is correct
64 Correct 99 ms 45820 KB Output is correct
65 Correct 143 ms 44560 KB Output is correct
66 Correct 175 ms 44620 KB Output is correct
67 Correct 109 ms 44428 KB Output is correct
68 Correct 108 ms 44364 KB Output is correct
69 Correct 109 ms 44688 KB Output is correct
70 Correct 116 ms 44812 KB Output is correct
71 Correct 93 ms 43468 KB Output is correct
72 Correct 100 ms 43392 KB Output is correct
73 Correct 92 ms 43464 KB Output is correct
74 Correct 107 ms 43580 KB Output is correct
75 Correct 87 ms 46112 KB Output is correct
76 Correct 78 ms 46284 KB Output is correct
77 Correct 76 ms 46028 KB Output is correct
78 Correct 106 ms 45328 KB Output is correct
79 Correct 106 ms 45256 KB Output is correct
80 Runtime error 164 ms 71700 KB Execution killed with signal 11
81 Halted 0 ms 0 KB -