oj.uz

Submission #963697

# Submission time Handle Problem Language Result Execution time Memory
963697 2024-04-15T13:46:46 Z Cookie Port Facility (JOI17_port_facility) C++14
100 / 100
 2912 ms 140992 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
//using u128 = __uint128_t;
//const int x[4] = {1, 0, -1, 0};
//const int y[4] = {0, -1, 0, 1};
const ll mod = 1e9 + 7, pr = 31;
const int mxn = 1e6 + 5, mxq = 1e5 + 5, sq = 500, mxv = 5e4 + 1;
//const int base = (1 <<18);
const ll inf = 1e9 + 5, neg = -69420, inf2 = 1e14;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// have fun!
//JOIIIIIIIIIIIIIII
int n;

pii p[mxn + 1];
int c[mxn + 1];
int st[8 * mxn + 1], st2[8 * mxn + 1];
void upd(int nd, int l, int r, int id, int v){
    if(l == r){
        st[nd] = v; return;
    }
    int mid = (l + r) >> 1;
    if(id <= mid)upd(nd << 1, l, mid, id, v);
    else upd(nd << 1 | 1, mid + 1, r, id, v);
    int cand1 = st[nd << 1], cand2 = st[nd << 1 | 1];
    st[nd] = ((p[cand1].se > p[cand2].se) ? cand1: cand2);
}
void upd2(int nd, int l, int r, int id, int v){
    if(l == r){
        st2[nd] = v; return;
    }
    int mid = (l + r) >> 1;
    if(id <= mid)upd2(nd << 1, l, mid, id, v);
    else upd2(nd << 1 | 1, mid + 1, r, id, v);
    int cand1 = st2[nd << 1], cand2 = st2[nd << 1 | 1];
    st2[nd] = ((p[cand1].fi < p[cand2].fi) ? cand1: cand2);
}
int get(int nd, int l, int r, int ql, int qr){
    if(ql > r || qr < l)return(0);
    if(ql <= l && qr >= r)return(st[nd]);
    int mid = (l + r) >> 1;
    int cand1 = get(nd << 1, l, mid, ql, qr), cand2 = get(nd << 1 | 1, mid + 1, r, ql, qr);
    return((p[cand1].se > p[cand2].se) ? cand1 : cand2);
}
int get2(int nd, int l, int r, int ql, int qr){
    if(ql > r || qr < l)return(0);
    if(ql <= l && qr >= r)return(st2[nd]);
    int mid = (l + r) >> 1;
    int cand1 = get2(nd << 1, l, mid, ql, qr), cand2 = get2(nd << 1 | 1, mid + 1, r, ql, qr);
    return((p[cand1].fi < p[cand2].fi) ? cand1 : cand2);
}
void dfs(int s){
    
    upd(1, 1, 2 * n, p[s].fi, 0); upd2(1, 1, 2 * n, p[s].se, 0);
    while(1){
        int v = get(1, 1, 2 * n, p[s].fi, p[s].se);
        if(p[v].se > p[s].se){
            c[v] = c[s] ^ 1;
            dfs(v);
        }else{
            break;
        }
    }
    while(1){
        int v = get2(1, 1, 2 * n, p[s].fi, p[s].se);
        if(p[v].fi < p[s].fi){
            c[v] = c[s] ^ 1; dfs(v);
        }else{
            break;
        }
    }
}
void solve(){
    cin >> n;
    p[0].fi = inf; p[0].se = 0;
    for(int i = 1; i <= n; i++)cin >> p[i].fi >> p[i].se;
    sort(p + 1, p + n + 1);
    for(int i = 1; i <= n; i++){
        upd(1, 1, 2 * n, p[i].fi, i); upd2(1, 1, 2 * n, p[i].se, i);
    }
    int cnt = 0;
    for(int i = 1; i <= n; i++)c[i] = -1;
    for(int i = 1; i <= n; i++){
        if(c[i] == -1){
            c[i] = 0; dfs(i); ++cnt;
        }
    }
    set<int>s1, s2;
    for(int i = 1; i <= n; i++){
        if(c[i] == 0){
            auto it = s1.lower_bound(p[i].fi);
            if(it == s1.end() || (*it) > p[i].se){
                s1.insert(p[i].se);
            }else{
                cout << 0; return;
            }
        }else{
            auto it = s2.lower_bound(p[i].fi);
            if(it == s2.end() || (*it) > p[i].se){
                s2.insert(p[i].se);
            }else{
                cout << 0; return;
            }
        }
    }
    int ans = 1;
    for(int i = 0; i < cnt; i++)ans = (ans * 2) % mod;
    cout << ans;
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("DATA.inp", "r", stdin);
    //freopen("DATA.out", "w", stdout);
    int tt; tt = 1;
    while(tt--){
        solve();
 
    }
    return(0);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6504 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6608 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6612 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 1 ms 6608 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6504 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6608 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6612 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 1 ms 6608 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 5 ms 6744 KB Output is correct
26 Correct 3 ms 6748 KB Output is correct
27 Correct 3 ms 6724 KB Output is correct
28 Correct 4 ms 6744 KB Output is correct
29 Correct 4 ms 6744 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 4 ms 6620 KB Output is correct
32 Correct 4 ms 6748 KB Output is correct
33 Correct 3 ms 6744 KB Output is correct
34 Correct 3 ms 6488 KB Output is correct
35 Correct 3 ms 6748 KB Output is correct
36 Correct 3 ms 6744 KB Output is correct
37 Correct 4 ms 6492 KB Output is correct
38 Correct 4 ms 6492 KB Output is correct
39 Correct 3 ms 6748 KB Output is correct
40 Correct 3 ms 6748 KB Output is correct
41 Correct 4 ms 6748 KB Output is correct
42 Correct 3 ms 6748 KB Output is correct
43 Correct 3 ms 6492 KB Output is correct
44 Correct 3 ms 6792 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6504 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6608 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6612 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 1 ms 6608 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 5 ms 6744 KB Output is correct
26 Correct 3 ms 6748 KB Output is correct
27 Correct 3 ms 6724 KB Output is correct
28 Correct 4 ms 6744 KB Output is correct
29 Correct 4 ms 6744 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 4 ms 6620 KB Output is correct
32 Correct 4 ms 6748 KB Output is correct
33 Correct 3 ms 6744 KB Output is correct
34 Correct 3 ms 6488 KB Output is correct
35 Correct 3 ms 6748 KB Output is correct
36 Correct 3 ms 6744 KB Output is correct
37 Correct 4 ms 6492 KB Output is correct
38 Correct 4 ms 6492 KB Output is correct
39 Correct 3 ms 6748 KB Output is correct
40 Correct 3 ms 6748 KB Output is correct
41 Correct 4 ms 6748 KB Output is correct
42 Correct 3 ms 6748 KB Output is correct
43 Correct 3 ms 6492 KB Output is correct
44 Correct 3 ms 6792 KB Output is correct
45 Correct 160 ms 17112 KB Output is correct
46 Correct 169 ms 17612 KB Output is correct
47 Correct 175 ms 16984 KB Output is correct
48 Correct 160 ms 17508 KB Output is correct
49 Correct 177 ms 16964 KB Output is correct
50 Correct 150 ms 13884 KB Output is correct
51 Correct 148 ms 14776 KB Output is correct
52 Correct 143 ms 16752 KB Output is correct
53 Correct 164 ms 14676 KB Output is correct
54 Correct 154 ms 13136 KB Output is correct
55 Correct 152 ms 13644 KB Output is correct
56 Correct 156 ms 13644 KB Output is correct
57 Correct 133 ms 16724 KB Output is correct
58 Correct 129 ms 16744 KB Output is correct
59 Correct 138 ms 16784 KB Output is correct
60 Correct 147 ms 16768 KB Output is correct
61 Correct 152 ms 16728 KB Output is correct
62 Correct 132 ms 12140 KB Output is correct
63 Correct 127 ms 12064 KB Output is correct
64 Correct 157 ms 12136 KB Output is correct
65 Correct 191 ms 15160 KB Output is correct
66 Correct 187 ms 15216 KB Output is correct
67 Correct 200 ms 18168 KB Output is correct
68 Correct 181 ms 18264 KB Output is correct
69 Correct 177 ms 17968 KB Output is correct
70 Correct 171 ms 18004 KB Output is correct
71 Correct 180 ms 17600 KB Output is correct
72 Correct 172 ms 17684 KB Output is correct
73 Correct 175 ms 16700 KB Output is correct
74 Correct 184 ms 16720 KB Output is correct
75 Correct 162 ms 19772 KB Output is correct
76 Correct 143 ms 19752 KB Output is correct
77 Correct 124 ms 15492 KB Output is correct
78 Correct 177 ms 17712 KB Output is correct
79 Correct 165 ms 17252 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6504 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6608 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6612 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 1 ms 6608 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 5 ms 6744 KB Output is correct
26 Correct 3 ms 6748 KB Output is correct
27 Correct 3 ms 6724 KB Output is correct
28 Correct 4 ms 6744 KB Output is correct
29 Correct 4 ms 6744 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 4 ms 6620 KB Output is correct
32 Correct 4 ms 6748 KB Output is correct
33 Correct 3 ms 6744 KB Output is correct
34 Correct 3 ms 6488 KB Output is correct
35 Correct 3 ms 6748 KB Output is correct
36 Correct 3 ms 6744 KB Output is correct
37 Correct 4 ms 6492 KB Output is correct
38 Correct 4 ms 6492 KB Output is correct
39 Correct 3 ms 6748 KB Output is correct
40 Correct 3 ms 6748 KB Output is correct
41 Correct 4 ms 6748 KB Output is correct
42 Correct 3 ms 6748 KB Output is correct
43 Correct 3 ms 6492 KB Output is correct
44 Correct 3 ms 6792 KB Output is correct
45 Correct 160 ms 17112 KB Output is correct
46 Correct 169 ms 17612 KB Output is correct
47 Correct 175 ms 16984 KB Output is correct
48 Correct 160 ms 17508 KB Output is correct
49 Correct 177 ms 16964 KB Output is correct
50 Correct 150 ms 13884 KB Output is correct
51 Correct 148 ms 14776 KB Output is correct
52 Correct 143 ms 16752 KB Output is correct
53 Correct 164 ms 14676 KB Output is correct
54 Correct 154 ms 13136 KB Output is correct
55 Correct 152 ms 13644 KB Output is correct
56 Correct 156 ms 13644 KB Output is correct
57 Correct 133 ms 16724 KB Output is correct
58 Correct 129 ms 16744 KB Output is correct
59 Correct 138 ms 16784 KB Output is correct
60 Correct 147 ms 16768 KB Output is correct
61 Correct 152 ms 16728 KB Output is correct
62 Correct 132 ms 12140 KB Output is correct
63 Correct 127 ms 12064 KB Output is correct
64 Correct 157 ms 12136 KB Output is correct
65 Correct 191 ms 15160 KB Output is correct
66 Correct 187 ms 15216 KB Output is correct
67 Correct 200 ms 18168 KB Output is correct
68 Correct 181 ms 18264 KB Output is correct
69 Correct 177 ms 17968 KB Output is correct
70 Correct 171 ms 18004 KB Output is correct
71 Correct 180 ms 17600 KB Output is correct
72 Correct 172 ms 17684 KB Output is correct
73 Correct 175 ms 16700 KB Output is correct
74 Correct 184 ms 16720 KB Output is correct
75 Correct 162 ms 19772 KB Output is correct
76 Correct 143 ms 19752 KB Output is correct
77 Correct 124 ms 15492 KB Output is correct
78 Correct 177 ms 17712 KB Output is correct
79 Correct 165 ms 17252 KB Output is correct
80 Correct 1908 ms 111484 KB Output is correct
81 Correct 1971 ms 111108 KB Output is correct
82 Correct 1908 ms 109992 KB Output is correct
83 Correct 1954 ms 111144 KB Output is correct
84 Correct 1973 ms 111496 KB Output is correct
85 Correct 1762 ms 81124 KB Output is correct
86 Correct 1759 ms 88228 KB Output is correct
87 Correct 1539 ms 109480 KB Output is correct
88 Correct 1717 ms 103312 KB Output is correct
89 Correct 1807 ms 87660 KB Output is correct
90 Correct 1822 ms 76248 KB Output is correct
91 Correct 1794 ms 76020 KB Output is correct
92 Correct 1658 ms 109552 KB Output is correct
93 Correct 1495 ms 109600 KB Output is correct
94 Correct 1629 ms 109648 KB Output is correct
95 Correct 1871 ms 109548 KB Output is correct
96 Correct 1890 ms 109556 KB Output is correct
97 Correct 1546 ms 75508 KB Output is correct
98 Correct 1665 ms 81648 KB Output is correct
99 Correct 1622 ms 68860 KB Output is correct
100 Correct 2912 ms 91944 KB Output is correct
101 Correct 2858 ms 91940 KB Output is correct
102 Correct 2181 ms 123112 KB Output is correct
103 Correct 2084 ms 123176 KB Output is correct
104 Correct 2119 ms 119340 KB Output is correct
105 Correct 2095 ms 119344 KB Output is correct
106 Correct 2037 ms 134524 KB Output is correct
107 Correct 2032 ms 134836 KB Output is correct
108 Correct 2082 ms 124308 KB Output is correct
109 Correct 2102 ms 124184 KB Output is correct
110 Correct 1735 ms 140728 KB Output is correct
111 Correct 1741 ms 140992 KB Output is correct
112 Correct 1400 ms 93824 KB Output is correct
113 Correct 1886 ms 109808 KB Output is correct
114 Correct 1905 ms 111172 KB Output is correct