oj.uz

Submission #931304

# Submission time Handle Problem Language Result Execution time Memory
931304 2024-02-21T15:00:21 Z parlimoos Port Facility (JOI17_port_facility) C++14
100 / 100
 2015 ms 202320 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'

const int MOD = int(1e9) + 7;

int n;
int h[2000000];
int segmn[2][8000001] , segmx[2][8000001] , seginf[8000001][2];
int ls[2000000] , rs[2000000] , is[2000000];
set<int> ord;
queue<int> q;

int Mul(int a , int b){
    return (1ll * a * b) % MOD;
}
int Pow(int a , int b){
    int res = 1;
    while(b){
        if((b & 1)) res = Mul(res , a);
        a = Mul(a , a) , b >>= 1;
    }
    return res;
}
void buildSeg(int l = 0 , int r = n + n - 1 , int i = 1){
    seginf[i][0] = l , seginf[i][1] = r;
    if(l == r){
        is[l] = i;
        segmn[0][i] = ls[r] , segmn[1][i] = ls[r];
        segmx[0][i] = rs[l] , segmx[1][i] = rs[l];
    }else{
        int c = (l + r - 1) >> 1;
        buildSeg(l , c , i << 1) , buildSeg(c + 1 , r , (i << 1) | 1);
        segmx[0][i] = max(segmx[0][i << 1] , segmx[0][(i << 1) | 1]);
        segmn[0][i] = min(segmn[0][i << 1] , segmn[0][(i << 1) | 1]);
        segmn[1][i] = segmn[0][i] , segmx[1][i] = segmx[0][i];
    }
}
void updSeg(int md , int l , int r){
    ord.erase(l);
    int i = is[l];
    segmx[md][i] = -1;
    while(i > 1) i >>= 1 , segmx[md][i] = max(segmx[md][i << 1] , segmx[md][(i << 1) | 1]);
    i = is[r];
    segmn[md][i] = int(1e9);
    while(i > 1) i >>= 1 , segmn[md][i] = min(segmn[md][i << 1] , segmn[md][(i << 1) | 1]);
}
int getMn(int l , int r , int md , int i){
    if(seginf[i][0] >= l and seginf[i][1] <= r) return segmn[md][i];
    if(seginf[i][1] >= l and seginf[i][0] <= r) return min(getMn(l , r , md , i << 1) , getMn(l , r , md , (i << 1) | 1));
    return int(1e9);
}
int getMx(int l , int r , int md , int i){
    if(seginf[i][0] >= l and seginf[i][1] <= r) return segmx[md][i];
    if(seginf[i][1] >= l and seginf[i][0] <= r) return max(getMx(l , r , md , i << 1) , getMx(l , r , md , (i << 1) | 1));
    return -1;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    fill(&ls[0] , &ls[n + n] , int(1e9)) , fill(&rs[0] , &rs[n + n] , -1) , fill(&h[0] , &h[n + n] , -1);
    for(int i = 0 ; i < n ; i++){
        int l , r;
        cin >> l >> r;
        l-- , r--;
        rs[l] = r , ls[r] = l;
        ord.insert(l);
    }
    buildSeg();
    int o = 0;
    while(!ord.empty()){
        q.push(*ord.bg());
        h[q.front()] = 0 , o++;
        updSeg(1 , q.front() , rs[q.front()]);

        while(!q.empty()){
            int l = q.front();
            int r = rs[l];
            q.pop();

            while(true){
                int d = getMx(l , r , h[l] , 1);
                if(d == -1 or d <= r) break;
                if(h[ls[d]] == h[l]){
                    cout << "0\n";
                    return 0;
                }
                h[ls[d]] = (h[l] ^ 1);
                updSeg(h[l] , ls[d] , d);
                q.push(ls[d]);
            }
            while(true){
                int d = getMn(l , r , h[l] , 1);
                if(d >= l) break;
                if(h[d] == h[l]){
                    cout << "0\n";
                    return 0;
                }
                h[d] = (h[l] ^ 1);
                updSeg(h[l] , d , rs[d]);
                q.push(d);
            }
        }
    }
    cout << Pow(2 , o) << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16984 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct
6 Correct 2 ms 16860 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16984 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 2 ms 16852 KB Output is correct
11 Correct 2 ms 16984 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 2 ms 16732 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 2 ms 16732 KB Output is correct
18 Correct 2 ms 16732 KB Output is correct
19 Correct 2 ms 16848 KB Output is correct
20 Correct 3 ms 16732 KB Output is correct
21 Correct 2 ms 16732 KB Output is correct
22 Correct 3 ms 16732 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 2 ms 16984 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16984 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct
6 Correct 2 ms 16860 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16984 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 2 ms 16852 KB Output is correct
11 Correct 2 ms 16984 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 2 ms 16732 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 2 ms 16732 KB Output is correct
18 Correct 2 ms 16732 KB Output is correct
19 Correct 2 ms 16848 KB Output is correct
20 Correct 3 ms 16732 KB Output is correct
21 Correct 2 ms 16732 KB Output is correct
22 Correct 3 ms 16732 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 2 ms 16984 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 5 ms 16988 KB Output is correct
27 Correct 4 ms 16936 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 16988 KB Output is correct
30 Correct 4 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16860 KB Output is correct
33 Correct 4 ms 16984 KB Output is correct
34 Correct 3 ms 16988 KB Output is correct
35 Correct 3 ms 16864 KB Output is correct
36 Correct 4 ms 16984 KB Output is correct
37 Correct 3 ms 16964 KB Output is correct
38 Correct 3 ms 16988 KB Output is correct
39 Correct 4 ms 16988 KB Output is correct
40 Correct 4 ms 16988 KB Output is correct
41 Correct 4 ms 16988 KB Output is correct
42 Correct 4 ms 16988 KB Output is correct
43 Correct 4 ms 16988 KB Output is correct
44 Correct 4 ms 16868 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16984 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct
6 Correct 2 ms 16860 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16984 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 2 ms 16852 KB Output is correct
11 Correct 2 ms 16984 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 2 ms 16732 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 2 ms 16732 KB Output is correct
18 Correct 2 ms 16732 KB Output is correct
19 Correct 2 ms 16848 KB Output is correct
20 Correct 3 ms 16732 KB Output is correct
21 Correct 2 ms 16732 KB Output is correct
22 Correct 3 ms 16732 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 2 ms 16984 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 5 ms 16988 KB Output is correct
27 Correct 4 ms 16936 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 16988 KB Output is correct
30 Correct 4 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16860 KB Output is correct
33 Correct 4 ms 16984 KB Output is correct
34 Correct 3 ms 16988 KB Output is correct
35 Correct 3 ms 16864 KB Output is correct
36 Correct 4 ms 16984 KB Output is correct
37 Correct 3 ms 16964 KB Output is correct
38 Correct 3 ms 16988 KB Output is correct
39 Correct 4 ms 16988 KB Output is correct
40 Correct 4 ms 16988 KB Output is correct
41 Correct 4 ms 16988 KB Output is correct
42 Correct 4 ms 16988 KB Output is correct
43 Correct 4 ms 16988 KB Output is correct
44 Correct 4 ms 16868 KB Output is correct
45 Correct 119 ms 40972 KB Output is correct
46 Correct 118 ms 40964 KB Output is correct
47 Correct 121 ms 40920 KB Output is correct
48 Correct 119 ms 40964 KB Output is correct
49 Correct 116 ms 40948 KB Output is correct
50 Correct 64 ms 40788 KB Output is correct
51 Correct 79 ms 40788 KB Output is correct
52 Correct 82 ms 40784 KB Output is correct
53 Correct 101 ms 40900 KB Output is correct
54 Correct 66 ms 41040 KB Output is correct
55 Correct 58 ms 40992 KB Output is correct
56 Correct 57 ms 41036 KB Output is correct
57 Correct 89 ms 40784 KB Output is correct
58 Correct 83 ms 40968 KB Output is correct
59 Correct 97 ms 40788 KB Output is correct
60 Correct 111 ms 41040 KB Output is correct
61 Correct 111 ms 40788 KB Output is correct
62 Correct 56 ms 41040 KB Output is correct
63 Correct 53 ms 40788 KB Output is correct
64 Correct 48 ms 40784 KB Output is correct
65 Correct 68 ms 41040 KB Output is correct
66 Correct 67 ms 40936 KB Output is correct
67 Correct 101 ms 41044 KB Output is correct
68 Correct 105 ms 41252 KB Output is correct
69 Correct 114 ms 41260 KB Output is correct
70 Correct 108 ms 41012 KB Output is correct
71 Correct 100 ms 41044 KB Output is correct
72 Correct 99 ms 41044 KB Output is correct
73 Correct 106 ms 41040 KB Output is correct
74 Correct 107 ms 41040 KB Output is correct
75 Correct 95 ms 40864 KB Output is correct
76 Correct 104 ms 40784 KB Output is correct
77 Correct 111 ms 40788 KB Output is correct
78 Correct 120 ms 40788 KB Output is correct
79 Correct 115 ms 40960 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 3 ms 16984 KB Output is correct
3 Correct 2 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct
6 Correct 2 ms 16860 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 16984 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 2 ms 16852 KB Output is correct
11 Correct 2 ms 16984 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 2 ms 16732 KB Output is correct
14 Correct 3 ms 16732 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 3 ms 16732 KB Output is correct
17 Correct 2 ms 16732 KB Output is correct
18 Correct 2 ms 16732 KB Output is correct
19 Correct 2 ms 16848 KB Output is correct
20 Correct 3 ms 16732 KB Output is correct
21 Correct 2 ms 16732 KB Output is correct
22 Correct 3 ms 16732 KB Output is correct
23 Correct 3 ms 16732 KB Output is correct
24 Correct 2 ms 16984 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 5 ms 16988 KB Output is correct
27 Correct 4 ms 16936 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 16988 KB Output is correct
30 Correct 4 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16860 KB Output is correct
33 Correct 4 ms 16984 KB Output is correct
34 Correct 3 ms 16988 KB Output is correct
35 Correct 3 ms 16864 KB Output is correct
36 Correct 4 ms 16984 KB Output is correct
37 Correct 3 ms 16964 KB Output is correct
38 Correct 3 ms 16988 KB Output is correct
39 Correct 4 ms 16988 KB Output is correct
40 Correct 4 ms 16988 KB Output is correct
41 Correct 4 ms 16988 KB Output is correct
42 Correct 4 ms 16988 KB Output is correct
43 Correct 4 ms 16988 KB Output is correct
44 Correct 4 ms 16868 KB Output is correct
45 Correct 119 ms 40972 KB Output is correct
46 Correct 118 ms 40964 KB Output is correct
47 Correct 121 ms 40920 KB Output is correct
48 Correct 119 ms 40964 KB Output is correct
49 Correct 116 ms 40948 KB Output is correct
50 Correct 64 ms 40788 KB Output is correct
51 Correct 79 ms 40788 KB Output is correct
52 Correct 82 ms 40784 KB Output is correct
53 Correct 101 ms 40900 KB Output is correct
54 Correct 66 ms 41040 KB Output is correct
55 Correct 58 ms 40992 KB Output is correct
56 Correct 57 ms 41036 KB Output is correct
57 Correct 89 ms 40784 KB Output is correct
58 Correct 83 ms 40968 KB Output is correct
59 Correct 97 ms 40788 KB Output is correct
60 Correct 111 ms 41040 KB Output is correct
61 Correct 111 ms 40788 KB Output is correct
62 Correct 56 ms 41040 KB Output is correct
63 Correct 53 ms 40788 KB Output is correct
64 Correct 48 ms 40784 KB Output is correct
65 Correct 68 ms 41040 KB Output is correct
66 Correct 67 ms 40936 KB Output is correct
67 Correct 101 ms 41044 KB Output is correct
68 Correct 105 ms 41252 KB Output is correct
69 Correct 114 ms 41260 KB Output is correct
70 Correct 108 ms 41012 KB Output is correct
71 Correct 100 ms 41044 KB Output is correct
72 Correct 99 ms 41044 KB Output is correct
73 Correct 106 ms 41040 KB Output is correct
74 Correct 107 ms 41040 KB Output is correct
75 Correct 95 ms 40864 KB Output is correct
76 Correct 104 ms 40784 KB Output is correct
77 Correct 111 ms 40788 KB Output is correct
78 Correct 120 ms 40788 KB Output is correct
79 Correct 115 ms 40960 KB Output is correct
80 Correct 1932 ms 196236 KB Output is correct
81 Correct 1819 ms 196364 KB Output is correct
82 Correct 1895 ms 196488 KB Output is correct
83 Correct 1904 ms 196132 KB Output is correct
84 Correct 1963 ms 196120 KB Output is correct
85 Correct 1299 ms 200124 KB Output is correct
86 Correct 1464 ms 200276 KB Output is correct
87 Correct 1320 ms 200228 KB Output is correct
88 Correct 1594 ms 200272 KB Output is correct
89 Correct 1374 ms 202224 KB Output is correct
90 Correct 1084 ms 201864 KB Output is correct
91 Correct 1101 ms 202320 KB Output is correct
92 Correct 1413 ms 200124 KB Output is correct
93 Correct 1319 ms 200016 KB Output is correct
94 Correct 1570 ms 199920 KB Output is correct
95 Correct 1634 ms 197968 KB Output is correct
96 Correct 1685 ms 196588 KB Output is correct
97 Correct 1245 ms 196792 KB Output is correct
98 Correct 1485 ms 196416 KB Output is correct
99 Correct 1082 ms 196692 KB Output is correct
100 Correct 1560 ms 198480 KB Output is correct
101 Correct 1509 ms 198484 KB Output is correct
102 Correct 1742 ms 198644 KB Output is correct
103 Correct 1693 ms 198724 KB Output is correct
104 Correct 1689 ms 198456 KB Output is correct
105 Correct 1702 ms 198344 KB Output is correct
106 Correct 1596 ms 198648 KB Output is correct
107 Correct 1575 ms 198228 KB Output is correct
108 Correct 1654 ms 198500 KB Output is correct
109 Correct 1689 ms 198800 KB Output is correct
110 Correct 1434 ms 196440 KB Output is correct
111 Correct 1562 ms 196332 KB Output is correct
112 Correct 1578 ms 196300 KB Output is correct
113 Correct 1904 ms 196320 KB Output is correct
114 Correct 2015 ms 196536 KB Output is correct