Submission #44415

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
44415	2018-04-02T04:31:52 Z	choikiwon	Port Facility (JOI17_port_facility)	C++17	100 / 100	4129 ms	784892 KB

port_facility

#include<bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

const int mod = 1e9 + 7;
const int MN = 1000010;

int N, M;
pii P[MN], arr[MN << 1];
vector<int> A, B;

struct BIT {
    vector<pii> tree;
    void init() {
        tree = vector<pii>(4 * M);
        build(0, M - 1, 1);
    }
    void build(int l, int r, int n) {
        if(l == r) {
            tree[n] = arr[l];
            return;
        }
        int m = (l + r)>>1;
        build(l, m, 2*n);
        build(m + 1, r, 2*n + 1);
        tree[n] = max(tree[2*n], tree[2*n + 1]);
    }
    void upd(int idx, pii val, int l, int r, int n) {
        if(idx < l || r < idx) return;
        if(l == r) {
            tree[n] = val;
            return;
        }
        int m = (l + r)>>1;
        upd(idx, val, l, m, 2*n);
        upd(idx, val, m + 1, r, 2*n + 1);
        tree[n] = max(tree[2*n], tree[2*n + 1]);
    }
    pii quer(int a, int b, int l, int r, int n) {
        if(b < l || r < a) return pii(-1e9, -1e9);
        if(a <= l && r <= b) return tree[n];
        int m = (l + r)>>1;
        pii L = quer(a, b, l, m, 2*n);
        pii R = quer(a, b, m + 1, r, 2*n + 1);
        return max(L, R);
    }
} bit1, bit2;

int col[MN];

void dfs(int u, int c) {
    col[u] = c;

    int l = P[u].first;
    int r = P[u].second;
    bit1.upd(l, {-1e9, -1e9}, 0, M - 1, 1);
    bit2.upd(r, {-1e9, -1e9}, 0, M - 1, 1);

    while(1) {
        pii t = bit1.quer(l, r, 0, M - 1, 1);
        if(t.first < r) break;
        dfs(t.second, c ^ 1);
    }
    while(1) {
        pii t = bit2.quer(l, r, 0, M - 1, 1);
        if(-t.first > l) break;
        dfs(t.second, c ^ 1);
    }
}

int main() {
    scanf("%d", &N);

    for(int i = 0; i < N; i++) {
        scanf("%d %d", &P[i].first, &P[i].second);
        P[i].first--;
        P[i].second--;
    }

    sort(P, P + N);

    M = N << 1;
    for(int i = 0; i < M; i++) arr[i] = {-1e9, -1e9};
    for(int i = 0; i < N; i++) {
        arr[ P[i].first ] = { P[i].second, i };
    }
    bit1.init();

    for(int i = 0; i < M; i++) arr[i] = {-1e9, -1e9};
    for(int i = 0; i < N; i++) {
        arr[ P[i].second ] = { -P[i].first, i };
    }
    bit2.init();

    memset(col, -1, sizeof(col));
    int cnt = 0;
    for(int i = 0; i < N; i++) if(col[i] == -1) {
        dfs(i, 0);
        cnt++;
    }

    for(int i = 0; i < N; i++) {
        while(A.size() && A.back() < P[i].first) A.pop_back();
        while(B.size() && B.back() < P[i].first) B.pop_back();
        if(col[i]) {
            if(A.size() && A.back() < P[i].second) {
                printf("0");
                return 0;
            }
            A.push_back(P[i].second);
        }
        else {
            if(B.size() && B.back() < P[i].second) {
                printf("0");
                return 0;
            }
            B.push_back(P[i].second);
        }
    }

    int ans = 1;
    for(int i = 0; i < cnt; i++) {
        ans *= 2;
        ans %= mod;
    }
    printf("%d", ans);
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
port_facility.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &P[i].first, &P[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4216 KB	Output is correct
2	Correct	5 ms	4328 KB	Output is correct
3	Correct	5 ms	4328 KB	Output is correct
4	Correct	5 ms	4404 KB	Output is correct
5	Correct	4 ms	4404 KB	Output is correct
6	Correct	4 ms	4484 KB	Output is correct
7	Correct	5 ms	4484 KB	Output is correct
8	Correct	5 ms	4484 KB	Output is correct
9	Correct	4 ms	4484 KB	Output is correct
10	Correct	5 ms	4484 KB	Output is correct
11	Correct	6 ms	4484 KB	Output is correct
12	Correct	5 ms	4596 KB	Output is correct
13	Correct	5 ms	4596 KB	Output is correct
14	Correct	5 ms	4596 KB	Output is correct
15	Correct	5 ms	4596 KB	Output is correct
16	Correct	5 ms	4596 KB	Output is correct
17	Correct	4 ms	4596 KB	Output is correct
18	Correct	5 ms	4596 KB	Output is correct
19	Correct	4 ms	4596 KB	Output is correct
20	Correct	5 ms	4596 KB	Output is correct
21	Correct	5 ms	4664 KB	Output is correct
22	Correct	5 ms	4716 KB	Output is correct
23	Correct	4 ms	4716 KB	Output is correct
24	Correct	5 ms	4716 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4216 KB	Output is correct
2	Correct	5 ms	4328 KB	Output is correct
3	Correct	5 ms	4328 KB	Output is correct
4	Correct	5 ms	4404 KB	Output is correct
5	Correct	4 ms	4404 KB	Output is correct
6	Correct	4 ms	4484 KB	Output is correct
7	Correct	5 ms	4484 KB	Output is correct
8	Correct	5 ms	4484 KB	Output is correct
9	Correct	4 ms	4484 KB	Output is correct
10	Correct	5 ms	4484 KB	Output is correct
11	Correct	6 ms	4484 KB	Output is correct
12	Correct	5 ms	4596 KB	Output is correct
13	Correct	5 ms	4596 KB	Output is correct
14	Correct	5 ms	4596 KB	Output is correct
15	Correct	5 ms	4596 KB	Output is correct
16	Correct	5 ms	4596 KB	Output is correct
17	Correct	4 ms	4596 KB	Output is correct
18	Correct	5 ms	4596 KB	Output is correct
19	Correct	4 ms	4596 KB	Output is correct
20	Correct	5 ms	4596 KB	Output is correct
21	Correct	5 ms	4664 KB	Output is correct
22	Correct	5 ms	4716 KB	Output is correct
23	Correct	4 ms	4716 KB	Output is correct
24	Correct	5 ms	4716 KB	Output is correct
25	Correct	7 ms	5084 KB	Output is correct
26	Correct	8 ms	5456 KB	Output is correct
27	Correct	7 ms	5456 KB	Output is correct
28	Correct	7 ms	5456 KB	Output is correct
29	Correct	8 ms	5456 KB	Output is correct
30	Correct	8 ms	5456 KB	Output is correct
31	Correct	8 ms	5456 KB	Output is correct
32	Correct	7 ms	5496 KB	Output is correct
33	Correct	8 ms	5496 KB	Output is correct
34	Correct	7 ms	5496 KB	Output is correct
35	Correct	6 ms	5496 KB	Output is correct
36	Correct	7 ms	5496 KB	Output is correct
37	Correct	7 ms	5612 KB	Output is correct
38	Correct	8 ms	5612 KB	Output is correct
39	Correct	7 ms	5612 KB	Output is correct
40	Correct	8 ms	5612 KB	Output is correct
41	Correct	8 ms	5932 KB	Output is correct
42	Correct	8 ms	5932 KB	Output is correct
43	Correct	7 ms	5932 KB	Output is correct
44	Correct	7 ms	5932 KB	Output is correct

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4216 KB	Output is correct
2	Correct	5 ms	4328 KB	Output is correct
3	Correct	5 ms	4328 KB	Output is correct
4	Correct	5 ms	4404 KB	Output is correct
5	Correct	4 ms	4404 KB	Output is correct
6	Correct	4 ms	4484 KB	Output is correct
7	Correct	5 ms	4484 KB	Output is correct
8	Correct	5 ms	4484 KB	Output is correct
9	Correct	4 ms	4484 KB	Output is correct
10	Correct	5 ms	4484 KB	Output is correct
11	Correct	6 ms	4484 KB	Output is correct
12	Correct	5 ms	4596 KB	Output is correct
13	Correct	5 ms	4596 KB	Output is correct
14	Correct	5 ms	4596 KB	Output is correct
15	Correct	5 ms	4596 KB	Output is correct
16	Correct	5 ms	4596 KB	Output is correct
17	Correct	4 ms	4596 KB	Output is correct
18	Correct	5 ms	4596 KB	Output is correct
19	Correct	4 ms	4596 KB	Output is correct
20	Correct	5 ms	4596 KB	Output is correct
21	Correct	5 ms	4664 KB	Output is correct
22	Correct	5 ms	4716 KB	Output is correct
23	Correct	4 ms	4716 KB	Output is correct
24	Correct	5 ms	4716 KB	Output is correct
25	Correct	7 ms	5084 KB	Output is correct
26	Correct	8 ms	5456 KB	Output is correct
27	Correct	7 ms	5456 KB	Output is correct
28	Correct	7 ms	5456 KB	Output is correct
29	Correct	8 ms	5456 KB	Output is correct
30	Correct	8 ms	5456 KB	Output is correct
31	Correct	8 ms	5456 KB	Output is correct
32	Correct	7 ms	5496 KB	Output is correct
33	Correct	8 ms	5496 KB	Output is correct
34	Correct	7 ms	5496 KB	Output is correct
35	Correct	6 ms	5496 KB	Output is correct
36	Correct	7 ms	5496 KB	Output is correct
37	Correct	7 ms	5612 KB	Output is correct
38	Correct	8 ms	5612 KB	Output is correct
39	Correct	7 ms	5612 KB	Output is correct
40	Correct	8 ms	5612 KB	Output is correct
41	Correct	8 ms	5932 KB	Output is correct
42	Correct	8 ms	5932 KB	Output is correct
43	Correct	7 ms	5932 KB	Output is correct
44	Correct	7 ms	5932 KB	Output is correct
45	Correct	207 ms	23308 KB	Output is correct
46	Correct	203 ms	26028 KB	Output is correct
47	Correct	186 ms	26028 KB	Output is correct
48	Correct	264 ms	28624 KB	Output is correct
49	Correct	201 ms	28624 KB	Output is correct
50	Correct	212 ms	30664 KB	Output is correct
51	Correct	214 ms	31872 KB	Output is correct
52	Correct	127 ms	31872 KB	Output is correct
53	Correct	162 ms	32288 KB	Output is correct
54	Correct	206 ms	43892 KB	Output is correct
55	Correct	206 ms	43892 KB	Output is correct
56	Correct	227 ms	43892 KB	Output is correct
57	Correct	134 ms	43892 KB	Output is correct
58	Correct	127 ms	43892 KB	Output is correct
59	Correct	144 ms	43892 KB	Output is correct
60	Correct	192 ms	43892 KB	Output is correct
61	Correct	178 ms	43892 KB	Output is correct
62	Correct	156 ms	43892 KB	Output is correct
63	Correct	167 ms	44164 KB	Output is correct
64	Correct	172 ms	45536 KB	Output is correct
65	Correct	327 ms	57720 KB	Output is correct
66	Correct	314 ms	59000 KB	Output is correct
67	Correct	226 ms	59000 KB	Output is correct
68	Correct	225 ms	59000 KB	Output is correct
69	Correct	232 ms	59000 KB	Output is correct
70	Correct	213 ms	59000 KB	Output is correct
71	Correct	199 ms	65908 KB	Output is correct
72	Correct	223 ms	67040 KB	Output is correct
73	Correct	209 ms	67040 KB	Output is correct
74	Correct	233 ms	67040 KB	Output is correct
75	Correct	169 ms	70312 KB	Output is correct
76	Correct	168 ms	71576 KB	Output is correct
77	Correct	156 ms	72836 KB	Output is correct
78	Correct	220 ms	72836 KB	Output is correct
79	Correct	195 ms	72836 KB	Output is correct

Subtask #4
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4216 KB	Output is correct
2	Correct	5 ms	4328 KB	Output is correct
3	Correct	5 ms	4328 KB	Output is correct
4	Correct	5 ms	4404 KB	Output is correct
5	Correct	4 ms	4404 KB	Output is correct
6	Correct	4 ms	4484 KB	Output is correct
7	Correct	5 ms	4484 KB	Output is correct
8	Correct	5 ms	4484 KB	Output is correct
9	Correct	4 ms	4484 KB	Output is correct
10	Correct	5 ms	4484 KB	Output is correct
11	Correct	6 ms	4484 KB	Output is correct
12	Correct	5 ms	4596 KB	Output is correct
13	Correct	5 ms	4596 KB	Output is correct
14	Correct	5 ms	4596 KB	Output is correct
15	Correct	5 ms	4596 KB	Output is correct
16	Correct	5 ms	4596 KB	Output is correct
17	Correct	4 ms	4596 KB	Output is correct
18	Correct	5 ms	4596 KB	Output is correct
19	Correct	4 ms	4596 KB	Output is correct
20	Correct	5 ms	4596 KB	Output is correct
21	Correct	5 ms	4664 KB	Output is correct
22	Correct	5 ms	4716 KB	Output is correct
23	Correct	4 ms	4716 KB	Output is correct
24	Correct	5 ms	4716 KB	Output is correct
25	Correct	7 ms	5084 KB	Output is correct
26	Correct	8 ms	5456 KB	Output is correct
27	Correct	7 ms	5456 KB	Output is correct
28	Correct	7 ms	5456 KB	Output is correct
29	Correct	8 ms	5456 KB	Output is correct
30	Correct	8 ms	5456 KB	Output is correct
31	Correct	8 ms	5456 KB	Output is correct
32	Correct	7 ms	5496 KB	Output is correct
33	Correct	8 ms	5496 KB	Output is correct
34	Correct	7 ms	5496 KB	Output is correct
35	Correct	6 ms	5496 KB	Output is correct
36	Correct	7 ms	5496 KB	Output is correct
37	Correct	7 ms	5612 KB	Output is correct
38	Correct	8 ms	5612 KB	Output is correct
39	Correct	7 ms	5612 KB	Output is correct
40	Correct	8 ms	5612 KB	Output is correct
41	Correct	8 ms	5932 KB	Output is correct
42	Correct	8 ms	5932 KB	Output is correct
43	Correct	7 ms	5932 KB	Output is correct
44	Correct	7 ms	5932 KB	Output is correct
45	Correct	207 ms	23308 KB	Output is correct
46	Correct	203 ms	26028 KB	Output is correct
47	Correct	186 ms	26028 KB	Output is correct
48	Correct	264 ms	28624 KB	Output is correct
49	Correct	201 ms	28624 KB	Output is correct
50	Correct	212 ms	30664 KB	Output is correct
51	Correct	214 ms	31872 KB	Output is correct
52	Correct	127 ms	31872 KB	Output is correct
53	Correct	162 ms	32288 KB	Output is correct
54	Correct	206 ms	43892 KB	Output is correct
55	Correct	206 ms	43892 KB	Output is correct
56	Correct	227 ms	43892 KB	Output is correct
57	Correct	134 ms	43892 KB	Output is correct
58	Correct	127 ms	43892 KB	Output is correct
59	Correct	144 ms	43892 KB	Output is correct
60	Correct	192 ms	43892 KB	Output is correct
61	Correct	178 ms	43892 KB	Output is correct
62	Correct	156 ms	43892 KB	Output is correct
63	Correct	167 ms	44164 KB	Output is correct
64	Correct	172 ms	45536 KB	Output is correct
65	Correct	327 ms	57720 KB	Output is correct
66	Correct	314 ms	59000 KB	Output is correct
67	Correct	226 ms	59000 KB	Output is correct
68	Correct	225 ms	59000 KB	Output is correct
69	Correct	232 ms	59000 KB	Output is correct
70	Correct	213 ms	59000 KB	Output is correct
71	Correct	199 ms	65908 KB	Output is correct
72	Correct	223 ms	67040 KB	Output is correct
73	Correct	209 ms	67040 KB	Output is correct
74	Correct	233 ms	67040 KB	Output is correct
75	Correct	169 ms	70312 KB	Output is correct
76	Correct	168 ms	71576 KB	Output is correct
77	Correct	156 ms	72836 KB	Output is correct
78	Correct	220 ms	72836 KB	Output is correct
79	Correct	195 ms	72836 KB	Output is correct
80	Correct	2177 ms	221900 KB	Output is correct
81	Correct	2261 ms	235220 KB	Output is correct
82	Correct	2118 ms	246056 KB	Output is correct
83	Correct	2248 ms	264352 KB	Output is correct
84	Correct	2128 ms	280124 KB	Output is correct
85	Correct	2099 ms	289320 KB	Output is correct
86	Correct	2196 ms	307784 KB	Output is correct
87	Correct	1489 ms	314856 KB	Output is correct
88	Correct	1875 ms	333704 KB	Output is correct
89	Correct	2470 ms	453476 KB	Output is correct
90	Correct	2412 ms	453476 KB	Output is correct
91	Correct	2352 ms	453476 KB	Output is correct
92	Correct	1607 ms	453476 KB	Output is correct
93	Correct	1442 ms	453476 KB	Output is correct
94	Correct	1753 ms	453476 KB	Output is correct
95	Correct	1910 ms	453476 KB	Output is correct
96	Correct	2015 ms	453476 KB	Output is correct
97	Correct	1719 ms	461240 KB	Output is correct
98	Correct	1936 ms	476000 KB	Output is correct
99	Correct	1963 ms	490204 KB	Output is correct
100	Correct	4030 ms	613748 KB	Output is correct
101	Correct	4129 ms	628272 KB	Output is correct
102	Correct	2449 ms	628272 KB	Output is correct
103	Correct	2415 ms	628272 KB	Output is correct
104	Correct	2534 ms	628272 KB	Output is correct
105	Correct	2436 ms	631164 KB	Output is correct
106	Correct	2434 ms	706196 KB	Output is correct
107	Correct	2326 ms	720804 KB	Output is correct
108	Correct	2262 ms	720804 KB	Output is correct
109	Correct	2256 ms	720804 KB	Output is correct
110	Correct	1733 ms	759320 KB	Output is correct
111	Correct	1767 ms	772436 KB	Output is correct
112	Correct	1738 ms	784892 KB	Output is correct
113	Correct	2055 ms	784892 KB	Output is correct
114	Correct	2100 ms	784892 KB	Output is correct

Submission #44415

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