oj.uz

Submission #833985

# Submission time Handle Problem Language Result Execution time Memory
833985 2023-08-22T09:58:25 Z LucaIlie Port Facility (JOI17_port_facility) C++17
78 / 100
 6000 ms 226156 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e6;
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 info {
    int minn, maxx;

    info operator + ( info x ) {
        return { min( minn, x.minn ), max( maxx, x.maxx ) };
    }
};

struct SEG_TREE {
    info segTree[4 * MAX_N];

    void init() {
        for ( int v = 0; v < 4 * MAX_N; v++ )
            segTree[v] = { 2 * n + 1, 0 };
    }

    void update( int v, int l, int r, int pos, info 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] = segTree[v * 2 + 1] + segTree[v * 2 + 2];
    }

    info query( int v, int l, int r, int lq, int rq ) {
        if ( l > rq || r < lq )
            return { 2 * n + 1, 0 };

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

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

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

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

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

int main() {
    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], r[i] } );
        unvisitedByR.update( 0, 1, 2 * n, r[i], { l[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 71 ms 188156 KB Output is correct
2 Correct 72 ms 188144 KB Output is correct
3 Correct 68 ms 188108 KB Output is correct
4 Correct 72 ms 188144 KB Output is correct
5 Correct 69 ms 188084 KB Output is correct
6 Correct 68 ms 188136 KB Output is correct
7 Correct 71 ms 188148 KB Output is correct
8 Correct 72 ms 188184 KB Output is correct
9 Correct 69 ms 188156 KB Output is correct
10 Correct 72 ms 188164 KB Output is correct
11 Correct 73 ms 188084 KB Output is correct
12 Correct 71 ms 188084 KB Output is correct
13 Correct 68 ms 188164 KB Output is correct
14 Correct 68 ms 188092 KB Output is correct
15 Correct 72 ms 188196 KB Output is correct
16 Correct 69 ms 188148 KB Output is correct
17 Correct 69 ms 188076 KB Output is correct
18 Correct 67 ms 188188 KB Output is correct
19 Correct 70 ms 188108 KB Output is correct
20 Correct 70 ms 188176 KB Output is correct
21 Correct 68 ms 188144 KB Output is correct
22 Correct 69 ms 188164 KB Output is correct
23 Correct 69 ms 188152 KB Output is correct
24 Correct 70 ms 188096 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 188156 KB Output is correct
2 Correct 72 ms 188144 KB Output is correct
3 Correct 68 ms 188108 KB Output is correct
4 Correct 72 ms 188144 KB Output is correct
5 Correct 69 ms 188084 KB Output is correct
6 Correct 68 ms 188136 KB Output is correct
7 Correct 71 ms 188148 KB Output is correct
8 Correct 72 ms 188184 KB Output is correct
9 Correct 69 ms 188156 KB Output is correct
10 Correct 72 ms 188164 KB Output is correct
11 Correct 73 ms 188084 KB Output is correct
12 Correct 71 ms 188084 KB Output is correct
13 Correct 68 ms 188164 KB Output is correct
14 Correct 68 ms 188092 KB Output is correct
15 Correct 72 ms 188196 KB Output is correct
16 Correct 69 ms 188148 KB Output is correct
17 Correct 69 ms 188076 KB Output is correct
18 Correct 67 ms 188188 KB Output is correct
19 Correct 70 ms 188108 KB Output is correct
20 Correct 70 ms 188176 KB Output is correct
21 Correct 68 ms 188144 KB Output is correct
22 Correct 69 ms 188164 KB Output is correct
23 Correct 69 ms 188152 KB Output is correct
24 Correct 70 ms 188096 KB Output is correct
25 Correct 72 ms 188268 KB Output is correct
26 Correct 73 ms 188288 KB Output is correct
27 Correct 72 ms 188264 KB Output is correct
28 Correct 73 ms 188284 KB Output is correct
29 Correct 71 ms 188316 KB Output is correct
30 Correct 71 ms 188368 KB Output is correct
31 Correct 74 ms 188368 KB Output is correct
32 Correct 73 ms 188364 KB Output is correct
33 Correct 73 ms 188280 KB Output is correct
34 Correct 72 ms 188252 KB Output is correct
35 Correct 72 ms 188248 KB Output is correct
36 Correct 73 ms 188204 KB Output is correct
37 Correct 72 ms 188492 KB Output is correct
38 Correct 73 ms 188268 KB Output is correct
39 Correct 72 ms 188196 KB Output is correct
40 Correct 74 ms 188184 KB Output is correct
41 Correct 79 ms 188392 KB Output is correct
42 Correct 73 ms 188456 KB Output is correct
43 Correct 72 ms 188364 KB Output is correct
44 Correct 73 ms 188404 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 188156 KB Output is correct
2 Correct 72 ms 188144 KB Output is correct
3 Correct 68 ms 188108 KB Output is correct
4 Correct 72 ms 188144 KB Output is correct
5 Correct 69 ms 188084 KB Output is correct
6 Correct 68 ms 188136 KB Output is correct
7 Correct 71 ms 188148 KB Output is correct
8 Correct 72 ms 188184 KB Output is correct
9 Correct 69 ms 188156 KB Output is correct
10 Correct 72 ms 188164 KB Output is correct
11 Correct 73 ms 188084 KB Output is correct
12 Correct 71 ms 188084 KB Output is correct
13 Correct 68 ms 188164 KB Output is correct
14 Correct 68 ms 188092 KB Output is correct
15 Correct 72 ms 188196 KB Output is correct
16 Correct 69 ms 188148 KB Output is correct
17 Correct 69 ms 188076 KB Output is correct
18 Correct 67 ms 188188 KB Output is correct
19 Correct 70 ms 188108 KB Output is correct
20 Correct 70 ms 188176 KB Output is correct
21 Correct 68 ms 188144 KB Output is correct
22 Correct 69 ms 188164 KB Output is correct
23 Correct 69 ms 188152 KB Output is correct
24 Correct 70 ms 188096 KB Output is correct
25 Correct 72 ms 188268 KB Output is correct
26 Correct 73 ms 188288 KB Output is correct
27 Correct 72 ms 188264 KB Output is correct
28 Correct 73 ms 188284 KB Output is correct
29 Correct 71 ms 188316 KB Output is correct
30 Correct 71 ms 188368 KB Output is correct
31 Correct 74 ms 188368 KB Output is correct
32 Correct 73 ms 188364 KB Output is correct
33 Correct 73 ms 188280 KB Output is correct
34 Correct 72 ms 188252 KB Output is correct
35 Correct 72 ms 188248 KB Output is correct
36 Correct 73 ms 188204 KB Output is correct
37 Correct 72 ms 188492 KB Output is correct
38 Correct 73 ms 188268 KB Output is correct
39 Correct 72 ms 188196 KB Output is correct
40 Correct 74 ms 188184 KB Output is correct
41 Correct 79 ms 188392 KB Output is correct
42 Correct 73 ms 188456 KB Output is correct
43 Correct 72 ms 188364 KB Output is correct
44 Correct 73 ms 188404 KB Output is correct
45 Correct 363 ms 193520 KB Output is correct
46 Correct 354 ms 194960 KB Output is correct
47 Correct 359 ms 192488 KB Output is correct
48 Correct 362 ms 194968 KB Output is correct
49 Correct 350 ms 192716 KB Output is correct
50 Correct 355 ms 194508 KB Output is correct
51 Correct 364 ms 194540 KB Output is correct
52 Correct 353 ms 191992 KB Output is correct
53 Correct 467 ms 191212 KB Output is correct
54 Correct 344 ms 202228 KB Output is correct
55 Correct 350 ms 196696 KB Output is correct
56 Correct 334 ms 196844 KB Output is correct
57 Correct 370 ms 191988 KB Output is correct
58 Correct 394 ms 191932 KB Output is correct
59 Correct 428 ms 191924 KB Output is correct
60 Correct 406 ms 192016 KB Output is correct
61 Correct 369 ms 191992 KB Output is correct
62 Correct 379 ms 191916 KB Output is correct
63 Correct 392 ms 191988 KB Output is correct
64 Correct 378 ms 191896 KB Output is correct
65 Correct 457 ms 202548 KB Output is correct
66 Correct 494 ms 202480 KB Output is correct
67 Correct 382 ms 197068 KB Output is correct
68 Correct 362 ms 197068 KB Output is correct
69 Correct 366 ms 196484 KB Output is correct
70 Correct 484 ms 196408 KB Output is correct
71 Correct 377 ms 202172 KB Output is correct
72 Correct 350 ms 202136 KB Output is correct
73 Correct 374 ms 198424 KB Output is correct
74 Correct 376 ms 198516 KB Output is correct
75 Correct 307 ms 198508 KB Output is correct
76 Correct 329 ms 202840 KB Output is correct
77 Correct 303 ms 202944 KB Output is correct
78 Correct 415 ms 194676 KB Output is correct
79 Correct 422 ms 193644 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 188156 KB Output is correct
2 Correct 72 ms 188144 KB Output is correct
3 Correct 68 ms 188108 KB Output is correct
4 Correct 72 ms 188144 KB Output is correct
5 Correct 69 ms 188084 KB Output is correct
6 Correct 68 ms 188136 KB Output is correct
7 Correct 71 ms 188148 KB Output is correct
8 Correct 72 ms 188184 KB Output is correct
9 Correct 69 ms 188156 KB Output is correct
10 Correct 72 ms 188164 KB Output is correct
11 Correct 73 ms 188084 KB Output is correct
12 Correct 71 ms 188084 KB Output is correct
13 Correct 68 ms 188164 KB Output is correct
14 Correct 68 ms 188092 KB Output is correct
15 Correct 72 ms 188196 KB Output is correct
16 Correct 69 ms 188148 KB Output is correct
17 Correct 69 ms 188076 KB Output is correct
18 Correct 67 ms 188188 KB Output is correct
19 Correct 70 ms 188108 KB Output is correct
20 Correct 70 ms 188176 KB Output is correct
21 Correct 68 ms 188144 KB Output is correct
22 Correct 69 ms 188164 KB Output is correct
23 Correct 69 ms 188152 KB Output is correct
24 Correct 70 ms 188096 KB Output is correct
25 Correct 72 ms 188268 KB Output is correct
26 Correct 73 ms 188288 KB Output is correct
27 Correct 72 ms 188264 KB Output is correct
28 Correct 73 ms 188284 KB Output is correct
29 Correct 71 ms 188316 KB Output is correct
30 Correct 71 ms 188368 KB Output is correct
31 Correct 74 ms 188368 KB Output is correct
32 Correct 73 ms 188364 KB Output is correct
33 Correct 73 ms 188280 KB Output is correct
34 Correct 72 ms 188252 KB Output is correct
35 Correct 72 ms 188248 KB Output is correct
36 Correct 73 ms 188204 KB Output is correct
37 Correct 72 ms 188492 KB Output is correct
38 Correct 73 ms 188268 KB Output is correct
39 Correct 72 ms 188196 KB Output is correct
40 Correct 74 ms 188184 KB Output is correct
41 Correct 79 ms 188392 KB Output is correct
42 Correct 73 ms 188456 KB Output is correct
43 Correct 72 ms 188364 KB Output is correct
44 Correct 73 ms 188404 KB Output is correct
45 Correct 363 ms 193520 KB Output is correct
46 Correct 354 ms 194960 KB Output is correct
47 Correct 359 ms 192488 KB Output is correct
48 Correct 362 ms 194968 KB Output is correct
49 Correct 350 ms 192716 KB Output is correct
50 Correct 355 ms 194508 KB Output is correct
51 Correct 364 ms 194540 KB Output is correct
52 Correct 353 ms 191992 KB Output is correct
53 Correct 467 ms 191212 KB Output is correct
54 Correct 344 ms 202228 KB Output is correct
55 Correct 350 ms 196696 KB Output is correct
56 Correct 334 ms 196844 KB Output is correct
57 Correct 370 ms 191988 KB Output is correct
58 Correct 394 ms 191932 KB Output is correct
59 Correct 428 ms 191924 KB Output is correct
60 Correct 406 ms 192016 KB Output is correct
61 Correct 369 ms 191992 KB Output is correct
62 Correct 379 ms 191916 KB Output is correct
63 Correct 392 ms 191988 KB Output is correct
64 Correct 378 ms 191896 KB Output is correct
65 Correct 457 ms 202548 KB Output is correct
66 Correct 494 ms 202480 KB Output is correct
67 Correct 382 ms 197068 KB Output is correct
68 Correct 362 ms 197068 KB Output is correct
69 Correct 366 ms 196484 KB Output is correct
70 Correct 484 ms 196408 KB Output is correct
71 Correct 377 ms 202172 KB Output is correct
72 Correct 350 ms 202136 KB Output is correct
73 Correct 374 ms 198424 KB Output is correct
74 Correct 376 ms 198516 KB Output is correct
75 Correct 307 ms 198508 KB Output is correct
76 Correct 329 ms 202840 KB Output is correct
77 Correct 303 ms 202944 KB Output is correct
78 Correct 415 ms 194676 KB Output is correct
79 Correct 422 ms 193644 KB Output is correct
80 Execution timed out 6040 ms 226156 KB Time limit exceeded
81 Halted 0 ms 0 KB -