oj.uz

Submission #897845

# Submission time Handle Problem Language Result Execution time Memory
897845 2024-01-03T19:44:48 Z andrey27_sm Port Facility (JOI17_port_facility) C++17
100 / 100
 3614 ms 728972 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("arch=icelake-server,avx512f,avx512bw,avx512bitalg,bmi,bmi2")

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
constexpr ll mod = 1e9 + 7;


vector<int> sgt1[5000000];
vector<int> sgt2[5000000];
void update1(int v,int l,int r, int pos,int val){
    if(pos > r or pos < l) return;
        sgt1[v].push_back(val);
    if(l == r) {
        return;
    }
    int mid = (l+r)/2;
    update1(v*2,l,mid,pos,val);
    update1(v*2+1,mid+1,r,pos,val);
}
void update2(int v,int l,int r, int pos,int val){
    if(pos > r or pos < l) return;
    sgt2[v].push_back(val);
    if(l == r) {
        return;
    }
    int mid = (l+r)/2;
    update2(v*2,l,mid,pos,val);
    update2(v*2+1,mid+1,r,pos,val);
}
vector<int> tmp;
void get(int v,int l,int r,int tl,int tr) {
    if(tl > r or tr < l) return;
    if(tl <= l and tr >= r) {
        while(!sgt1[v].empty() and sgt1[v].back() < tl) {
            tmp.push_back(sgt1[v].back());
            sgt1[v].pop_back();
        }
        while(!sgt2[v].empty() and sgt2[v].back() > tr) {
            tmp.push_back(sgt2[v].back());
            sgt2[v].pop_back();
        }
        return;
    }
    int m = (l+r)/2;
    get(v*2,l,m,tl,tr);
    get(v*2+1,m+1,r,tl,tr);
}
int O[3000001];
int C[3000001];
pair<int,int> A[3000001];
int B[3000001];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int l,r;
        cin >> l >> r;
        A[i] = {l,r};
        B[l] = i;
        B[r] = i;
        O[l] = r;
        O[r] = l;
    }
    for (int i = 2*n; i >= 1;i--) {
        if(O[i] > i)
            update1(1, 1, 2 * n, O[i], i);
    }

    for (int i = 1; i <= 2*n;i++) {
        if(O[i] < i)
            update2(1, 1, 2 * n, O[i], i);
    }
    int cnt = 0;
    for(int i = 0; i < n;i++) {
        if(C[i]) continue;
        cnt++;
        vector<int> c1;
        vector<int> c2;
        queue<pair<int,int>> Q;
        Q.emplace(i,1);
        while(!Q.empty()) {
            auto [v,c] = Q.front();
            Q.pop();
            if(C[v] == c) continue;
            if(C[v] and C[v] != c) {
                cout << 0 << "\n";
                return 0;
            }
            C[v] = c;
            if(c == 1) {
                c1.push_back(v);
            } else {
                c2.push_back(v);
            }
            tmp.clear();
            get(1,1,2*n,A[v].first,A[v].second);
            for(auto e:tmp) {
                Q.emplace(B[e],-c);
            }
        }
        vector<int> starts1;
        for(auto e:c1) starts1.push_back(A[e].first);
        vector<int> starts2;
        for(auto e:c2) starts2.push_back(A[e].first);
        sort(starts1.begin(),starts1.end());
        sort(starts2.begin(),starts2.end());
        stack<int> S;
        for(auto e:starts1) {
            while(!S.empty() and O[S.top()] < e) {
                S.pop();
            }
            if(!S.empty() and O[S.top()] < O[e]) {
                cout << 0 << "\n";
                return 0;
            }
        }
        for(auto e:starts2) {
            while(!S.empty() and O[S.top()] < e) {
                S.pop();
            }
            if(!S.empty() and O[S.top()] < O[e]) {
                cout << 0 << "\n";
                return 0;
            }
        }
    }
    ll ans = 1;
    for (int i = 0; i < cnt;i++) {
        ans *= 2;
        ans %= mod;
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 240488 KB Output is correct
2 Correct 51 ms 240212 KB Output is correct
3 Correct 51 ms 240212 KB Output is correct
4 Correct 51 ms 240476 KB Output is correct
5 Correct 51 ms 240460 KB Output is correct
6 Correct 51 ms 240456 KB Output is correct
7 Correct 51 ms 240208 KB Output is correct
8 Correct 50 ms 240460 KB Output is correct
9 Correct 50 ms 240464 KB Output is correct
10 Correct 52 ms 240212 KB Output is correct
11 Correct 52 ms 240212 KB Output is correct
12 Correct 52 ms 240476 KB Output is correct
13 Correct 52 ms 240468 KB Output is correct
14 Correct 51 ms 240476 KB Output is correct
15 Correct 56 ms 240464 KB Output is correct
16 Correct 52 ms 240472 KB Output is correct
17 Correct 52 ms 240476 KB Output is correct
18 Correct 52 ms 240460 KB Output is correct
19 Correct 52 ms 240212 KB Output is correct
20 Correct 53 ms 240208 KB Output is correct
21 Correct 51 ms 240212 KB Output is correct
22 Correct 50 ms 240212 KB Output is correct
23 Correct 50 ms 240208 KB Output is correct
24 Correct 51 ms 240212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 240488 KB Output is correct
2 Correct 51 ms 240212 KB Output is correct
3 Correct 51 ms 240212 KB Output is correct
4 Correct 51 ms 240476 KB Output is correct
5 Correct 51 ms 240460 KB Output is correct
6 Correct 51 ms 240456 KB Output is correct
7 Correct 51 ms 240208 KB Output is correct
8 Correct 50 ms 240460 KB Output is correct
9 Correct 50 ms 240464 KB Output is correct
10 Correct 52 ms 240212 KB Output is correct
11 Correct 52 ms 240212 KB Output is correct
12 Correct 52 ms 240476 KB Output is correct
13 Correct 52 ms 240468 KB Output is correct
14 Correct 51 ms 240476 KB Output is correct
15 Correct 56 ms 240464 KB Output is correct
16 Correct 52 ms 240472 KB Output is correct
17 Correct 52 ms 240476 KB Output is correct
18 Correct 52 ms 240460 KB Output is correct
19 Correct 52 ms 240212 KB Output is correct
20 Correct 53 ms 240208 KB Output is correct
21 Correct 51 ms 240212 KB Output is correct
22 Correct 50 ms 240212 KB Output is correct
23 Correct 50 ms 240208 KB Output is correct
24 Correct 51 ms 240212 KB Output is correct
25 Correct 53 ms 240848 KB Output is correct
26 Correct 53 ms 240980 KB Output is correct
27 Correct 53 ms 240980 KB Output is correct
28 Correct 53 ms 240980 KB Output is correct
29 Correct 54 ms 241232 KB Output is correct
30 Correct 55 ms 241028 KB Output is correct
31 Correct 54 ms 240976 KB Output is correct
32 Correct 53 ms 241024 KB Output is correct
33 Correct 52 ms 240760 KB Output is correct
34 Correct 52 ms 240980 KB Output is correct
35 Correct 54 ms 240892 KB Output is correct
36 Correct 53 ms 240896 KB Output is correct
37 Correct 53 ms 240892 KB Output is correct
38 Correct 58 ms 240856 KB Output is correct
39 Correct 53 ms 240976 KB Output is correct
40 Correct 54 ms 240968 KB Output is correct
41 Correct 56 ms 240720 KB Output is correct
42 Correct 58 ms 240784 KB Output is correct
43 Correct 53 ms 240976 KB Output is correct
44 Correct 52 ms 240980 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 240488 KB Output is correct
2 Correct 51 ms 240212 KB Output is correct
3 Correct 51 ms 240212 KB Output is correct
4 Correct 51 ms 240476 KB Output is correct
5 Correct 51 ms 240460 KB Output is correct
6 Correct 51 ms 240456 KB Output is correct
7 Correct 51 ms 240208 KB Output is correct
8 Correct 50 ms 240460 KB Output is correct
9 Correct 50 ms 240464 KB Output is correct
10 Correct 52 ms 240212 KB Output is correct
11 Correct 52 ms 240212 KB Output is correct
12 Correct 52 ms 240476 KB Output is correct
13 Correct 52 ms 240468 KB Output is correct
14 Correct 51 ms 240476 KB Output is correct
15 Correct 56 ms 240464 KB Output is correct
16 Correct 52 ms 240472 KB Output is correct
17 Correct 52 ms 240476 KB Output is correct
18 Correct 52 ms 240460 KB Output is correct
19 Correct 52 ms 240212 KB Output is correct
20 Correct 53 ms 240208 KB Output is correct
21 Correct 51 ms 240212 KB Output is correct
22 Correct 50 ms 240212 KB Output is correct
23 Correct 50 ms 240208 KB Output is correct
24 Correct 51 ms 240212 KB Output is correct
25 Correct 53 ms 240848 KB Output is correct
26 Correct 53 ms 240980 KB Output is correct
27 Correct 53 ms 240980 KB Output is correct
28 Correct 53 ms 240980 KB Output is correct
29 Correct 54 ms 241232 KB Output is correct
30 Correct 55 ms 241028 KB Output is correct
31 Correct 54 ms 240976 KB Output is correct
32 Correct 53 ms 241024 KB Output is correct
33 Correct 52 ms 240760 KB Output is correct
34 Correct 52 ms 240980 KB Output is correct
35 Correct 54 ms 240892 KB Output is correct
36 Correct 53 ms 240896 KB Output is correct
37 Correct 53 ms 240892 KB Output is correct
38 Correct 58 ms 240856 KB Output is correct
39 Correct 53 ms 240976 KB Output is correct
40 Correct 54 ms 240968 KB Output is correct
41 Correct 56 ms 240720 KB Output is correct
42 Correct 58 ms 240784 KB Output is correct
43 Correct 53 ms 240976 KB Output is correct
44 Correct 52 ms 240980 KB Output is correct
45 Correct 223 ms 279304 KB Output is correct
46 Correct 203 ms 279616 KB Output is correct
47 Correct 219 ms 279252 KB Output is correct
48 Correct 219 ms 279616 KB Output is correct
49 Correct 206 ms 279104 KB Output is correct
50 Correct 172 ms 279104 KB Output is correct
51 Correct 169 ms 279656 KB Output is correct
52 Correct 203 ms 280640 KB Output is correct
53 Correct 220 ms 275296 KB Output is correct
54 Correct 181 ms 289732 KB Output is correct
55 Correct 156 ms 282184 KB Output is correct
56 Correct 160 ms 281928 KB Output is correct
57 Correct 204 ms 279868 KB Output is correct
58 Correct 222 ms 279436 KB Output is correct
59 Correct 278 ms 282100 KB Output is correct
60 Correct 318 ms 281044 KB Output is correct
61 Correct 220 ms 280132 KB Output is correct
62 Correct 177 ms 282844 KB Output is correct
63 Correct 178 ms 281148 KB Output is correct
64 Correct 176 ms 280324 KB Output is correct
65 Correct 224 ms 288336 KB Output is correct
66 Correct 284 ms 289996 KB Output is correct
67 Correct 195 ms 283480 KB Output is correct
68 Correct 195 ms 282432 KB Output is correct
69 Correct 192 ms 284076 KB Output is correct
70 Correct 191 ms 284972 KB Output is correct
71 Correct 166 ms 277224 KB Output is correct
72 Correct 168 ms 277220 KB Output is correct
73 Correct 169 ms 277432 KB Output is correct
74 Correct 175 ms 277812 KB Output is correct
75 Correct 185 ms 281796 KB Output is correct
76 Correct 183 ms 281736 KB Output is correct
77 Correct 181 ms 281408 KB Output is correct
78 Correct 223 ms 279736 KB Output is correct
79 Correct 207 ms 279392 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 240488 KB Output is correct
2 Correct 51 ms 240212 KB Output is correct
3 Correct 51 ms 240212 KB Output is correct
4 Correct 51 ms 240476 KB Output is correct
5 Correct 51 ms 240460 KB Output is correct
6 Correct 51 ms 240456 KB Output is correct
7 Correct 51 ms 240208 KB Output is correct
8 Correct 50 ms 240460 KB Output is correct
9 Correct 50 ms 240464 KB Output is correct
10 Correct 52 ms 240212 KB Output is correct
11 Correct 52 ms 240212 KB Output is correct
12 Correct 52 ms 240476 KB Output is correct
13 Correct 52 ms 240468 KB Output is correct
14 Correct 51 ms 240476 KB Output is correct
15 Correct 56 ms 240464 KB Output is correct
16 Correct 52 ms 240472 KB Output is correct
17 Correct 52 ms 240476 KB Output is correct
18 Correct 52 ms 240460 KB Output is correct
19 Correct 52 ms 240212 KB Output is correct
20 Correct 53 ms 240208 KB Output is correct
21 Correct 51 ms 240212 KB Output is correct
22 Correct 50 ms 240212 KB Output is correct
23 Correct 50 ms 240208 KB Output is correct
24 Correct 51 ms 240212 KB Output is correct
25 Correct 53 ms 240848 KB Output is correct
26 Correct 53 ms 240980 KB Output is correct
27 Correct 53 ms 240980 KB Output is correct
28 Correct 53 ms 240980 KB Output is correct
29 Correct 54 ms 241232 KB Output is correct
30 Correct 55 ms 241028 KB Output is correct
31 Correct 54 ms 240976 KB Output is correct
32 Correct 53 ms 241024 KB Output is correct
33 Correct 52 ms 240760 KB Output is correct
34 Correct 52 ms 240980 KB Output is correct
35 Correct 54 ms 240892 KB Output is correct
36 Correct 53 ms 240896 KB Output is correct
37 Correct 53 ms 240892 KB Output is correct
38 Correct 58 ms 240856 KB Output is correct
39 Correct 53 ms 240976 KB Output is correct
40 Correct 54 ms 240968 KB Output is correct
41 Correct 56 ms 240720 KB Output is correct
42 Correct 58 ms 240784 KB Output is correct
43 Correct 53 ms 240976 KB Output is correct
44 Correct 52 ms 240980 KB Output is correct
45 Correct 223 ms 279304 KB Output is correct
46 Correct 203 ms 279616 KB Output is correct
47 Correct 219 ms 279252 KB Output is correct
48 Correct 219 ms 279616 KB Output is correct
49 Correct 206 ms 279104 KB Output is correct
50 Correct 172 ms 279104 KB Output is correct
51 Correct 169 ms 279656 KB Output is correct
52 Correct 203 ms 280640 KB Output is correct
53 Correct 220 ms 275296 KB Output is correct
54 Correct 181 ms 289732 KB Output is correct
55 Correct 156 ms 282184 KB Output is correct
56 Correct 160 ms 281928 KB Output is correct
57 Correct 204 ms 279868 KB Output is correct
58 Correct 222 ms 279436 KB Output is correct
59 Correct 278 ms 282100 KB Output is correct
60 Correct 318 ms 281044 KB Output is correct
61 Correct 220 ms 280132 KB Output is correct
62 Correct 177 ms 282844 KB Output is correct
63 Correct 178 ms 281148 KB Output is correct
64 Correct 176 ms 280324 KB Output is correct
65 Correct 224 ms 288336 KB Output is correct
66 Correct 284 ms 289996 KB Output is correct
67 Correct 195 ms 283480 KB Output is correct
68 Correct 195 ms 282432 KB Output is correct
69 Correct 192 ms 284076 KB Output is correct
70 Correct 191 ms 284972 KB Output is correct
71 Correct 166 ms 277224 KB Output is correct
72 Correct 168 ms 277220 KB Output is correct
73 Correct 169 ms 277432 KB Output is correct
74 Correct 175 ms 277812 KB Output is correct
75 Correct 185 ms 281796 KB Output is correct
76 Correct 183 ms 281736 KB Output is correct
77 Correct 181 ms 281408 KB Output is correct
78 Correct 223 ms 279736 KB Output is correct
79 Correct 207 ms 279392 KB Output is correct
80 Correct 2190 ms 609392 KB Output is correct
81 Correct 2188 ms 610024 KB Output is correct
82 Correct 2136 ms 609020 KB Output is correct
83 Correct 2155 ms 611052 KB Output is correct
84 Correct 2151 ms 609816 KB Output is correct
85 Correct 1549 ms 609224 KB Output is correct
86 Correct 1648 ms 612644 KB Output is correct
87 Correct 1956 ms 609708 KB Output is correct
88 Correct 2287 ms 554692 KB Output is correct
89 Correct 1740 ms 727180 KB Output is correct
90 Correct 1432 ms 633188 KB Output is correct
91 Correct 1446 ms 637196 KB Output is correct
92 Correct 1943 ms 594836 KB Output is correct
93 Correct 1963 ms 594884 KB Output is correct
94 Correct 2484 ms 631548 KB Output is correct
95 Correct 2318 ms 623068 KB Output is correct
96 Correct 2117 ms 617816 KB Output is correct
97 Correct 1623 ms 634192 KB Output is correct
98 Correct 1691 ms 626584 KB Output is correct
99 Correct 1672 ms 625148 KB Output is correct
100 Correct 3614 ms 728972 KB Output is correct
101 Correct 3564 ms 717080 KB Output is correct
102 Correct 1904 ms 657200 KB Output is correct
103 Correct 1981 ms 641552 KB Output is correct
104 Correct 1868 ms 663820 KB Output is correct
105 Correct 1880 ms 655764 KB Output is correct
106 Correct 1524 ms 573188 KB Output is correct
107 Correct 1527 ms 573316 KB Output is correct
108 Correct 1512 ms 582288 KB Output is correct
109 Correct 1527 ms 582108 KB Output is correct
110 Correct 1688 ms 619592 KB Output is correct
111 Correct 1666 ms 619920 KB Output is correct
112 Correct 1626 ms 614892 KB Output is correct
113 Correct 2150 ms 608828 KB Output is correct
114 Correct 2137 ms 609528 KB Output is correct