oj.uz

Submission #833997

# Submission time Handle Problem Language Result Execution time Memory
833997 2023-08-22T10:03:27 Z LucaIlie Port Facility (JOI17_port_facility) C++17
78 / 100
 6000 ms 117792 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 >> 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 94260 KB Output is correct
2 Correct 41 ms 94176 KB Output is correct
3 Correct 38 ms 94248 KB Output is correct
4 Correct 39 ms 94192 KB Output is correct
5 Correct 37 ms 94256 KB Output is correct
6 Correct 40 ms 94164 KB Output is correct
7 Correct 35 ms 94188 KB Output is correct
8 Correct 37 ms 94200 KB Output is correct
9 Correct 36 ms 94160 KB Output is correct
10 Correct 37 ms 94188 KB Output is correct
11 Correct 35 ms 94200 KB Output is correct
12 Correct 35 ms 94208 KB Output is correct
13 Correct 35 ms 94208 KB Output is correct
14 Correct 35 ms 94228 KB Output is correct
15 Correct 38 ms 94176 KB Output is correct
16 Correct 35 ms 94268 KB Output is correct
17 Correct 40 ms 94220 KB Output is correct
18 Correct 36 ms 94164 KB Output is correct
19 Correct 36 ms 94256 KB Output is correct
20 Correct 36 ms 94224 KB Output is correct
21 Correct 36 ms 94180 KB Output is correct
22 Correct 35 ms 94208 KB Output is correct
23 Correct 35 ms 94228 KB Output is correct
24 Correct 35 ms 94224 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94260 KB Output is correct
2 Correct 41 ms 94176 KB Output is correct
3 Correct 38 ms 94248 KB Output is correct
4 Correct 39 ms 94192 KB Output is correct
5 Correct 37 ms 94256 KB Output is correct
6 Correct 40 ms 94164 KB Output is correct
7 Correct 35 ms 94188 KB Output is correct
8 Correct 37 ms 94200 KB Output is correct
9 Correct 36 ms 94160 KB Output is correct
10 Correct 37 ms 94188 KB Output is correct
11 Correct 35 ms 94200 KB Output is correct
12 Correct 35 ms 94208 KB Output is correct
13 Correct 35 ms 94208 KB Output is correct
14 Correct 35 ms 94228 KB Output is correct
15 Correct 38 ms 94176 KB Output is correct
16 Correct 35 ms 94268 KB Output is correct
17 Correct 40 ms 94220 KB Output is correct
18 Correct 36 ms 94164 KB Output is correct
19 Correct 36 ms 94256 KB Output is correct
20 Correct 36 ms 94224 KB Output is correct
21 Correct 36 ms 94180 KB Output is correct
22 Correct 35 ms 94208 KB Output is correct
23 Correct 35 ms 94228 KB Output is correct
24 Correct 35 ms 94224 KB Output is correct
25 Correct 39 ms 94396 KB Output is correct
26 Correct 44 ms 94304 KB Output is correct
27 Correct 38 ms 94292 KB Output is correct
28 Correct 37 ms 94324 KB Output is correct
29 Correct 41 ms 94288 KB Output is correct
30 Correct 39 ms 94404 KB Output is correct
31 Correct 39 ms 94448 KB Output is correct
32 Correct 40 ms 94356 KB Output is correct
33 Correct 38 ms 94292 KB Output is correct
34 Correct 38 ms 94428 KB Output is correct
35 Correct 38 ms 94244 KB Output is correct
36 Correct 39 ms 94268 KB Output is correct
37 Correct 47 ms 94440 KB Output is correct
38 Correct 39 ms 94344 KB Output is correct
39 Correct 39 ms 94228 KB Output is correct
40 Correct 37 ms 94268 KB Output is correct
41 Correct 39 ms 94416 KB Output is correct
42 Correct 38 ms 94464 KB Output is correct
43 Correct 38 ms 94408 KB Output is correct
44 Correct 38 ms 94460 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94260 KB Output is correct
2 Correct 41 ms 94176 KB Output is correct
3 Correct 38 ms 94248 KB Output is correct
4 Correct 39 ms 94192 KB Output is correct
5 Correct 37 ms 94256 KB Output is correct
6 Correct 40 ms 94164 KB Output is correct
7 Correct 35 ms 94188 KB Output is correct
8 Correct 37 ms 94200 KB Output is correct
9 Correct 36 ms 94160 KB Output is correct
10 Correct 37 ms 94188 KB Output is correct
11 Correct 35 ms 94200 KB Output is correct
12 Correct 35 ms 94208 KB Output is correct
13 Correct 35 ms 94208 KB Output is correct
14 Correct 35 ms 94228 KB Output is correct
15 Correct 38 ms 94176 KB Output is correct
16 Correct 35 ms 94268 KB Output is correct
17 Correct 40 ms 94220 KB Output is correct
18 Correct 36 ms 94164 KB Output is correct
19 Correct 36 ms 94256 KB Output is correct
20 Correct 36 ms 94224 KB Output is correct
21 Correct 36 ms 94180 KB Output is correct
22 Correct 35 ms 94208 KB Output is correct
23 Correct 35 ms 94228 KB Output is correct
24 Correct 35 ms 94224 KB Output is correct
25 Correct 39 ms 94396 KB Output is correct
26 Correct 44 ms 94304 KB Output is correct
27 Correct 38 ms 94292 KB Output is correct
28 Correct 37 ms 94324 KB Output is correct
29 Correct 41 ms 94288 KB Output is correct
30 Correct 39 ms 94404 KB Output is correct
31 Correct 39 ms 94448 KB Output is correct
32 Correct 40 ms 94356 KB Output is correct
33 Correct 38 ms 94292 KB Output is correct
34 Correct 38 ms 94428 KB Output is correct
35 Correct 38 ms 94244 KB Output is correct
36 Correct 39 ms 94268 KB Output is correct
37 Correct 47 ms 94440 KB Output is correct
38 Correct 39 ms 94344 KB Output is correct
39 Correct 39 ms 94228 KB Output is correct
40 Correct 37 ms 94268 KB Output is correct
41 Correct 39 ms 94416 KB Output is correct
42 Correct 38 ms 94464 KB Output is correct
43 Correct 38 ms 94408 KB Output is correct
44 Correct 38 ms 94460 KB Output is correct
45 Correct 268 ms 98376 KB Output is correct
46 Correct 263 ms 99800 KB Output is correct
47 Correct 263 ms 97304 KB Output is correct
48 Correct 282 ms 99820 KB Output is correct
49 Correct 259 ms 97480 KB Output is correct
50 Correct 264 ms 99376 KB Output is correct
51 Correct 260 ms 99220 KB Output is correct
52 Correct 263 ms 96720 KB Output is correct
53 Correct 373 ms 95984 KB Output is correct
54 Correct 242 ms 106956 KB Output is correct
55 Correct 230 ms 101504 KB Output is correct
56 Correct 241 ms 101496 KB Output is correct
57 Correct 263 ms 96792 KB Output is correct
58 Correct 329 ms 96912 KB Output is correct
59 Correct 307 ms 96792 KB Output is correct
60 Correct 302 ms 96796 KB Output is correct
61 Correct 294 ms 96796 KB Output is correct
62 Correct 267 ms 96696 KB Output is correct
63 Correct 281 ms 96760 KB Output is correct
64 Correct 306 ms 96796 KB Output is correct
65 Correct 334 ms 107312 KB Output is correct
66 Correct 298 ms 107404 KB Output is correct
67 Correct 259 ms 101796 KB Output is correct
68 Correct 250 ms 101876 KB Output is correct
69 Correct 258 ms 101220 KB Output is correct
70 Correct 252 ms 101188 KB Output is correct
71 Correct 255 ms 106968 KB Output is correct
72 Correct 259 ms 106880 KB Output is correct
73 Correct 257 ms 103280 KB Output is correct
74 Correct 262 ms 103272 KB Output is correct
75 Correct 215 ms 103288 KB Output is correct
76 Correct 215 ms 107844 KB Output is correct
77 Correct 226 ms 107676 KB Output is correct
78 Correct 264 ms 99444 KB Output is correct
79 Correct 262 ms 98352 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94260 KB Output is correct
2 Correct 41 ms 94176 KB Output is correct
3 Correct 38 ms 94248 KB Output is correct
4 Correct 39 ms 94192 KB Output is correct
5 Correct 37 ms 94256 KB Output is correct
6 Correct 40 ms 94164 KB Output is correct
7 Correct 35 ms 94188 KB Output is correct
8 Correct 37 ms 94200 KB Output is correct
9 Correct 36 ms 94160 KB Output is correct
10 Correct 37 ms 94188 KB Output is correct
11 Correct 35 ms 94200 KB Output is correct
12 Correct 35 ms 94208 KB Output is correct
13 Correct 35 ms 94208 KB Output is correct
14 Correct 35 ms 94228 KB Output is correct
15 Correct 38 ms 94176 KB Output is correct
16 Correct 35 ms 94268 KB Output is correct
17 Correct 40 ms 94220 KB Output is correct
18 Correct 36 ms 94164 KB Output is correct
19 Correct 36 ms 94256 KB Output is correct
20 Correct 36 ms 94224 KB Output is correct
21 Correct 36 ms 94180 KB Output is correct
22 Correct 35 ms 94208 KB Output is correct
23 Correct 35 ms 94228 KB Output is correct
24 Correct 35 ms 94224 KB Output is correct
25 Correct 39 ms 94396 KB Output is correct
26 Correct 44 ms 94304 KB Output is correct
27 Correct 38 ms 94292 KB Output is correct
28 Correct 37 ms 94324 KB Output is correct
29 Correct 41 ms 94288 KB Output is correct
30 Correct 39 ms 94404 KB Output is correct
31 Correct 39 ms 94448 KB Output is correct
32 Correct 40 ms 94356 KB Output is correct
33 Correct 38 ms 94292 KB Output is correct
34 Correct 38 ms 94428 KB Output is correct
35 Correct 38 ms 94244 KB Output is correct
36 Correct 39 ms 94268 KB Output is correct
37 Correct 47 ms 94440 KB Output is correct
38 Correct 39 ms 94344 KB Output is correct
39 Correct 39 ms 94228 KB Output is correct
40 Correct 37 ms 94268 KB Output is correct
41 Correct 39 ms 94416 KB Output is correct
42 Correct 38 ms 94464 KB Output is correct
43 Correct 38 ms 94408 KB Output is correct
44 Correct 38 ms 94460 KB Output is correct
45 Correct 268 ms 98376 KB Output is correct
46 Correct 263 ms 99800 KB Output is correct
47 Correct 263 ms 97304 KB Output is correct
48 Correct 282 ms 99820 KB Output is correct
49 Correct 259 ms 97480 KB Output is correct
50 Correct 264 ms 99376 KB Output is correct
51 Correct 260 ms 99220 KB Output is correct
52 Correct 263 ms 96720 KB Output is correct
53 Correct 373 ms 95984 KB Output is correct
54 Correct 242 ms 106956 KB Output is correct
55 Correct 230 ms 101504 KB Output is correct
56 Correct 241 ms 101496 KB Output is correct
57 Correct 263 ms 96792 KB Output is correct
58 Correct 329 ms 96912 KB Output is correct
59 Correct 307 ms 96792 KB Output is correct
60 Correct 302 ms 96796 KB Output is correct
61 Correct 294 ms 96796 KB Output is correct
62 Correct 267 ms 96696 KB Output is correct
63 Correct 281 ms 96760 KB Output is correct
64 Correct 306 ms 96796 KB Output is correct
65 Correct 334 ms 107312 KB Output is correct
66 Correct 298 ms 107404 KB Output is correct
67 Correct 259 ms 101796 KB Output is correct
68 Correct 250 ms 101876 KB Output is correct
69 Correct 258 ms 101220 KB Output is correct
70 Correct 252 ms 101188 KB Output is correct
71 Correct 255 ms 106968 KB Output is correct
72 Correct 259 ms 106880 KB Output is correct
73 Correct 257 ms 103280 KB Output is correct
74 Correct 262 ms 103272 KB Output is correct
75 Correct 215 ms 103288 KB Output is correct
76 Correct 215 ms 107844 KB Output is correct
77 Correct 226 ms 107676 KB Output is correct
78 Correct 264 ms 99444 KB Output is correct
79 Correct 262 ms 98352 KB Output is correct
80 Execution timed out 6020 ms 117792 KB Time limit exceeded
81 Halted 0 ms 0 KB -