oj.uz

Submission #834000

# Submission time Handle Problem Language Result Execution time Memory
834000 2023-08-22T10:05:18 Z LucaIlie Port Facility (JOI17_port_facility) C++17
78 / 100
 6000 ms 117732 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 bipartit = true;
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, visitedByL0, visitedByR0, visitedByL1, visitedByR1;

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 );
    if ( side[u] == 0 ) {
        visitedByL0.update( 0, 1, 2 * n, l[u], r[u] );
        visitedByR0.update( 0, 1, 2 * n, r[u], -l[u] );
    } else {
        visitedByL1.update( 0, 1, 2 * n, l[u], r[u] );
        visitedByR1.update( 0, 1, 2 * n, r[u], -l[u] );
    }

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

    bool exista0 = false, exista1 = false;
    if ( visitedByL0.query( 0, 1, 2 * n, l[u], r[u] ) > r[u] || -visitedByR0.query( 0, 1, 2 * n, l[u], r[u] ) < l[u] )
        exista0 = true;
    if ( visitedByL1.query( 0, 1, 2 * n, l[u], r[u] ) > r[u] || -visitedByR1.query( 0, 1, 2 * n, l[u], r[u] ) < l[u] )
        exista1 = true;

    if ( exista0 && exista1 )
        bipartit = false;
}

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();
    visitedByL0.init();
    visitedByR0.init();
    visitedByL1.init();
    visitedByR1.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++;
        }
    }

    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 36 ms 94156 KB Output is correct
2 Correct 44 ms 94176 KB Output is correct
3 Correct 36 ms 94156 KB Output is correct
4 Correct 37 ms 94224 KB Output is correct
5 Correct 35 ms 94156 KB Output is correct
6 Correct 43 ms 94176 KB Output is correct
7 Correct 36 ms 94184 KB Output is correct
8 Correct 39 ms 94240 KB Output is correct
9 Correct 36 ms 94156 KB Output is correct
10 Correct 36 ms 94292 KB Output is correct
11 Correct 36 ms 94292 KB Output is correct
12 Correct 37 ms 94292 KB Output is correct
13 Correct 36 ms 94156 KB Output is correct
14 Correct 37 ms 94340 KB Output is correct
15 Correct 38 ms 94156 KB Output is correct
16 Correct 37 ms 94292 KB Output is correct
17 Correct 40 ms 94228 KB Output is correct
18 Correct 35 ms 94216 KB Output is correct
19 Correct 36 ms 94208 KB Output is correct
20 Correct 37 ms 94156 KB Output is correct
21 Correct 37 ms 94156 KB Output is correct
22 Correct 35 ms 94156 KB Output is correct
23 Correct 39 ms 94156 KB Output is correct
24 Correct 35 ms 94196 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94156 KB Output is correct
2 Correct 44 ms 94176 KB Output is correct
3 Correct 36 ms 94156 KB Output is correct
4 Correct 37 ms 94224 KB Output is correct
5 Correct 35 ms 94156 KB Output is correct
6 Correct 43 ms 94176 KB Output is correct
7 Correct 36 ms 94184 KB Output is correct
8 Correct 39 ms 94240 KB Output is correct
9 Correct 36 ms 94156 KB Output is correct
10 Correct 36 ms 94292 KB Output is correct
11 Correct 36 ms 94292 KB Output is correct
12 Correct 37 ms 94292 KB Output is correct
13 Correct 36 ms 94156 KB Output is correct
14 Correct 37 ms 94340 KB Output is correct
15 Correct 38 ms 94156 KB Output is correct
16 Correct 37 ms 94292 KB Output is correct
17 Correct 40 ms 94228 KB Output is correct
18 Correct 35 ms 94216 KB Output is correct
19 Correct 36 ms 94208 KB Output is correct
20 Correct 37 ms 94156 KB Output is correct
21 Correct 37 ms 94156 KB Output is correct
22 Correct 35 ms 94156 KB Output is correct
23 Correct 39 ms 94156 KB Output is correct
24 Correct 35 ms 94196 KB Output is correct
25 Correct 42 ms 94420 KB Output is correct
26 Correct 41 ms 94328 KB Output is correct
27 Correct 40 ms 94412 KB Output is correct
28 Correct 42 ms 94412 KB Output is correct
29 Correct 37 ms 94384 KB Output is correct
30 Correct 44 ms 94368 KB Output is correct
31 Correct 40 ms 94412 KB Output is correct
32 Correct 41 ms 94432 KB Output is correct
33 Correct 38 ms 94292 KB Output is correct
34 Correct 40 ms 94372 KB Output is correct
35 Correct 40 ms 94256 KB Output is correct
36 Correct 39 ms 94292 KB Output is correct
37 Correct 45 ms 94412 KB Output is correct
38 Correct 37 ms 94396 KB Output is correct
39 Correct 37 ms 94284 KB Output is correct
40 Correct 39 ms 94284 KB Output is correct
41 Correct 38 ms 94548 KB Output is correct
42 Correct 38 ms 94456 KB Output is correct
43 Correct 40 ms 94564 KB Output is correct
44 Correct 38 ms 94548 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94156 KB Output is correct
2 Correct 44 ms 94176 KB Output is correct
3 Correct 36 ms 94156 KB Output is correct
4 Correct 37 ms 94224 KB Output is correct
5 Correct 35 ms 94156 KB Output is correct
6 Correct 43 ms 94176 KB Output is correct
7 Correct 36 ms 94184 KB Output is correct
8 Correct 39 ms 94240 KB Output is correct
9 Correct 36 ms 94156 KB Output is correct
10 Correct 36 ms 94292 KB Output is correct
11 Correct 36 ms 94292 KB Output is correct
12 Correct 37 ms 94292 KB Output is correct
13 Correct 36 ms 94156 KB Output is correct
14 Correct 37 ms 94340 KB Output is correct
15 Correct 38 ms 94156 KB Output is correct
16 Correct 37 ms 94292 KB Output is correct
17 Correct 40 ms 94228 KB Output is correct
18 Correct 35 ms 94216 KB Output is correct
19 Correct 36 ms 94208 KB Output is correct
20 Correct 37 ms 94156 KB Output is correct
21 Correct 37 ms 94156 KB Output is correct
22 Correct 35 ms 94156 KB Output is correct
23 Correct 39 ms 94156 KB Output is correct
24 Correct 35 ms 94196 KB Output is correct
25 Correct 42 ms 94420 KB Output is correct
26 Correct 41 ms 94328 KB Output is correct
27 Correct 40 ms 94412 KB Output is correct
28 Correct 42 ms 94412 KB Output is correct
29 Correct 37 ms 94384 KB Output is correct
30 Correct 44 ms 94368 KB Output is correct
31 Correct 40 ms 94412 KB Output is correct
32 Correct 41 ms 94432 KB Output is correct
33 Correct 38 ms 94292 KB Output is correct
34 Correct 40 ms 94372 KB Output is correct
35 Correct 40 ms 94256 KB Output is correct
36 Correct 39 ms 94292 KB Output is correct
37 Correct 45 ms 94412 KB Output is correct
38 Correct 37 ms 94396 KB Output is correct
39 Correct 37 ms 94284 KB Output is correct
40 Correct 39 ms 94284 KB Output is correct
41 Correct 38 ms 94548 KB Output is correct
42 Correct 38 ms 94456 KB Output is correct
43 Correct 40 ms 94564 KB Output is correct
44 Correct 38 ms 94548 KB Output is correct
45 Correct 240 ms 98348 KB Output is correct
46 Correct 249 ms 99844 KB Output is correct
47 Correct 231 ms 97356 KB Output is correct
48 Correct 248 ms 99792 KB Output is correct
49 Correct 238 ms 97528 KB Output is correct
50 Correct 233 ms 99456 KB Output is correct
51 Correct 253 ms 99364 KB Output is correct
52 Correct 252 ms 96820 KB Output is correct
53 Correct 347 ms 95948 KB Output is correct
54 Correct 223 ms 106896 KB Output is correct
55 Correct 219 ms 101528 KB Output is correct
56 Correct 220 ms 101520 KB Output is correct
57 Correct 268 ms 96828 KB Output is correct
58 Correct 289 ms 96820 KB Output is correct
59 Correct 278 ms 96784 KB Output is correct
60 Correct 282 ms 96872 KB Output is correct
61 Correct 282 ms 96816 KB Output is correct
62 Correct 238 ms 96844 KB Output is correct
63 Correct 246 ms 96820 KB Output is correct
64 Correct 256 ms 96824 KB Output is correct
65 Correct 273 ms 107388 KB Output is correct
66 Correct 267 ms 107320 KB Output is correct
67 Correct 223 ms 101836 KB Output is correct
68 Correct 243 ms 101900 KB Output is correct
69 Correct 222 ms 101212 KB Output is correct
70 Correct 235 ms 101248 KB Output is correct
71 Correct 224 ms 106972 KB Output is correct
72 Correct 252 ms 106956 KB Output is correct
73 Correct 228 ms 103244 KB Output is correct
74 Correct 228 ms 103244 KB Output is correct
75 Correct 185 ms 103248 KB Output is correct
76 Correct 189 ms 107744 KB Output is correct
77 Correct 183 ms 107772 KB Output is correct
78 Correct 237 ms 99508 KB Output is correct
79 Correct 237 ms 98440 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94156 KB Output is correct
2 Correct 44 ms 94176 KB Output is correct
3 Correct 36 ms 94156 KB Output is correct
4 Correct 37 ms 94224 KB Output is correct
5 Correct 35 ms 94156 KB Output is correct
6 Correct 43 ms 94176 KB Output is correct
7 Correct 36 ms 94184 KB Output is correct
8 Correct 39 ms 94240 KB Output is correct
9 Correct 36 ms 94156 KB Output is correct
10 Correct 36 ms 94292 KB Output is correct
11 Correct 36 ms 94292 KB Output is correct
12 Correct 37 ms 94292 KB Output is correct
13 Correct 36 ms 94156 KB Output is correct
14 Correct 37 ms 94340 KB Output is correct
15 Correct 38 ms 94156 KB Output is correct
16 Correct 37 ms 94292 KB Output is correct
17 Correct 40 ms 94228 KB Output is correct
18 Correct 35 ms 94216 KB Output is correct
19 Correct 36 ms 94208 KB Output is correct
20 Correct 37 ms 94156 KB Output is correct
21 Correct 37 ms 94156 KB Output is correct
22 Correct 35 ms 94156 KB Output is correct
23 Correct 39 ms 94156 KB Output is correct
24 Correct 35 ms 94196 KB Output is correct
25 Correct 42 ms 94420 KB Output is correct
26 Correct 41 ms 94328 KB Output is correct
27 Correct 40 ms 94412 KB Output is correct
28 Correct 42 ms 94412 KB Output is correct
29 Correct 37 ms 94384 KB Output is correct
30 Correct 44 ms 94368 KB Output is correct
31 Correct 40 ms 94412 KB Output is correct
32 Correct 41 ms 94432 KB Output is correct
33 Correct 38 ms 94292 KB Output is correct
34 Correct 40 ms 94372 KB Output is correct
35 Correct 40 ms 94256 KB Output is correct
36 Correct 39 ms 94292 KB Output is correct
37 Correct 45 ms 94412 KB Output is correct
38 Correct 37 ms 94396 KB Output is correct
39 Correct 37 ms 94284 KB Output is correct
40 Correct 39 ms 94284 KB Output is correct
41 Correct 38 ms 94548 KB Output is correct
42 Correct 38 ms 94456 KB Output is correct
43 Correct 40 ms 94564 KB Output is correct
44 Correct 38 ms 94548 KB Output is correct
45 Correct 240 ms 98348 KB Output is correct
46 Correct 249 ms 99844 KB Output is correct
47 Correct 231 ms 97356 KB Output is correct
48 Correct 248 ms 99792 KB Output is correct
49 Correct 238 ms 97528 KB Output is correct
50 Correct 233 ms 99456 KB Output is correct
51 Correct 253 ms 99364 KB Output is correct
52 Correct 252 ms 96820 KB Output is correct
53 Correct 347 ms 95948 KB Output is correct
54 Correct 223 ms 106896 KB Output is correct
55 Correct 219 ms 101528 KB Output is correct
56 Correct 220 ms 101520 KB Output is correct
57 Correct 268 ms 96828 KB Output is correct
58 Correct 289 ms 96820 KB Output is correct
59 Correct 278 ms 96784 KB Output is correct
60 Correct 282 ms 96872 KB Output is correct
61 Correct 282 ms 96816 KB Output is correct
62 Correct 238 ms 96844 KB Output is correct
63 Correct 246 ms 96820 KB Output is correct
64 Correct 256 ms 96824 KB Output is correct
65 Correct 273 ms 107388 KB Output is correct
66 Correct 267 ms 107320 KB Output is correct
67 Correct 223 ms 101836 KB Output is correct
68 Correct 243 ms 101900 KB Output is correct
69 Correct 222 ms 101212 KB Output is correct
70 Correct 235 ms 101248 KB Output is correct
71 Correct 224 ms 106972 KB Output is correct
72 Correct 252 ms 106956 KB Output is correct
73 Correct 228 ms 103244 KB Output is correct
74 Correct 228 ms 103244 KB Output is correct
75 Correct 185 ms 103248 KB Output is correct
76 Correct 189 ms 107744 KB Output is correct
77 Correct 183 ms 107772 KB Output is correct
78 Correct 237 ms 99508 KB Output is correct
79 Correct 237 ms 98440 KB Output is correct
80 Execution timed out 6030 ms 117732 KB Time limit exceeded
81 Halted 0 ms 0 KB -