oj.uz

Submission #834073

# Submission time Handle Problem Language Result Execution time Memory
834073 2023-08-22T10:34:03 Z LucaIlie Port Facility (JOI17_port_facility) C++17
78 / 100
 2564 ms 1048576 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e6 + 5;
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], p[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 ll[MAX_N], rr[MAX_N];

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], p[i] = i;
    sort( p, p + n, []( int i, int j ) {
        return l[i] < l[j];
    } );
    for ( int i = 0; i < n; i++ )
        ll[i] = l[p[i]], rr[i] = r[p[i]];
    for ( int i = 0; i < n; i++ )
        l[i] = ll[i], r[i] = rr[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;
    visitedByR.init();
    for ( int i = 0; i < n; i++ ) {
        if ( side[i] == 1 )
            continue;
        if ( -visitedByR.query( 0, 1, 2 * n, l[i], r[i] ) < l[i] )
            bipartit = false;
        visitedByR.update( 0, 1, 2 * n, r[i], -l[i] );
    }
    visitedByR.init();
    for ( int i = 0; i < n; i++ ) {
        if ( side[i] == 0 )
            continue;
        if ( -visitedByR.query( 0, 1, 2 * n, l[i], r[i] ) < l[i] )
            bipartit = false;
        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 23 ms 47308 KB Output is correct
2 Correct 22 ms 47256 KB Output is correct
3 Correct 23 ms 47260 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47316 KB Output is correct
7 Correct 25 ms 47368 KB Output is correct
8 Correct 24 ms 47288 KB Output is correct
9 Correct 23 ms 47248 KB Output is correct
10 Correct 22 ms 47308 KB Output is correct
11 Correct 21 ms 47244 KB Output is correct
12 Correct 22 ms 47296 KB Output is correct
13 Correct 24 ms 47348 KB Output is correct
14 Correct 25 ms 47272 KB Output is correct
15 Correct 22 ms 47276 KB Output is correct
16 Correct 23 ms 47372 KB Output is correct
17 Correct 22 ms 47316 KB Output is correct
18 Correct 22 ms 47368 KB Output is correct
19 Correct 21 ms 47364 KB Output is correct
20 Correct 24 ms 47372 KB Output is correct
21 Correct 21 ms 47364 KB Output is correct
22 Correct 22 ms 47316 KB Output is correct
23 Correct 22 ms 47252 KB Output is correct
24 Correct 22 ms 47356 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47308 KB Output is correct
2 Correct 22 ms 47256 KB Output is correct
3 Correct 23 ms 47260 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47316 KB Output is correct
7 Correct 25 ms 47368 KB Output is correct
8 Correct 24 ms 47288 KB Output is correct
9 Correct 23 ms 47248 KB Output is correct
10 Correct 22 ms 47308 KB Output is correct
11 Correct 21 ms 47244 KB Output is correct
12 Correct 22 ms 47296 KB Output is correct
13 Correct 24 ms 47348 KB Output is correct
14 Correct 25 ms 47272 KB Output is correct
15 Correct 22 ms 47276 KB Output is correct
16 Correct 23 ms 47372 KB Output is correct
17 Correct 22 ms 47316 KB Output is correct
18 Correct 22 ms 47368 KB Output is correct
19 Correct 21 ms 47364 KB Output is correct
20 Correct 24 ms 47372 KB Output is correct
21 Correct 21 ms 47364 KB Output is correct
22 Correct 22 ms 47316 KB Output is correct
23 Correct 22 ms 47252 KB Output is correct
24 Correct 22 ms 47356 KB Output is correct
25 Correct 25 ms 47444 KB Output is correct
26 Correct 26 ms 47552 KB Output is correct
27 Correct 24 ms 47392 KB Output is correct
28 Correct 23 ms 47448 KB Output is correct
29 Correct 25 ms 47516 KB Output is correct
30 Correct 24 ms 47448 KB Output is correct
31 Correct 25 ms 47532 KB Output is correct
32 Correct 25 ms 47444 KB Output is correct
33 Correct 24 ms 47444 KB Output is correct
34 Correct 27 ms 47548 KB Output is correct
35 Correct 23 ms 47372 KB Output is correct
36 Correct 31 ms 47360 KB Output is correct
37 Correct 24 ms 47564 KB Output is correct
38 Correct 24 ms 47464 KB Output is correct
39 Correct 23 ms 47424 KB Output is correct
40 Correct 29 ms 47360 KB Output is correct
41 Correct 25 ms 47548 KB Output is correct
42 Correct 24 ms 47512 KB Output is correct
43 Correct 25 ms 47564 KB Output is correct
44 Correct 24 ms 47572 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47308 KB Output is correct
2 Correct 22 ms 47256 KB Output is correct
3 Correct 23 ms 47260 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47316 KB Output is correct
7 Correct 25 ms 47368 KB Output is correct
8 Correct 24 ms 47288 KB Output is correct
9 Correct 23 ms 47248 KB Output is correct
10 Correct 22 ms 47308 KB Output is correct
11 Correct 21 ms 47244 KB Output is correct
12 Correct 22 ms 47296 KB Output is correct
13 Correct 24 ms 47348 KB Output is correct
14 Correct 25 ms 47272 KB Output is correct
15 Correct 22 ms 47276 KB Output is correct
16 Correct 23 ms 47372 KB Output is correct
17 Correct 22 ms 47316 KB Output is correct
18 Correct 22 ms 47368 KB Output is correct
19 Correct 21 ms 47364 KB Output is correct
20 Correct 24 ms 47372 KB Output is correct
21 Correct 21 ms 47364 KB Output is correct
22 Correct 22 ms 47316 KB Output is correct
23 Correct 22 ms 47252 KB Output is correct
24 Correct 22 ms 47356 KB Output is correct
25 Correct 25 ms 47444 KB Output is correct
26 Correct 26 ms 47552 KB Output is correct
27 Correct 24 ms 47392 KB Output is correct
28 Correct 23 ms 47448 KB Output is correct
29 Correct 25 ms 47516 KB Output is correct
30 Correct 24 ms 47448 KB Output is correct
31 Correct 25 ms 47532 KB Output is correct
32 Correct 25 ms 47444 KB Output is correct
33 Correct 24 ms 47444 KB Output is correct
34 Correct 27 ms 47548 KB Output is correct
35 Correct 23 ms 47372 KB Output is correct
36 Correct 31 ms 47360 KB Output is correct
37 Correct 24 ms 47564 KB Output is correct
38 Correct 24 ms 47464 KB Output is correct
39 Correct 23 ms 47424 KB Output is correct
40 Correct 29 ms 47360 KB Output is correct
41 Correct 25 ms 47548 KB Output is correct
42 Correct 24 ms 47512 KB Output is correct
43 Correct 25 ms 47564 KB Output is correct
44 Correct 24 ms 47572 KB Output is correct
45 Correct 149 ms 52612 KB Output is correct
46 Correct 152 ms 53880 KB Output is correct
47 Correct 154 ms 51892 KB Output is correct
48 Correct 151 ms 53836 KB Output is correct
49 Correct 152 ms 51888 KB Output is correct
50 Correct 151 ms 53568 KB Output is correct
51 Correct 157 ms 53604 KB Output is correct
52 Correct 117 ms 51232 KB Output is correct
53 Correct 135 ms 50544 KB Output is correct
54 Correct 159 ms 59884 KB Output is correct
55 Correct 153 ms 55228 KB Output is correct
56 Correct 162 ms 55372 KB Output is correct
57 Correct 124 ms 51276 KB Output is correct
58 Correct 118 ms 51328 KB Output is correct
59 Correct 134 ms 51384 KB Output is correct
60 Correct 145 ms 51260 KB Output is correct
61 Correct 144 ms 51332 KB Output is correct
62 Correct 134 ms 51260 KB Output is correct
63 Correct 144 ms 51276 KB Output is correct
64 Correct 143 ms 51236 KB Output is correct
65 Correct 206 ms 60336 KB Output is correct
66 Correct 210 ms 60336 KB Output is correct
67 Correct 158 ms 55652 KB Output is correct
68 Correct 157 ms 55628 KB Output is correct
69 Correct 154 ms 55060 KB Output is correct
70 Correct 155 ms 55104 KB Output is correct
71 Correct 156 ms 59856 KB Output is correct
72 Correct 162 ms 59876 KB Output is correct
73 Correct 153 ms 56700 KB Output is correct
74 Correct 156 ms 56912 KB Output is correct
75 Correct 135 ms 60716 KB Output is correct
76 Correct 130 ms 60612 KB Output is correct
77 Correct 130 ms 60684 KB Output is correct
78 Correct 162 ms 53588 KB Output is correct
79 Correct 172 ms 52744 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47308 KB Output is correct
2 Correct 22 ms 47256 KB Output is correct
3 Correct 23 ms 47260 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47316 KB Output is correct
7 Correct 25 ms 47368 KB Output is correct
8 Correct 24 ms 47288 KB Output is correct
9 Correct 23 ms 47248 KB Output is correct
10 Correct 22 ms 47308 KB Output is correct
11 Correct 21 ms 47244 KB Output is correct
12 Correct 22 ms 47296 KB Output is correct
13 Correct 24 ms 47348 KB Output is correct
14 Correct 25 ms 47272 KB Output is correct
15 Correct 22 ms 47276 KB Output is correct
16 Correct 23 ms 47372 KB Output is correct
17 Correct 22 ms 47316 KB Output is correct
18 Correct 22 ms 47368 KB Output is correct
19 Correct 21 ms 47364 KB Output is correct
20 Correct 24 ms 47372 KB Output is correct
21 Correct 21 ms 47364 KB Output is correct
22 Correct 22 ms 47316 KB Output is correct
23 Correct 22 ms 47252 KB Output is correct
24 Correct 22 ms 47356 KB Output is correct
25 Correct 25 ms 47444 KB Output is correct
26 Correct 26 ms 47552 KB Output is correct
27 Correct 24 ms 47392 KB Output is correct
28 Correct 23 ms 47448 KB Output is correct
29 Correct 25 ms 47516 KB Output is correct
30 Correct 24 ms 47448 KB Output is correct
31 Correct 25 ms 47532 KB Output is correct
32 Correct 25 ms 47444 KB Output is correct
33 Correct 24 ms 47444 KB Output is correct
34 Correct 27 ms 47548 KB Output is correct
35 Correct 23 ms 47372 KB Output is correct
36 Correct 31 ms 47360 KB Output is correct
37 Correct 24 ms 47564 KB Output is correct
38 Correct 24 ms 47464 KB Output is correct
39 Correct 23 ms 47424 KB Output is correct
40 Correct 29 ms 47360 KB Output is correct
41 Correct 25 ms 47548 KB Output is correct
42 Correct 24 ms 47512 KB Output is correct
43 Correct 25 ms 47564 KB Output is correct
44 Correct 24 ms 47572 KB Output is correct
45 Correct 149 ms 52612 KB Output is correct
46 Correct 152 ms 53880 KB Output is correct
47 Correct 154 ms 51892 KB Output is correct
48 Correct 151 ms 53836 KB Output is correct
49 Correct 152 ms 51888 KB Output is correct
50 Correct 151 ms 53568 KB Output is correct
51 Correct 157 ms 53604 KB Output is correct
52 Correct 117 ms 51232 KB Output is correct
53 Correct 135 ms 50544 KB Output is correct
54 Correct 159 ms 59884 KB Output is correct
55 Correct 153 ms 55228 KB Output is correct
56 Correct 162 ms 55372 KB Output is correct
57 Correct 124 ms 51276 KB Output is correct
58 Correct 118 ms 51328 KB Output is correct
59 Correct 134 ms 51384 KB Output is correct
60 Correct 145 ms 51260 KB Output is correct
61 Correct 144 ms 51332 KB Output is correct
62 Correct 134 ms 51260 KB Output is correct
63 Correct 144 ms 51276 KB Output is correct
64 Correct 143 ms 51236 KB Output is correct
65 Correct 206 ms 60336 KB Output is correct
66 Correct 210 ms 60336 KB Output is correct
67 Correct 158 ms 55652 KB Output is correct
68 Correct 157 ms 55628 KB Output is correct
69 Correct 154 ms 55060 KB Output is correct
70 Correct 155 ms 55104 KB Output is correct
71 Correct 156 ms 59856 KB Output is correct
72 Correct 162 ms 59876 KB Output is correct
73 Correct 153 ms 56700 KB Output is correct
74 Correct 156 ms 56912 KB Output is correct
75 Correct 135 ms 60716 KB Output is correct
76 Correct 130 ms 60612 KB Output is correct
77 Correct 130 ms 60684 KB Output is correct
78 Correct 162 ms 53588 KB Output is correct
79 Correct 172 ms 52744 KB Output is correct
80 Runtime error 2564 ms 1048576 KB Execution killed with signal 9
81 Halted 0 ms 0 KB -