답안 #834012

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834012	2023-08-22T10:09:11 Z	LucaIlie	Port Facility (JOI17_port_facility)	C++17	78 / 100	6000 ms	117712 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 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] );
    }

    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] );
    }

    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

#	결과	실행 시간	메모리	Grader output
1	Correct	48 ms	94248 KB	Output is correct
2	Correct	34 ms	94232 KB	Output is correct
3	Correct	40 ms	94328 KB	Output is correct
4	Correct	34 ms	94204 KB	Output is correct
5	Correct	34 ms	94200 KB	Output is correct
6	Correct	35 ms	94156 KB	Output is correct
7	Correct	34 ms	94176 KB	Output is correct
8	Correct	34 ms	94176 KB	Output is correct
9	Correct	34 ms	94248 KB	Output is correct
10	Correct	36 ms	94196 KB	Output is correct
11	Correct	39 ms	94184 KB	Output is correct
12	Correct	35 ms	94180 KB	Output is correct
13	Correct	35 ms	94172 KB	Output is correct
14	Correct	37 ms	94276 KB	Output is correct
15	Correct	35 ms	94224 KB	Output is correct
16	Correct	36 ms	94272 KB	Output is correct
17	Correct	34 ms	94156 KB	Output is correct
18	Correct	32 ms	94208 KB	Output is correct
19	Correct	34 ms	94236 KB	Output is correct
20	Correct	33 ms	94272 KB	Output is correct
21	Correct	39 ms	94260 KB	Output is correct
22	Correct	38 ms	94144 KB	Output is correct
23	Correct	49 ms	94244 KB	Output is correct
24	Correct	37 ms	94260 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	48 ms	94248 KB	Output is correct
2	Correct	34 ms	94232 KB	Output is correct
3	Correct	40 ms	94328 KB	Output is correct
4	Correct	34 ms	94204 KB	Output is correct
5	Correct	34 ms	94200 KB	Output is correct
6	Correct	35 ms	94156 KB	Output is correct
7	Correct	34 ms	94176 KB	Output is correct
8	Correct	34 ms	94176 KB	Output is correct
9	Correct	34 ms	94248 KB	Output is correct
10	Correct	36 ms	94196 KB	Output is correct
11	Correct	39 ms	94184 KB	Output is correct
12	Correct	35 ms	94180 KB	Output is correct
13	Correct	35 ms	94172 KB	Output is correct
14	Correct	37 ms	94276 KB	Output is correct
15	Correct	35 ms	94224 KB	Output is correct
16	Correct	36 ms	94272 KB	Output is correct
17	Correct	34 ms	94156 KB	Output is correct
18	Correct	32 ms	94208 KB	Output is correct
19	Correct	34 ms	94236 KB	Output is correct
20	Correct	33 ms	94272 KB	Output is correct
21	Correct	39 ms	94260 KB	Output is correct
22	Correct	38 ms	94144 KB	Output is correct
23	Correct	49 ms	94244 KB	Output is correct
24	Correct	37 ms	94260 KB	Output is correct
25	Correct	49 ms	94408 KB	Output is correct
26	Correct	40 ms	94336 KB	Output is correct
27	Correct	43 ms	94368 KB	Output is correct
28	Correct	43 ms	94384 KB	Output is correct
29	Correct	55 ms	94320 KB	Output is correct
30	Correct	42 ms	94296 KB	Output is correct
31	Correct	43 ms	94316 KB	Output is correct
32	Correct	42 ms	94396 KB	Output is correct
33	Correct	42 ms	94320 KB	Output is correct
34	Correct	43 ms	94296 KB	Output is correct
35	Correct	55 ms	94284 KB	Output is correct
36	Correct	44 ms	94212 KB	Output is correct
37	Correct	43 ms	94384 KB	Output is correct
38	Correct	53 ms	94384 KB	Output is correct
39	Correct	43 ms	94260 KB	Output is correct
40	Correct	40 ms	94204 KB	Output is correct
41	Correct	40 ms	94420 KB	Output is correct
42	Correct	40 ms	94412 KB	Output is correct
43	Correct	45 ms	94412 KB	Output is correct
44	Correct	50 ms	94468 KB	Output is correct

Subtask #3
56.0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	48 ms	94248 KB	Output is correct
2	Correct	34 ms	94232 KB	Output is correct
3	Correct	40 ms	94328 KB	Output is correct
4	Correct	34 ms	94204 KB	Output is correct
5	Correct	34 ms	94200 KB	Output is correct
6	Correct	35 ms	94156 KB	Output is correct
7	Correct	34 ms	94176 KB	Output is correct
8	Correct	34 ms	94176 KB	Output is correct
9	Correct	34 ms	94248 KB	Output is correct
10	Correct	36 ms	94196 KB	Output is correct
11	Correct	39 ms	94184 KB	Output is correct
12	Correct	35 ms	94180 KB	Output is correct
13	Correct	35 ms	94172 KB	Output is correct
14	Correct	37 ms	94276 KB	Output is correct
15	Correct	35 ms	94224 KB	Output is correct
16	Correct	36 ms	94272 KB	Output is correct
17	Correct	34 ms	94156 KB	Output is correct
18	Correct	32 ms	94208 KB	Output is correct
19	Correct	34 ms	94236 KB	Output is correct
20	Correct	33 ms	94272 KB	Output is correct
21	Correct	39 ms	94260 KB	Output is correct
22	Correct	38 ms	94144 KB	Output is correct
23	Correct	49 ms	94244 KB	Output is correct
24	Correct	37 ms	94260 KB	Output is correct
25	Correct	49 ms	94408 KB	Output is correct
26	Correct	40 ms	94336 KB	Output is correct
27	Correct	43 ms	94368 KB	Output is correct
28	Correct	43 ms	94384 KB	Output is correct
29	Correct	55 ms	94320 KB	Output is correct
30	Correct	42 ms	94296 KB	Output is correct
31	Correct	43 ms	94316 KB	Output is correct
32	Correct	42 ms	94396 KB	Output is correct
33	Correct	42 ms	94320 KB	Output is correct
34	Correct	43 ms	94296 KB	Output is correct
35	Correct	55 ms	94284 KB	Output is correct
36	Correct	44 ms	94212 KB	Output is correct
37	Correct	43 ms	94384 KB	Output is correct
38	Correct	53 ms	94384 KB	Output is correct
39	Correct	43 ms	94260 KB	Output is correct
40	Correct	40 ms	94204 KB	Output is correct
41	Correct	40 ms	94420 KB	Output is correct
42	Correct	40 ms	94412 KB	Output is correct
43	Correct	45 ms	94412 KB	Output is correct
44	Correct	50 ms	94468 KB	Output is correct
45	Correct	279 ms	98128 KB	Output is correct
46	Correct	250 ms	99416 KB	Output is correct
47	Correct	255 ms	97288 KB	Output is correct
48	Correct	261 ms	99376 KB	Output is correct
49	Correct	259 ms	97468 KB	Output is correct
50	Correct	243 ms	99020 KB	Output is correct
51	Correct	245 ms	98892 KB	Output is correct
52	Correct	290 ms	96788 KB	Output is correct
53	Correct	358 ms	95940 KB	Output is correct
54	Correct	240 ms	105428 KB	Output is correct
55	Correct	253 ms	100632 KB	Output is correct
56	Correct	227 ms	100708 KB	Output is correct
57	Correct	277 ms	96816 KB	Output is correct
58	Correct	324 ms	96784 KB	Output is correct
59	Correct	290 ms	96816 KB	Output is correct
60	Correct	279 ms	96816 KB	Output is correct
61	Correct	254 ms	96716 KB	Output is correct
62	Correct	259 ms	96816 KB	Output is correct
63	Correct	275 ms	96820 KB	Output is correct
64	Correct	275 ms	96740 KB	Output is correct
65	Correct	316 ms	105804 KB	Output is correct
66	Correct	309 ms	105820 KB	Output is correct
67	Correct	265 ms	101072 KB	Output is correct
68	Correct	242 ms	101048 KB	Output is correct
69	Correct	250 ms	100556 KB	Output is correct
70	Correct	265 ms	100572 KB	Output is correct
71	Correct	242 ms	105428 KB	Output is correct
72	Correct	261 ms	105432 KB	Output is correct
73	Correct	234 ms	102284 KB	Output is correct
74	Correct	242 ms	102236 KB	Output is correct
75	Correct	214 ms	102404 KB	Output is correct
76	Correct	209 ms	106200 KB	Output is correct
77	Correct	202 ms	106204 KB	Output is correct
78	Correct	246 ms	99120 KB	Output is correct
79	Correct	264 ms	98212 KB	Output is correct

Subtask #4
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	48 ms	94248 KB	Output is correct
2	Correct	34 ms	94232 KB	Output is correct
3	Correct	40 ms	94328 KB	Output is correct
4	Correct	34 ms	94204 KB	Output is correct
5	Correct	34 ms	94200 KB	Output is correct
6	Correct	35 ms	94156 KB	Output is correct
7	Correct	34 ms	94176 KB	Output is correct
8	Correct	34 ms	94176 KB	Output is correct
9	Correct	34 ms	94248 KB	Output is correct
10	Correct	36 ms	94196 KB	Output is correct
11	Correct	39 ms	94184 KB	Output is correct
12	Correct	35 ms	94180 KB	Output is correct
13	Correct	35 ms	94172 KB	Output is correct
14	Correct	37 ms	94276 KB	Output is correct
15	Correct	35 ms	94224 KB	Output is correct
16	Correct	36 ms	94272 KB	Output is correct
17	Correct	34 ms	94156 KB	Output is correct
18	Correct	32 ms	94208 KB	Output is correct
19	Correct	34 ms	94236 KB	Output is correct
20	Correct	33 ms	94272 KB	Output is correct
21	Correct	39 ms	94260 KB	Output is correct
22	Correct	38 ms	94144 KB	Output is correct
23	Correct	49 ms	94244 KB	Output is correct
24	Correct	37 ms	94260 KB	Output is correct
25	Correct	49 ms	94408 KB	Output is correct
26	Correct	40 ms	94336 KB	Output is correct
27	Correct	43 ms	94368 KB	Output is correct
28	Correct	43 ms	94384 KB	Output is correct
29	Correct	55 ms	94320 KB	Output is correct
30	Correct	42 ms	94296 KB	Output is correct
31	Correct	43 ms	94316 KB	Output is correct
32	Correct	42 ms	94396 KB	Output is correct
33	Correct	42 ms	94320 KB	Output is correct
34	Correct	43 ms	94296 KB	Output is correct
35	Correct	55 ms	94284 KB	Output is correct
36	Correct	44 ms	94212 KB	Output is correct
37	Correct	43 ms	94384 KB	Output is correct
38	Correct	53 ms	94384 KB	Output is correct
39	Correct	43 ms	94260 KB	Output is correct
40	Correct	40 ms	94204 KB	Output is correct
41	Correct	40 ms	94420 KB	Output is correct
42	Correct	40 ms	94412 KB	Output is correct
43	Correct	45 ms	94412 KB	Output is correct
44	Correct	50 ms	94468 KB	Output is correct
45	Correct	279 ms	98128 KB	Output is correct
46	Correct	250 ms	99416 KB	Output is correct
47	Correct	255 ms	97288 KB	Output is correct
48	Correct	261 ms	99376 KB	Output is correct
49	Correct	259 ms	97468 KB	Output is correct
50	Correct	243 ms	99020 KB	Output is correct
51	Correct	245 ms	98892 KB	Output is correct
52	Correct	290 ms	96788 KB	Output is correct
53	Correct	358 ms	95940 KB	Output is correct
54	Correct	240 ms	105428 KB	Output is correct
55	Correct	253 ms	100632 KB	Output is correct
56	Correct	227 ms	100708 KB	Output is correct
57	Correct	277 ms	96816 KB	Output is correct
58	Correct	324 ms	96784 KB	Output is correct
59	Correct	290 ms	96816 KB	Output is correct
60	Correct	279 ms	96816 KB	Output is correct
61	Correct	254 ms	96716 KB	Output is correct
62	Correct	259 ms	96816 KB	Output is correct
63	Correct	275 ms	96820 KB	Output is correct
64	Correct	275 ms	96740 KB	Output is correct
65	Correct	316 ms	105804 KB	Output is correct
66	Correct	309 ms	105820 KB	Output is correct
67	Correct	265 ms	101072 KB	Output is correct
68	Correct	242 ms	101048 KB	Output is correct
69	Correct	250 ms	100556 KB	Output is correct
70	Correct	265 ms	100572 KB	Output is correct
71	Correct	242 ms	105428 KB	Output is correct
72	Correct	261 ms	105432 KB	Output is correct
73	Correct	234 ms	102284 KB	Output is correct
74	Correct	242 ms	102236 KB	Output is correct
75	Correct	214 ms	102404 KB	Output is correct
76	Correct	209 ms	106200 KB	Output is correct
77	Correct	202 ms	106204 KB	Output is correct
78	Correct	246 ms	99120 KB	Output is correct
79	Correct	264 ms	98212 KB	Output is correct
80	Execution timed out	6081 ms	117712 KB	Time limit exceeded
81	Halted	0 ms	0 KB	-

답안 #834012

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