oj.uz

Submission #834061

# Submission time Handle Problem Language Result Execution time Memory
834061 2023-08-22T10:27:28 Z LucaIlie Port Facility (JOI17_port_facility) C++17
78 / 100
 6000 ms 76516 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e6;
const int INF = 1e9;
const int MOD = 1e9 + 7;

int n;
bool vis[MAX_N], side[MAX_N];
int l[MAX_N], r[MAX_N];
int indexL[2 * MAX_N + 1], indexR[2 * MAX_N + 1];

struct SEG_TREE {
    int segTree[4 * MAX_N];

    void init() {
        for ( int v = 0; v < 4 * MAX_N; v++ )
            segTree[v] = -INF;
    }

    void update( int v, int l, int r, int pos, int x ) {
        if ( l > pos || r < pos )
            return;

        if ( l == r ) {
            segTree[v] = x;
            return;
        }

        int mid = (l + r) / 2;
        update( v * 2 + 1, l, mid, pos, x );
        update( v * 2 + 2, mid + 1, r, pos, x );
        segTree[v] = max( segTree[v * 2 + 1], segTree[v * 2 + 2] );
    }

    int query( int v, int l, int r, int lq, int rq ) {
        if ( l > rq || r < lq )
            return -INF;

        if ( lq <= l && r <= rq )
            return segTree[v];

        int mid = (l + r) / 2;
        return max( query( v * 2 + 1, l, mid, lq, rq ), query( v * 2 + 2, mid + 1, r, lq, rq ) );
    }
};

SEG_TREE unvisitedByL, unvisitedByR, visitedByL, visitedByR;

void checkBipartit( int u ) {
    vis[u] = true;
    unvisitedByL.update( 0, 1, 2 * n, l[u], -INF );
    unvisitedByR.update( 0, 1, 2 * n, r[u], -INF );

    int rr = unvisitedByL.query( 0, 1, 2 * n, l[u], r[u] );
    while ( rr > r[u] ) {
        int v = indexR[rr];
        side[v] = side[u] ^ 1;
        checkBipartit( v );
        rr = unvisitedByL.query( 0, 1, 2 * n, l[u], r[u] );
    }
    int ll = -unvisitedByR.query( 0, 1, 2 * n, l[u], r[u] );
    while ( ll < l[u] ) {
        int v = indexL[ll];
        side[v] = side[u] ^ 1;
        checkBipartit( v );
        ll = -unvisitedByR.query( 0, 1, 2 * n, l[u], r[u] );
    }
}

int main() {
    cin.tie( NULL );
    cout.tie( NULL );
    ios_base::sync_with_stdio( false );

    cin >> n;
    for ( int i = 0; i < n; i++ )
        cin >> l[i] >> r[i];

    unvisitedByL.init();
    unvisitedByR.init();
    for ( int i = 0; i < n; i++ ) {
        unvisitedByL.update( 0, 1, 2 * n, l[i], r[i] );
        unvisitedByR.update( 0, 1, 2 * n, r[i], -l[i] );
        indexL[l[i]] = i;
        indexR[r[i]] = i;
    }

    int comp = 0;
    for ( int u = 0; u < n; u++ ) {
        if ( !vis[u] ) {
            side[u] = 0;
            checkBipartit( u );
            comp++;
        }
    }

    bool bipartit = true;
    visitedByL.init();
    visitedByR.init();
    for ( int i = 0; i < n; i++ ) {
        if ( side[i] == 1 )
            continue;
        if ( visitedByL.query( 0, 1, 2 * n, l[i], r[i] ) > r[i] )
            bipartit = false;
        if ( -visitedByR.query( 0, 1, 2 * n, l[i], r[i] ) < l[i] )
            bipartit = false;
        visitedByL.update( 0, 1, 2 * n, l[i], r[i] );
        visitedByR.update( 0, 1, 2 * n, r[i], -l[i] );
    }
    visitedByL.init();
    visitedByR.init();
    for ( int i = 0; i < n; i++ ) {
        if ( side[i] == 0 )
            continue;
        if ( visitedByL.query( 0, 1, 2 * n, l[i], r[i] ) > r[i] )
            bipartit = false;
        if ( -visitedByR.query( 0, 1, 2 * n, l[i], r[i] ) < l[i] )
            bipartit = false;
        visitedByL.update( 0, 1, 2 * n, l[i], r[i] );
        visitedByR.update( 0, 1, 2 * n, r[i], -l[i] );
    }

    if ( bipartit ) {
        int ans = 1;
        for ( int i = 0; i < comp; i++ )
            ans = ans * 2 % MOD;
        cout << ans;
    } else
        cout << 0;

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 62932 KB Output is correct
2 Correct 32 ms 62908 KB Output is correct
3 Correct 31 ms 62904 KB Output is correct
4 Correct 30 ms 62920 KB Output is correct
5 Correct 34 ms 62924 KB Output is correct
6 Correct 31 ms 62932 KB Output is correct
7 Correct 32 ms 62880 KB Output is correct
8 Correct 31 ms 62852 KB Output is correct
9 Correct 31 ms 62876 KB Output is correct
10 Correct 30 ms 62932 KB Output is correct
11 Correct 31 ms 62860 KB Output is correct
12 Correct 30 ms 62948 KB Output is correct
13 Correct 30 ms 62892 KB Output is correct
14 Correct 31 ms 62932 KB Output is correct
15 Correct 30 ms 62892 KB Output is correct
16 Correct 31 ms 62972 KB Output is correct
17 Correct 31 ms 62880 KB Output is correct
18 Correct 31 ms 62976 KB Output is correct
19 Correct 31 ms 62972 KB Output is correct
20 Correct 31 ms 63044 KB Output is correct
21 Correct 30 ms 62944 KB Output is correct
22 Correct 30 ms 62956 KB Output is correct
23 Correct 32 ms 62880 KB Output is correct
24 Correct 30 ms 62884 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 62932 KB Output is correct
2 Correct 32 ms 62908 KB Output is correct
3 Correct 31 ms 62904 KB Output is correct
4 Correct 30 ms 62920 KB Output is correct
5 Correct 34 ms 62924 KB Output is correct
6 Correct 31 ms 62932 KB Output is correct
7 Correct 32 ms 62880 KB Output is correct
8 Correct 31 ms 62852 KB Output is correct
9 Correct 31 ms 62876 KB Output is correct
10 Correct 30 ms 62932 KB Output is correct
11 Correct 31 ms 62860 KB Output is correct
12 Correct 30 ms 62948 KB Output is correct
13 Correct 30 ms 62892 KB Output is correct
14 Correct 31 ms 62932 KB Output is correct
15 Correct 30 ms 62892 KB Output is correct
16 Correct 31 ms 62972 KB Output is correct
17 Correct 31 ms 62880 KB Output is correct
18 Correct 31 ms 62976 KB Output is correct
19 Correct 31 ms 62972 KB Output is correct
20 Correct 31 ms 63044 KB Output is correct
21 Correct 30 ms 62944 KB Output is correct
22 Correct 30 ms 62956 KB Output is correct
23 Correct 32 ms 62880 KB Output is correct
24 Correct 30 ms 62884 KB Output is correct
25 Correct 35 ms 63036 KB Output is correct
26 Correct 32 ms 63036 KB Output is correct
27 Correct 33 ms 63068 KB Output is correct
28 Correct 32 ms 63112 KB Output is correct
29 Correct 36 ms 63016 KB Output is correct
30 Correct 34 ms 63144 KB Output is correct
31 Correct 33 ms 63060 KB Output is correct
32 Correct 35 ms 63064 KB Output is correct
33 Correct 32 ms 63072 KB Output is correct
34 Correct 32 ms 63096 KB Output is correct
35 Correct 32 ms 63024 KB Output is correct
36 Correct 32 ms 62936 KB Output is correct
37 Correct 32 ms 63232 KB Output is correct
38 Correct 33 ms 63180 KB Output is correct
39 Correct 32 ms 62984 KB Output is correct
40 Correct 31 ms 62972 KB Output is correct
41 Correct 32 ms 63132 KB Output is correct
42 Correct 33 ms 63196 KB Output is correct
43 Correct 32 ms 63228 KB Output is correct
44 Correct 35 ms 63160 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 62932 KB Output is correct
2 Correct 32 ms 62908 KB Output is correct
3 Correct 31 ms 62904 KB Output is correct
4 Correct 30 ms 62920 KB Output is correct
5 Correct 34 ms 62924 KB Output is correct
6 Correct 31 ms 62932 KB Output is correct
7 Correct 32 ms 62880 KB Output is correct
8 Correct 31 ms 62852 KB Output is correct
9 Correct 31 ms 62876 KB Output is correct
10 Correct 30 ms 62932 KB Output is correct
11 Correct 31 ms 62860 KB Output is correct
12 Correct 30 ms 62948 KB Output is correct
13 Correct 30 ms 62892 KB Output is correct
14 Correct 31 ms 62932 KB Output is correct
15 Correct 30 ms 62892 KB Output is correct
16 Correct 31 ms 62972 KB Output is correct
17 Correct 31 ms 62880 KB Output is correct
18 Correct 31 ms 62976 KB Output is correct
19 Correct 31 ms 62972 KB Output is correct
20 Correct 31 ms 63044 KB Output is correct
21 Correct 30 ms 62944 KB Output is correct
22 Correct 30 ms 62956 KB Output is correct
23 Correct 32 ms 62880 KB Output is correct
24 Correct 30 ms 62884 KB Output is correct
25 Correct 35 ms 63036 KB Output is correct
26 Correct 32 ms 63036 KB Output is correct
27 Correct 33 ms 63068 KB Output is correct
28 Correct 32 ms 63112 KB Output is correct
29 Correct 36 ms 63016 KB Output is correct
30 Correct 34 ms 63144 KB Output is correct
31 Correct 33 ms 63060 KB Output is correct
32 Correct 35 ms 63064 KB Output is correct
33 Correct 32 ms 63072 KB Output is correct
34 Correct 32 ms 63096 KB Output is correct
35 Correct 32 ms 63024 KB Output is correct
36 Correct 32 ms 62936 KB Output is correct
37 Correct 32 ms 63232 KB Output is correct
38 Correct 33 ms 63180 KB Output is correct
39 Correct 32 ms 62984 KB Output is correct
40 Correct 31 ms 62972 KB Output is correct
41 Correct 32 ms 63132 KB Output is correct
42 Correct 33 ms 63196 KB Output is correct
43 Correct 32 ms 63228 KB Output is correct
44 Correct 35 ms 63160 KB Output is correct
45 Correct 222 ms 67176 KB Output is correct
46 Correct 218 ms 68588 KB Output is correct
47 Correct 216 ms 66124 KB Output is correct
48 Correct 218 ms 68624 KB Output is correct
49 Correct 241 ms 66384 KB Output is correct
50 Correct 219 ms 68220 KB Output is correct
51 Correct 215 ms 68172 KB Output is correct
52 Correct 184 ms 65640 KB Output is correct
53 Correct 228 ms 64764 KB Output is correct
54 Correct 223 ms 75740 KB Output is correct
55 Correct 218 ms 70232 KB Output is correct
56 Correct 215 ms 70352 KB Output is correct
57 Correct 207 ms 65716 KB Output is correct
58 Correct 193 ms 65608 KB Output is correct
59 Correct 211 ms 65608 KB Output is correct
60 Correct 225 ms 65688 KB Output is correct
61 Correct 216 ms 65620 KB Output is correct
62 Correct 195 ms 65600 KB Output is correct
63 Correct 222 ms 65640 KB Output is correct
64 Correct 208 ms 65608 KB Output is correct
65 Correct 262 ms 76204 KB Output is correct
66 Correct 261 ms 76240 KB Output is correct
67 Correct 219 ms 70596 KB Output is correct
68 Correct 227 ms 70720 KB Output is correct
69 Correct 228 ms 70064 KB Output is correct
70 Correct 218 ms 70112 KB Output is correct
71 Correct 221 ms 75820 KB Output is correct
72 Correct 221 ms 75816 KB Output is correct
73 Correct 219 ms 72168 KB Output is correct
74 Correct 216 ms 72160 KB Output is correct
75 Correct 190 ms 72156 KB Output is correct
76 Correct 188 ms 76492 KB Output is correct
77 Correct 187 ms 76516 KB Output is correct
78 Correct 229 ms 68280 KB Output is correct
79 Correct 222 ms 67272 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 62932 KB Output is correct
2 Correct 32 ms 62908 KB Output is correct
3 Correct 31 ms 62904 KB Output is correct
4 Correct 30 ms 62920 KB Output is correct
5 Correct 34 ms 62924 KB Output is correct
6 Correct 31 ms 62932 KB Output is correct
7 Correct 32 ms 62880 KB Output is correct
8 Correct 31 ms 62852 KB Output is correct
9 Correct 31 ms 62876 KB Output is correct
10 Correct 30 ms 62932 KB Output is correct
11 Correct 31 ms 62860 KB Output is correct
12 Correct 30 ms 62948 KB Output is correct
13 Correct 30 ms 62892 KB Output is correct
14 Correct 31 ms 62932 KB Output is correct
15 Correct 30 ms 62892 KB Output is correct
16 Correct 31 ms 62972 KB Output is correct
17 Correct 31 ms 62880 KB Output is correct
18 Correct 31 ms 62976 KB Output is correct
19 Correct 31 ms 62972 KB Output is correct
20 Correct 31 ms 63044 KB Output is correct
21 Correct 30 ms 62944 KB Output is correct
22 Correct 30 ms 62956 KB Output is correct
23 Correct 32 ms 62880 KB Output is correct
24 Correct 30 ms 62884 KB Output is correct
25 Correct 35 ms 63036 KB Output is correct
26 Correct 32 ms 63036 KB Output is correct
27 Correct 33 ms 63068 KB Output is correct
28 Correct 32 ms 63112 KB Output is correct
29 Correct 36 ms 63016 KB Output is correct
30 Correct 34 ms 63144 KB Output is correct
31 Correct 33 ms 63060 KB Output is correct
32 Correct 35 ms 63064 KB Output is correct
33 Correct 32 ms 63072 KB Output is correct
34 Correct 32 ms 63096 KB Output is correct
35 Correct 32 ms 63024 KB Output is correct
36 Correct 32 ms 62936 KB Output is correct
37 Correct 32 ms 63232 KB Output is correct
38 Correct 33 ms 63180 KB Output is correct
39 Correct 32 ms 62984 KB Output is correct
40 Correct 31 ms 62972 KB Output is correct
41 Correct 32 ms 63132 KB Output is correct
42 Correct 33 ms 63196 KB Output is correct
43 Correct 32 ms 63228 KB Output is correct
44 Correct 35 ms 63160 KB Output is correct
45 Correct 222 ms 67176 KB Output is correct
46 Correct 218 ms 68588 KB Output is correct
47 Correct 216 ms 66124 KB Output is correct
48 Correct 218 ms 68624 KB Output is correct
49 Correct 241 ms 66384 KB Output is correct
50 Correct 219 ms 68220 KB Output is correct
51 Correct 215 ms 68172 KB Output is correct
52 Correct 184 ms 65640 KB Output is correct
53 Correct 228 ms 64764 KB Output is correct
54 Correct 223 ms 75740 KB Output is correct
55 Correct 218 ms 70232 KB Output is correct
56 Correct 215 ms 70352 KB Output is correct
57 Correct 207 ms 65716 KB Output is correct
58 Correct 193 ms 65608 KB Output is correct
59 Correct 211 ms 65608 KB Output is correct
60 Correct 225 ms 65688 KB Output is correct
61 Correct 216 ms 65620 KB Output is correct
62 Correct 195 ms 65600 KB Output is correct
63 Correct 222 ms 65640 KB Output is correct
64 Correct 208 ms 65608 KB Output is correct
65 Correct 262 ms 76204 KB Output is correct
66 Correct 261 ms 76240 KB Output is correct
67 Correct 219 ms 70596 KB Output is correct
68 Correct 227 ms 70720 KB Output is correct
69 Correct 228 ms 70064 KB Output is correct
70 Correct 218 ms 70112 KB Output is correct
71 Correct 221 ms 75820 KB Output is correct
72 Correct 221 ms 75816 KB Output is correct
73 Correct 219 ms 72168 KB Output is correct
74 Correct 216 ms 72160 KB Output is correct
75 Correct 190 ms 72156 KB Output is correct
76 Correct 188 ms 76492 KB Output is correct
77 Correct 187 ms 76516 KB Output is correct
78 Correct 229 ms 68280 KB Output is correct
79 Correct 222 ms 67272 KB Output is correct
80 Execution timed out 6018 ms 55244 KB Time limit exceeded
81 Halted 0 ms 0 KB -