답안 #834071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834071	2023-08-22T10:32:36 Z	LucaIlie	Port Facility (JOI17_port_facility)	C++17	78 / 100	2648 ms	1048576 KB

port_facility

#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], 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

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	47316 KB	Output is correct
2	Correct	27 ms	47316 KB	Output is correct
3	Correct	19 ms	47316 KB	Output is correct
4	Correct	21 ms	47316 KB	Output is correct
5	Correct	19 ms	47316 KB	Output is correct
6	Correct	19 ms	47316 KB	Output is correct
7	Correct	19 ms	47316 KB	Output is correct
8	Correct	19 ms	47316 KB	Output is correct
9	Correct	22 ms	47228 KB	Output is correct
10	Correct	23 ms	47316 KB	Output is correct
11	Correct	19 ms	47316 KB	Output is correct
12	Correct	19 ms	47316 KB	Output is correct
13	Correct	19 ms	47316 KB	Output is correct
14	Correct	19 ms	47316 KB	Output is correct
15	Correct	20 ms	47316 KB	Output is correct
16	Correct	20 ms	47312 KB	Output is correct
17	Correct	28 ms	47292 KB	Output is correct
18	Correct	23 ms	47248 KB	Output is correct
19	Correct	23 ms	47316 KB	Output is correct
20	Correct	21 ms	47316 KB	Output is correct
21	Correct	28 ms	47324 KB	Output is correct
22	Correct	26 ms	47316 KB	Output is correct
23	Correct	21 ms	47248 KB	Output is correct
24	Correct	23 ms	47308 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	47316 KB	Output is correct
2	Correct	27 ms	47316 KB	Output is correct
3	Correct	19 ms	47316 KB	Output is correct
4	Correct	21 ms	47316 KB	Output is correct
5	Correct	19 ms	47316 KB	Output is correct
6	Correct	19 ms	47316 KB	Output is correct
7	Correct	19 ms	47316 KB	Output is correct
8	Correct	19 ms	47316 KB	Output is correct
9	Correct	22 ms	47228 KB	Output is correct
10	Correct	23 ms	47316 KB	Output is correct
11	Correct	19 ms	47316 KB	Output is correct
12	Correct	19 ms	47316 KB	Output is correct
13	Correct	19 ms	47316 KB	Output is correct
14	Correct	19 ms	47316 KB	Output is correct
15	Correct	20 ms	47316 KB	Output is correct
16	Correct	20 ms	47312 KB	Output is correct
17	Correct	28 ms	47292 KB	Output is correct
18	Correct	23 ms	47248 KB	Output is correct
19	Correct	23 ms	47316 KB	Output is correct
20	Correct	21 ms	47316 KB	Output is correct
21	Correct	28 ms	47324 KB	Output is correct
22	Correct	26 ms	47316 KB	Output is correct
23	Correct	21 ms	47248 KB	Output is correct
24	Correct	23 ms	47308 KB	Output is correct
25	Correct	30 ms	47444 KB	Output is correct
26	Correct	22 ms	47444 KB	Output is correct
27	Correct	22 ms	47444 KB	Output is correct
28	Correct	22 ms	47444 KB	Output is correct
29	Correct	31 ms	47444 KB	Output is correct
30	Correct	22 ms	47444 KB	Output is correct
31	Correct	27 ms	47444 KB	Output is correct
32	Correct	27 ms	47444 KB	Output is correct
33	Correct	24 ms	47440 KB	Output is correct
34	Correct	24 ms	47520 KB	Output is correct
35	Correct	22 ms	47444 KB	Output is correct
36	Correct	23 ms	47316 KB	Output is correct
37	Correct	23 ms	47604 KB	Output is correct
38	Correct	22 ms	47428 KB	Output is correct
39	Correct	22 ms	47444 KB	Output is correct
40	Correct	28 ms	47308 KB	Output is correct
41	Correct	27 ms	47572 KB	Output is correct
42	Correct	25 ms	47616 KB	Output is correct
43	Correct	27 ms	47572 KB	Output is correct
44	Correct	29 ms	47512 KB	Output is correct

Subtask #3
56.0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	47316 KB	Output is correct
2	Correct	27 ms	47316 KB	Output is correct
3	Correct	19 ms	47316 KB	Output is correct
4	Correct	21 ms	47316 KB	Output is correct
5	Correct	19 ms	47316 KB	Output is correct
6	Correct	19 ms	47316 KB	Output is correct
7	Correct	19 ms	47316 KB	Output is correct
8	Correct	19 ms	47316 KB	Output is correct
9	Correct	22 ms	47228 KB	Output is correct
10	Correct	23 ms	47316 KB	Output is correct
11	Correct	19 ms	47316 KB	Output is correct
12	Correct	19 ms	47316 KB	Output is correct
13	Correct	19 ms	47316 KB	Output is correct
14	Correct	19 ms	47316 KB	Output is correct
15	Correct	20 ms	47316 KB	Output is correct
16	Correct	20 ms	47312 KB	Output is correct
17	Correct	28 ms	47292 KB	Output is correct
18	Correct	23 ms	47248 KB	Output is correct
19	Correct	23 ms	47316 KB	Output is correct
20	Correct	21 ms	47316 KB	Output is correct
21	Correct	28 ms	47324 KB	Output is correct
22	Correct	26 ms	47316 KB	Output is correct
23	Correct	21 ms	47248 KB	Output is correct
24	Correct	23 ms	47308 KB	Output is correct
25	Correct	30 ms	47444 KB	Output is correct
26	Correct	22 ms	47444 KB	Output is correct
27	Correct	22 ms	47444 KB	Output is correct
28	Correct	22 ms	47444 KB	Output is correct
29	Correct	31 ms	47444 KB	Output is correct
30	Correct	22 ms	47444 KB	Output is correct
31	Correct	27 ms	47444 KB	Output is correct
32	Correct	27 ms	47444 KB	Output is correct
33	Correct	24 ms	47440 KB	Output is correct
34	Correct	24 ms	47520 KB	Output is correct
35	Correct	22 ms	47444 KB	Output is correct
36	Correct	23 ms	47316 KB	Output is correct
37	Correct	23 ms	47604 KB	Output is correct
38	Correct	22 ms	47428 KB	Output is correct
39	Correct	22 ms	47444 KB	Output is correct
40	Correct	28 ms	47308 KB	Output is correct
41	Correct	27 ms	47572 KB	Output is correct
42	Correct	25 ms	47616 KB	Output is correct
43	Correct	27 ms	47572 KB	Output is correct
44	Correct	29 ms	47512 KB	Output is correct
45	Correct	158 ms	52276 KB	Output is correct
46	Correct	159 ms	53620 KB	Output is correct
47	Correct	152 ms	51524 KB	Output is correct
48	Correct	150 ms	53528 KB	Output is correct
49	Correct	173 ms	51660 KB	Output is correct
50	Correct	161 ms	53204 KB	Output is correct
51	Correct	206 ms	53252 KB	Output is correct
52	Correct	112 ms	51072 KB	Output is correct
53	Correct	132 ms	50296 KB	Output is correct
54	Correct	163 ms	59600 KB	Output is correct
55	Correct	157 ms	55000 KB	Output is correct
56	Correct	161 ms	54900 KB	Output is correct
57	Correct	134 ms	50960 KB	Output is correct
58	Correct	116 ms	50988 KB	Output is correct
59	Correct	127 ms	51024 KB	Output is correct
60	Correct	136 ms	50996 KB	Output is correct
61	Correct	146 ms	51104 KB	Output is correct
62	Correct	131 ms	50964 KB	Output is correct
63	Correct	147 ms	51020 KB	Output is correct
64	Correct	142 ms	51020 KB	Output is correct
65	Correct	210 ms	59980 KB	Output is correct
66	Correct	207 ms	59980 KB	Output is correct
67	Correct	157 ms	55280 KB	Output is correct
68	Correct	156 ms	55456 KB	Output is correct
69	Correct	172 ms	54796 KB	Output is correct
70	Correct	151 ms	54812 KB	Output is correct
71	Correct	156 ms	59636 KB	Output is correct
72	Correct	152 ms	59640 KB	Output is correct
73	Correct	149 ms	56508 KB	Output is correct
74	Correct	153 ms	56648 KB	Output is correct
75	Correct	132 ms	60412 KB	Output is correct
76	Correct	129 ms	60400 KB	Output is correct
77	Correct	130 ms	60424 KB	Output is correct
78	Correct	150 ms	53368 KB	Output is correct
79	Correct	162 ms	52536 KB	Output is correct

Subtask #4
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	47316 KB	Output is correct
2	Correct	27 ms	47316 KB	Output is correct
3	Correct	19 ms	47316 KB	Output is correct
4	Correct	21 ms	47316 KB	Output is correct
5	Correct	19 ms	47316 KB	Output is correct
6	Correct	19 ms	47316 KB	Output is correct
7	Correct	19 ms	47316 KB	Output is correct
8	Correct	19 ms	47316 KB	Output is correct
9	Correct	22 ms	47228 KB	Output is correct
10	Correct	23 ms	47316 KB	Output is correct
11	Correct	19 ms	47316 KB	Output is correct
12	Correct	19 ms	47316 KB	Output is correct
13	Correct	19 ms	47316 KB	Output is correct
14	Correct	19 ms	47316 KB	Output is correct
15	Correct	20 ms	47316 KB	Output is correct
16	Correct	20 ms	47312 KB	Output is correct
17	Correct	28 ms	47292 KB	Output is correct
18	Correct	23 ms	47248 KB	Output is correct
19	Correct	23 ms	47316 KB	Output is correct
20	Correct	21 ms	47316 KB	Output is correct
21	Correct	28 ms	47324 KB	Output is correct
22	Correct	26 ms	47316 KB	Output is correct
23	Correct	21 ms	47248 KB	Output is correct
24	Correct	23 ms	47308 KB	Output is correct
25	Correct	30 ms	47444 KB	Output is correct
26	Correct	22 ms	47444 KB	Output is correct
27	Correct	22 ms	47444 KB	Output is correct
28	Correct	22 ms	47444 KB	Output is correct
29	Correct	31 ms	47444 KB	Output is correct
30	Correct	22 ms	47444 KB	Output is correct
31	Correct	27 ms	47444 KB	Output is correct
32	Correct	27 ms	47444 KB	Output is correct
33	Correct	24 ms	47440 KB	Output is correct
34	Correct	24 ms	47520 KB	Output is correct
35	Correct	22 ms	47444 KB	Output is correct
36	Correct	23 ms	47316 KB	Output is correct
37	Correct	23 ms	47604 KB	Output is correct
38	Correct	22 ms	47428 KB	Output is correct
39	Correct	22 ms	47444 KB	Output is correct
40	Correct	28 ms	47308 KB	Output is correct
41	Correct	27 ms	47572 KB	Output is correct
42	Correct	25 ms	47616 KB	Output is correct
43	Correct	27 ms	47572 KB	Output is correct
44	Correct	29 ms	47512 KB	Output is correct
45	Correct	158 ms	52276 KB	Output is correct
46	Correct	159 ms	53620 KB	Output is correct
47	Correct	152 ms	51524 KB	Output is correct
48	Correct	150 ms	53528 KB	Output is correct
49	Correct	173 ms	51660 KB	Output is correct
50	Correct	161 ms	53204 KB	Output is correct
51	Correct	206 ms	53252 KB	Output is correct
52	Correct	112 ms	51072 KB	Output is correct
53	Correct	132 ms	50296 KB	Output is correct
54	Correct	163 ms	59600 KB	Output is correct
55	Correct	157 ms	55000 KB	Output is correct
56	Correct	161 ms	54900 KB	Output is correct
57	Correct	134 ms	50960 KB	Output is correct
58	Correct	116 ms	50988 KB	Output is correct
59	Correct	127 ms	51024 KB	Output is correct
60	Correct	136 ms	50996 KB	Output is correct
61	Correct	146 ms	51104 KB	Output is correct
62	Correct	131 ms	50964 KB	Output is correct
63	Correct	147 ms	51020 KB	Output is correct
64	Correct	142 ms	51020 KB	Output is correct
65	Correct	210 ms	59980 KB	Output is correct
66	Correct	207 ms	59980 KB	Output is correct
67	Correct	157 ms	55280 KB	Output is correct
68	Correct	156 ms	55456 KB	Output is correct
69	Correct	172 ms	54796 KB	Output is correct
70	Correct	151 ms	54812 KB	Output is correct
71	Correct	156 ms	59636 KB	Output is correct
72	Correct	152 ms	59640 KB	Output is correct
73	Correct	149 ms	56508 KB	Output is correct
74	Correct	153 ms	56648 KB	Output is correct
75	Correct	132 ms	60412 KB	Output is correct
76	Correct	129 ms	60400 KB	Output is correct
77	Correct	130 ms	60424 KB	Output is correct
78	Correct	150 ms	53368 KB	Output is correct
79	Correct	162 ms	52536 KB	Output is correct
80	Runtime error	2648 ms	1048576 KB	Execution killed with signal 9
81	Halted	0 ms	0 KB	-

답안 #834071

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 56.0 / 56.0

Subtask #4 0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
56.0 / 56.0

Subtask #4
0 / 22.0