답안 #834075

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834075	2023-08-22T10:35:40 Z	LucaIlie	Port Facility (JOI17_port_facility)	C++17	100 / 100	3131 ms	239996 KB

port_facility

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2e6;
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	42 ms	94284 KB	Output is correct
2	Correct	41 ms	94340 KB	Output is correct
3	Correct	43 ms	94224 KB	Output is correct
4	Correct	41 ms	94284 KB	Output is correct
5	Correct	41 ms	94284 KB	Output is correct
6	Correct	43 ms	94292 KB	Output is correct
7	Correct	43 ms	94292 KB	Output is correct
8	Correct	41 ms	94284 KB	Output is correct
9	Correct	42 ms	94240 KB	Output is correct
10	Correct	41 ms	94316 KB	Output is correct
11	Correct	42 ms	94284 KB	Output is correct
12	Correct	41 ms	94292 KB	Output is correct
13	Correct	40 ms	94196 KB	Output is correct
14	Correct	41 ms	94284 KB	Output is correct
15	Correct	43 ms	94396 KB	Output is correct
16	Correct	41 ms	94280 KB	Output is correct
17	Correct	40 ms	94292 KB	Output is correct
18	Correct	42 ms	94284 KB	Output is correct
19	Correct	41 ms	94292 KB	Output is correct
20	Correct	45 ms	94284 KB	Output is correct
21	Correct	42 ms	94284 KB	Output is correct
22	Correct	44 ms	94284 KB	Output is correct
23	Correct	51 ms	94284 KB	Output is correct
24	Correct	43 ms	94216 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	42 ms	94284 KB	Output is correct
2	Correct	41 ms	94340 KB	Output is correct
3	Correct	43 ms	94224 KB	Output is correct
4	Correct	41 ms	94284 KB	Output is correct
5	Correct	41 ms	94284 KB	Output is correct
6	Correct	43 ms	94292 KB	Output is correct
7	Correct	43 ms	94292 KB	Output is correct
8	Correct	41 ms	94284 KB	Output is correct
9	Correct	42 ms	94240 KB	Output is correct
10	Correct	41 ms	94316 KB	Output is correct
11	Correct	42 ms	94284 KB	Output is correct
12	Correct	41 ms	94292 KB	Output is correct
13	Correct	40 ms	94196 KB	Output is correct
14	Correct	41 ms	94284 KB	Output is correct
15	Correct	43 ms	94396 KB	Output is correct
16	Correct	41 ms	94280 KB	Output is correct
17	Correct	40 ms	94292 KB	Output is correct
18	Correct	42 ms	94284 KB	Output is correct
19	Correct	41 ms	94292 KB	Output is correct
20	Correct	45 ms	94284 KB	Output is correct
21	Correct	42 ms	94284 KB	Output is correct
22	Correct	44 ms	94284 KB	Output is correct
23	Correct	51 ms	94284 KB	Output is correct
24	Correct	43 ms	94216 KB	Output is correct
25	Correct	45 ms	94412 KB	Output is correct
26	Correct	44 ms	94412 KB	Output is correct
27	Correct	48 ms	94404 KB	Output is correct
28	Correct	44 ms	94412 KB	Output is correct
29	Correct	44 ms	94424 KB	Output is correct
30	Correct	43 ms	94420 KB	Output is correct
31	Correct	44 ms	94412 KB	Output is correct
32	Correct	49 ms	94412 KB	Output is correct
33	Correct	46 ms	94436 KB	Output is correct
34	Correct	43 ms	94400 KB	Output is correct
35	Correct	43 ms	94288 KB	Output is correct
36	Correct	46 ms	94292 KB	Output is correct
37	Correct	54 ms	94556 KB	Output is correct
38	Correct	42 ms	94412 KB	Output is correct
39	Correct	42 ms	94392 KB	Output is correct
40	Correct	44 ms	94292 KB	Output is correct
41	Correct	43 ms	94540 KB	Output is correct
42	Correct	45 ms	94504 KB	Output is correct
43	Correct	46 ms	94504 KB	Output is correct
44	Correct	52 ms	94540 KB	Output is correct

Subtask #3
56.0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	42 ms	94284 KB	Output is correct
2	Correct	41 ms	94340 KB	Output is correct
3	Correct	43 ms	94224 KB	Output is correct
4	Correct	41 ms	94284 KB	Output is correct
5	Correct	41 ms	94284 KB	Output is correct
6	Correct	43 ms	94292 KB	Output is correct
7	Correct	43 ms	94292 KB	Output is correct
8	Correct	41 ms	94284 KB	Output is correct
9	Correct	42 ms	94240 KB	Output is correct
10	Correct	41 ms	94316 KB	Output is correct
11	Correct	42 ms	94284 KB	Output is correct
12	Correct	41 ms	94292 KB	Output is correct
13	Correct	40 ms	94196 KB	Output is correct
14	Correct	41 ms	94284 KB	Output is correct
15	Correct	43 ms	94396 KB	Output is correct
16	Correct	41 ms	94280 KB	Output is correct
17	Correct	40 ms	94292 KB	Output is correct
18	Correct	42 ms	94284 KB	Output is correct
19	Correct	41 ms	94292 KB	Output is correct
20	Correct	45 ms	94284 KB	Output is correct
21	Correct	42 ms	94284 KB	Output is correct
22	Correct	44 ms	94284 KB	Output is correct
23	Correct	51 ms	94284 KB	Output is correct
24	Correct	43 ms	94216 KB	Output is correct
25	Correct	45 ms	94412 KB	Output is correct
26	Correct	44 ms	94412 KB	Output is correct
27	Correct	48 ms	94404 KB	Output is correct
28	Correct	44 ms	94412 KB	Output is correct
29	Correct	44 ms	94424 KB	Output is correct
30	Correct	43 ms	94420 KB	Output is correct
31	Correct	44 ms	94412 KB	Output is correct
32	Correct	49 ms	94412 KB	Output is correct
33	Correct	46 ms	94436 KB	Output is correct
34	Correct	43 ms	94400 KB	Output is correct
35	Correct	43 ms	94288 KB	Output is correct
36	Correct	46 ms	94292 KB	Output is correct
37	Correct	54 ms	94556 KB	Output is correct
38	Correct	42 ms	94412 KB	Output is correct
39	Correct	42 ms	94392 KB	Output is correct
40	Correct	44 ms	94292 KB	Output is correct
41	Correct	43 ms	94540 KB	Output is correct
42	Correct	45 ms	94504 KB	Output is correct
43	Correct	46 ms	94504 KB	Output is correct
44	Correct	52 ms	94540 KB	Output is correct
45	Correct	168 ms	99252 KB	Output is correct
46	Correct	170 ms	100552 KB	Output is correct
47	Correct	180 ms	98384 KB	Output is correct
48	Correct	170 ms	100540 KB	Output is correct
49	Correct	172 ms	98680 KB	Output is correct
50	Correct	190 ms	100236 KB	Output is correct
51	Correct	182 ms	100172 KB	Output is correct
52	Correct	139 ms	98016 KB	Output is correct
53	Correct	148 ms	97224 KB	Output is correct
54	Correct	178 ms	106572 KB	Output is correct
55	Correct	170 ms	101960 KB	Output is correct
56	Correct	173 ms	101956 KB	Output is correct
57	Correct	142 ms	97996 KB	Output is correct
58	Correct	135 ms	98028 KB	Output is correct
59	Correct	146 ms	97996 KB	Output is correct
60	Correct	188 ms	97984 KB	Output is correct
61	Correct	170 ms	98016 KB	Output is correct
62	Correct	150 ms	98032 KB	Output is correct
63	Correct	160 ms	97936 KB	Output is correct
64	Correct	180 ms	97972 KB	Output is correct
65	Correct	230 ms	107028 KB	Output is correct
66	Correct	240 ms	106980 KB	Output is correct
67	Correct	175 ms	102220 KB	Output is correct
68	Correct	186 ms	102264 KB	Output is correct
69	Correct	190 ms	101732 KB	Output is correct
70	Correct	190 ms	101808 KB	Output is correct
71	Correct	208 ms	106700 KB	Output is correct
72	Correct	174 ms	106624 KB	Output is correct
73	Correct	175 ms	103500 KB	Output is correct
74	Correct	215 ms	103604 KB	Output is correct
75	Correct	153 ms	107332 KB	Output is correct
76	Correct	158 ms	107384 KB	Output is correct
77	Correct	150 ms	107312 KB	Output is correct
78	Correct	167 ms	100332 KB	Output is correct
79	Correct	168 ms	99472 KB	Output is correct

Subtask #4
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	42 ms	94284 KB	Output is correct
2	Correct	41 ms	94340 KB	Output is correct
3	Correct	43 ms	94224 KB	Output is correct
4	Correct	41 ms	94284 KB	Output is correct
5	Correct	41 ms	94284 KB	Output is correct
6	Correct	43 ms	94292 KB	Output is correct
7	Correct	43 ms	94292 KB	Output is correct
8	Correct	41 ms	94284 KB	Output is correct
9	Correct	42 ms	94240 KB	Output is correct
10	Correct	41 ms	94316 KB	Output is correct
11	Correct	42 ms	94284 KB	Output is correct
12	Correct	41 ms	94292 KB	Output is correct
13	Correct	40 ms	94196 KB	Output is correct
14	Correct	41 ms	94284 KB	Output is correct
15	Correct	43 ms	94396 KB	Output is correct
16	Correct	41 ms	94280 KB	Output is correct
17	Correct	40 ms	94292 KB	Output is correct
18	Correct	42 ms	94284 KB	Output is correct
19	Correct	41 ms	94292 KB	Output is correct
20	Correct	45 ms	94284 KB	Output is correct
21	Correct	42 ms	94284 KB	Output is correct
22	Correct	44 ms	94284 KB	Output is correct
23	Correct	51 ms	94284 KB	Output is correct
24	Correct	43 ms	94216 KB	Output is correct
25	Correct	45 ms	94412 KB	Output is correct
26	Correct	44 ms	94412 KB	Output is correct
27	Correct	48 ms	94404 KB	Output is correct
28	Correct	44 ms	94412 KB	Output is correct
29	Correct	44 ms	94424 KB	Output is correct
30	Correct	43 ms	94420 KB	Output is correct
31	Correct	44 ms	94412 KB	Output is correct
32	Correct	49 ms	94412 KB	Output is correct
33	Correct	46 ms	94436 KB	Output is correct
34	Correct	43 ms	94400 KB	Output is correct
35	Correct	43 ms	94288 KB	Output is correct
36	Correct	46 ms	94292 KB	Output is correct
37	Correct	54 ms	94556 KB	Output is correct
38	Correct	42 ms	94412 KB	Output is correct
39	Correct	42 ms	94392 KB	Output is correct
40	Correct	44 ms	94292 KB	Output is correct
41	Correct	43 ms	94540 KB	Output is correct
42	Correct	45 ms	94504 KB	Output is correct
43	Correct	46 ms	94504 KB	Output is correct
44	Correct	52 ms	94540 KB	Output is correct
45	Correct	168 ms	99252 KB	Output is correct
46	Correct	170 ms	100552 KB	Output is correct
47	Correct	180 ms	98384 KB	Output is correct
48	Correct	170 ms	100540 KB	Output is correct
49	Correct	172 ms	98680 KB	Output is correct
50	Correct	190 ms	100236 KB	Output is correct
51	Correct	182 ms	100172 KB	Output is correct
52	Correct	139 ms	98016 KB	Output is correct
53	Correct	148 ms	97224 KB	Output is correct
54	Correct	178 ms	106572 KB	Output is correct
55	Correct	170 ms	101960 KB	Output is correct
56	Correct	173 ms	101956 KB	Output is correct
57	Correct	142 ms	97996 KB	Output is correct
58	Correct	135 ms	98028 KB	Output is correct
59	Correct	146 ms	97996 KB	Output is correct
60	Correct	188 ms	97984 KB	Output is correct
61	Correct	170 ms	98016 KB	Output is correct
62	Correct	150 ms	98032 KB	Output is correct
63	Correct	160 ms	97936 KB	Output is correct
64	Correct	180 ms	97972 KB	Output is correct
65	Correct	230 ms	107028 KB	Output is correct
66	Correct	240 ms	106980 KB	Output is correct
67	Correct	175 ms	102220 KB	Output is correct
68	Correct	186 ms	102264 KB	Output is correct
69	Correct	190 ms	101732 KB	Output is correct
70	Correct	190 ms	101808 KB	Output is correct
71	Correct	208 ms	106700 KB	Output is correct
72	Correct	174 ms	106624 KB	Output is correct
73	Correct	175 ms	103500 KB	Output is correct
74	Correct	215 ms	103604 KB	Output is correct
75	Correct	153 ms	107332 KB	Output is correct
76	Correct	158 ms	107384 KB	Output is correct
77	Correct	150 ms	107312 KB	Output is correct
78	Correct	167 ms	100332 KB	Output is correct
79	Correct	168 ms	99472 KB	Output is correct
80	Correct	1512 ms	137532 KB	Output is correct
81	Correct	1562 ms	150708 KB	Output is correct
82	Correct	1548 ms	147436 KB	Output is correct
83	Correct	1565 ms	150816 KB	Output is correct
84	Correct	1530 ms	151868 KB	Output is correct
85	Correct	1508 ms	147720 KB	Output is correct
86	Correct	1552 ms	150892 KB	Output is correct
87	Correct	1119 ms	146056 KB	Output is correct
88	Correct	1312 ms	138232 KB	Output is correct
89	Correct	1564 ms	232100 KB	Output is correct
90	Correct	1543 ms	185232 KB	Output is correct
91	Correct	1556 ms	185132 KB	Output is correct
92	Correct	1192 ms	146048 KB	Output is correct
93	Correct	1085 ms	145968 KB	Output is correct
94	Correct	1294 ms	146052 KB	Output is correct
95	Correct	1392 ms	146060 KB	Output is correct
96	Correct	1422 ms	146232 KB	Output is correct
97	Correct	1332 ms	146052 KB	Output is correct
98	Correct	1386 ms	146060 KB	Output is correct
99	Correct	1422 ms	146020 KB	Output is correct
100	Correct	3131 ms	236092 KB	Output is correct
101	Correct	3004 ms	236084 KB	Output is correct
102	Correct	1629 ms	189292 KB	Output is correct
103	Correct	1570 ms	188948 KB	Output is correct
104	Correct	1558 ms	183888 KB	Output is correct
105	Correct	1558 ms	184056 KB	Output is correct
106	Correct	1523 ms	232168 KB	Output is correct
107	Correct	1512 ms	232176 KB	Output is correct
108	Correct	1579 ms	200852 KB	Output is correct
109	Correct	1574 ms	200772 KB	Output is correct
110	Correct	1284 ms	239984 KB	Output is correct
111	Correct	1246 ms	239996 KB	Output is correct
112	Correct	1293 ms	239892 KB	Output is correct
113	Correct	1466 ms	146828 KB	Output is correct
114	Correct	1510 ms	150604 KB	Output is correct

답안 #834075

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 56.0 / 56.0

Subtask #4 22.0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
56.0 / 56.0

Subtask #4
22.0 / 22.0