oj.uz

Submission #395047

# Submission time Handle Problem Language Result Execution time Memory
395047 2021-04-27T16:32:00 Z parsabahrami Port Facility (JOI17_port_facility) C++17
100 / 100
 5806 ms 264648 KB 
/* There's someone in my head but it's not me */ 
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")

using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second
#define lc                          id << 1
#define rc                          lc | 1

const int N = 2e6 + 5, MOD = 1e9 + 7;
int al[N], ar[N], M[N], n; pii mx[N << 2], mn[N << 2], Q[N / 2]; int MX[2][N << 2], MN[2][N << 2];

void modify(int p, pii x, int id = 1, int l = 1, int r = n * 2 + 1) {
    if (r - l < 2) {
        mx[id] = mn[id] = x;
        return;
    }
    int md = (l + r) >> 1;
    if (p < md) modify(p, x, lc, l, md);
    else modify(p, x, rc, md, r);
    mx[id] = max(mx[lc], mx[rc]);
    mn[id] = min(mn[lc], mn[rc]);
}

pair<pii, pii> get(int ql, int qr, int id = 1, int l = 1, int r = n * 2 + 1) {
    if (qr <= l || r <= ql || ql >= qr) return {{-MOD, -MOD}, {MOD, MOD}};
    if (ql <= l && r <= qr) return {mx[id], mn[id]};
    int md = (l + r) >> 1;
    pair<pii, pii> a = get(ql, qr, lc, l, md), b = get(ql, qr, rc, md, r);
    return {max(a.F, b.F), min(a.S, b.S)};
}

void remove(int p, int id = 1, int l = 1, int r = 2 * n + 1) {
    if (r - l < 2) {
        mx[id] = {-MOD, -MOD}, mn[id] = {MOD, MOD};
        return;
    }
    int md = (l + r) >> 1;
    if (p < md) remove(p, lc, l, md);
    else remove(p, rc, md, r);
    mx[id] = max(mx[lc], mx[rc]);
    mn[id] = min(mn[lc], mn[rc]);
}

void modi(int t, int p, int x, int id = 1, int l = 1, int r = n * 2 + 1) {
    if (r - l < 2) {
        MX[t][id] = MN[t][id] = x;
        return;
    }
    int md = (l + r) >> 1;
    if (p < md) modi(t, p, x, lc, l, md);
    else modi(t, p, x, rc, md, r);
    MX[t][id] = max(MX[t][lc], MX[t][rc]);
    MN[t][id] = min(MN[t][lc], MN[t][rc]);
}

pii geti(int t, int ql, int qr, int id = 1, int l = 1, int r = n * 2 + 1) {
    if (qr <= l || r <= ql) return {-MOD, MOD};
    if (ql <= l && r <= qr) return {MX[t][id], MN[t][id]};
    int md = (l + r) >> 1;
    pii a = geti(t, ql, qr, lc, l, md), b = geti(t, ql, qr, rc, md, r);
    return {max(a.F, b.F), min(a.S, b.S)};
}

void DFS(int v, int c = 0) {
    M[v] = 1, remove(al[v]), remove(ar[v]);
    auto y = geti(c, al[v], ar[v]);
    if (y.F > ar[v] || y.S < al[v]) { printf("0\n"); exit(0); }
    modi(c, al[v], ar[v]), modi(c, ar[v], al[v]);
    while (1) {
        pair<pii, pii> x = get(al[v], ar[v]);
        if (x.F.F > ar[v]) DFS(x.F.S, c ^ 1);
        else if (x.S.F < al[v]) DFS(x.S.S, c ^ 1);
        else break;
    }
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) 
        scanf("%d%d", &al[i], &ar[i]), modify(al[i], {ar[i], i}), modify(ar[i], {al[i], i});
    int gc = 0;
    for (int i = 0; i < 2; i++) 
        fill(MX[i], MX[i] + N * 4, -MOD), fill(MN[i], MN[i] + N * 4, MOD);
    for (int i = 1; i <= n; i++) {
        if (!M[i]) DFS(i), gc++;
    }
    int ret = 1;
    for (; gc; gc--) ret = 2ll * ret % MOD;
    printf("%d\n", ret);
    return 0;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:87:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   87 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
port_facility.cpp:89:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   89 |         scanf("%d%d", &al[i], &ar[i]), modify(al[i], {ar[i], i}), modify(ar[i], {al[i], i});
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 125536 KB Output is correct
2 Correct 76 ms 125556 KB Output is correct
3 Correct 76 ms 125572 KB Output is correct
4 Correct 75 ms 125508 KB Output is correct
5 Correct 75 ms 125528 KB Output is correct
6 Correct 75 ms 125484 KB Output is correct
7 Correct 79 ms 125508 KB Output is correct
8 Correct 74 ms 125532 KB Output is correct
9 Correct 75 ms 125504 KB Output is correct
10 Correct 75 ms 125556 KB Output is correct
11 Correct 74 ms 125508 KB Output is correct
12 Correct 75 ms 125552 KB Output is correct
13 Correct 74 ms 125528 KB Output is correct
14 Correct 74 ms 125496 KB Output is correct
15 Correct 74 ms 125468 KB Output is correct
16 Correct 74 ms 125520 KB Output is correct
17 Correct 74 ms 125528 KB Output is correct
18 Correct 75 ms 125480 KB Output is correct
19 Correct 75 ms 125540 KB Output is correct
20 Correct 75 ms 125452 KB Output is correct
21 Correct 75 ms 125524 KB Output is correct
22 Correct 74 ms 125528 KB Output is correct
23 Correct 74 ms 125536 KB Output is correct
24 Correct 76 ms 125552 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 125536 KB Output is correct
2 Correct 76 ms 125556 KB Output is correct
3 Correct 76 ms 125572 KB Output is correct
4 Correct 75 ms 125508 KB Output is correct
5 Correct 75 ms 125528 KB Output is correct
6 Correct 75 ms 125484 KB Output is correct
7 Correct 79 ms 125508 KB Output is correct
8 Correct 74 ms 125532 KB Output is correct
9 Correct 75 ms 125504 KB Output is correct
10 Correct 75 ms 125556 KB Output is correct
11 Correct 74 ms 125508 KB Output is correct
12 Correct 75 ms 125552 KB Output is correct
13 Correct 74 ms 125528 KB Output is correct
14 Correct 74 ms 125496 KB Output is correct
15 Correct 74 ms 125468 KB Output is correct
16 Correct 74 ms 125520 KB Output is correct
17 Correct 74 ms 125528 KB Output is correct
18 Correct 75 ms 125480 KB Output is correct
19 Correct 75 ms 125540 KB Output is correct
20 Correct 75 ms 125452 KB Output is correct
21 Correct 75 ms 125524 KB Output is correct
22 Correct 74 ms 125528 KB Output is correct
23 Correct 74 ms 125536 KB Output is correct
24 Correct 76 ms 125552 KB Output is correct
25 Correct 79 ms 125696 KB Output is correct
26 Correct 79 ms 125740 KB Output is correct
27 Correct 79 ms 125636 KB Output is correct
28 Correct 79 ms 125688 KB Output is correct
29 Correct 81 ms 125824 KB Output is correct
30 Correct 81 ms 125636 KB Output is correct
31 Correct 79 ms 125764 KB Output is correct
32 Correct 79 ms 125684 KB Output is correct
33 Correct 77 ms 125636 KB Output is correct
34 Correct 78 ms 125744 KB Output is correct
35 Correct 78 ms 125636 KB Output is correct
36 Correct 82 ms 125636 KB Output is correct
37 Correct 76 ms 125636 KB Output is correct
38 Correct 76 ms 125636 KB Output is correct
39 Correct 80 ms 125624 KB Output is correct
40 Correct 79 ms 125600 KB Output is correct
41 Correct 81 ms 125780 KB Output is correct
42 Correct 79 ms 125768 KB Output is correct
43 Correct 78 ms 125728 KB Output is correct
44 Correct 78 ms 125740 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 125536 KB Output is correct
2 Correct 76 ms 125556 KB Output is correct
3 Correct 76 ms 125572 KB Output is correct
4 Correct 75 ms 125508 KB Output is correct
5 Correct 75 ms 125528 KB Output is correct
6 Correct 75 ms 125484 KB Output is correct
7 Correct 79 ms 125508 KB Output is correct
8 Correct 74 ms 125532 KB Output is correct
9 Correct 75 ms 125504 KB Output is correct
10 Correct 75 ms 125556 KB Output is correct
11 Correct 74 ms 125508 KB Output is correct
12 Correct 75 ms 125552 KB Output is correct
13 Correct 74 ms 125528 KB Output is correct
14 Correct 74 ms 125496 KB Output is correct
15 Correct 74 ms 125468 KB Output is correct
16 Correct 74 ms 125520 KB Output is correct
17 Correct 74 ms 125528 KB Output is correct
18 Correct 75 ms 125480 KB Output is correct
19 Correct 75 ms 125540 KB Output is correct
20 Correct 75 ms 125452 KB Output is correct
21 Correct 75 ms 125524 KB Output is correct
22 Correct 74 ms 125528 KB Output is correct
23 Correct 74 ms 125536 KB Output is correct
24 Correct 76 ms 125552 KB Output is correct
25 Correct 79 ms 125696 KB Output is correct
26 Correct 79 ms 125740 KB Output is correct
27 Correct 79 ms 125636 KB Output is correct
28 Correct 79 ms 125688 KB Output is correct
29 Correct 81 ms 125824 KB Output is correct
30 Correct 81 ms 125636 KB Output is correct
31 Correct 79 ms 125764 KB Output is correct
32 Correct 79 ms 125684 KB Output is correct
33 Correct 77 ms 125636 KB Output is correct
34 Correct 78 ms 125744 KB Output is correct
35 Correct 78 ms 125636 KB Output is correct
36 Correct 82 ms 125636 KB Output is correct
37 Correct 76 ms 125636 KB Output is correct
38 Correct 76 ms 125636 KB Output is correct
39 Correct 80 ms 125624 KB Output is correct
40 Correct 79 ms 125600 KB Output is correct
41 Correct 81 ms 125780 KB Output is correct
42 Correct 79 ms 125768 KB Output is correct
43 Correct 78 ms 125728 KB Output is correct
44 Correct 78 ms 125740 KB Output is correct
45 Correct 431 ms 135708 KB Output is correct
46 Correct 442 ms 136288 KB Output is correct
47 Correct 427 ms 135192 KB Output is correct
48 Correct 435 ms 136132 KB Output is correct
49 Correct 432 ms 135280 KB Output is correct
50 Correct 221 ms 136020 KB Output is correct
51 Correct 175 ms 134584 KB Output is correct
52 Correct 372 ms 134856 KB Output is correct
53 Correct 456 ms 134836 KB Output is correct
54 Correct 170 ms 134508 KB Output is correct
55 Correct 175 ms 134472 KB Output is correct
56 Correct 171 ms 134600 KB Output is correct
57 Correct 387 ms 134952 KB Output is correct
58 Correct 370 ms 134980 KB Output is correct
59 Correct 425 ms 134944 KB Output is correct
60 Correct 443 ms 134944 KB Output is correct
61 Correct 432 ms 134852 KB Output is correct
62 Correct 173 ms 134468 KB Output is correct
63 Correct 174 ms 134640 KB Output is correct
64 Correct 173 ms 134768 KB Output is correct
65 Correct 192 ms 134796 KB Output is correct
66 Correct 185 ms 134468 KB Output is correct
67 Correct 440 ms 137400 KB Output is correct
68 Correct 441 ms 137192 KB Output is correct
69 Correct 441 ms 137032 KB Output is correct
70 Correct 445 ms 137028 KB Output is correct
71 Correct 446 ms 139772 KB Output is correct
72 Correct 436 ms 139592 KB Output is correct
73 Correct 427 ms 138072 KB Output is correct
74 Correct 432 ms 138052 KB Output is correct
75 Correct 354 ms 137740 KB Output is correct
76 Correct 350 ms 139592 KB Output is correct
77 Correct 320 ms 139728 KB Output is correct
78 Correct 437 ms 136004 KB Output is correct
79 Correct 439 ms 135620 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 125536 KB Output is correct
2 Correct 76 ms 125556 KB Output is correct
3 Correct 76 ms 125572 KB Output is correct
4 Correct 75 ms 125508 KB Output is correct
5 Correct 75 ms 125528 KB Output is correct
6 Correct 75 ms 125484 KB Output is correct
7 Correct 79 ms 125508 KB Output is correct
8 Correct 74 ms 125532 KB Output is correct
9 Correct 75 ms 125504 KB Output is correct
10 Correct 75 ms 125556 KB Output is correct
11 Correct 74 ms 125508 KB Output is correct
12 Correct 75 ms 125552 KB Output is correct
13 Correct 74 ms 125528 KB Output is correct
14 Correct 74 ms 125496 KB Output is correct
15 Correct 74 ms 125468 KB Output is correct
16 Correct 74 ms 125520 KB Output is correct
17 Correct 74 ms 125528 KB Output is correct
18 Correct 75 ms 125480 KB Output is correct
19 Correct 75 ms 125540 KB Output is correct
20 Correct 75 ms 125452 KB Output is correct
21 Correct 75 ms 125524 KB Output is correct
22 Correct 74 ms 125528 KB Output is correct
23 Correct 74 ms 125536 KB Output is correct
24 Correct 76 ms 125552 KB Output is correct
25 Correct 79 ms 125696 KB Output is correct
26 Correct 79 ms 125740 KB Output is correct
27 Correct 79 ms 125636 KB Output is correct
28 Correct 79 ms 125688 KB Output is correct
29 Correct 81 ms 125824 KB Output is correct
30 Correct 81 ms 125636 KB Output is correct
31 Correct 79 ms 125764 KB Output is correct
32 Correct 79 ms 125684 KB Output is correct
33 Correct 77 ms 125636 KB Output is correct
34 Correct 78 ms 125744 KB Output is correct
35 Correct 78 ms 125636 KB Output is correct
36 Correct 82 ms 125636 KB Output is correct
37 Correct 76 ms 125636 KB Output is correct
38 Correct 76 ms 125636 KB Output is correct
39 Correct 80 ms 125624 KB Output is correct
40 Correct 79 ms 125600 KB Output is correct
41 Correct 81 ms 125780 KB Output is correct
42 Correct 79 ms 125768 KB Output is correct
43 Correct 78 ms 125728 KB Output is correct
44 Correct 78 ms 125740 KB Output is correct
45 Correct 431 ms 135708 KB Output is correct
46 Correct 442 ms 136288 KB Output is correct
47 Correct 427 ms 135192 KB Output is correct
48 Correct 435 ms 136132 KB Output is correct
49 Correct 432 ms 135280 KB Output is correct
50 Correct 221 ms 136020 KB Output is correct
51 Correct 175 ms 134584 KB Output is correct
52 Correct 372 ms 134856 KB Output is correct
53 Correct 456 ms 134836 KB Output is correct
54 Correct 170 ms 134508 KB Output is correct
55 Correct 175 ms 134472 KB Output is correct
56 Correct 171 ms 134600 KB Output is correct
57 Correct 387 ms 134952 KB Output is correct
58 Correct 370 ms 134980 KB Output is correct
59 Correct 425 ms 134944 KB Output is correct
60 Correct 443 ms 134944 KB Output is correct
61 Correct 432 ms 134852 KB Output is correct
62 Correct 173 ms 134468 KB Output is correct
63 Correct 174 ms 134640 KB Output is correct
64 Correct 173 ms 134768 KB Output is correct
65 Correct 192 ms 134796 KB Output is correct
66 Correct 185 ms 134468 KB Output is correct
67 Correct 440 ms 137400 KB Output is correct
68 Correct 441 ms 137192 KB Output is correct
69 Correct 441 ms 137032 KB Output is correct
70 Correct 445 ms 137028 KB Output is correct
71 Correct 446 ms 139772 KB Output is correct
72 Correct 436 ms 139592 KB Output is correct
73 Correct 427 ms 138072 KB Output is correct
74 Correct 432 ms 138052 KB Output is correct
75 Correct 354 ms 137740 KB Output is correct
76 Correct 350 ms 139592 KB Output is correct
77 Correct 320 ms 139728 KB Output is correct
78 Correct 437 ms 136004 KB Output is correct
79 Correct 439 ms 135620 KB Output is correct
80 Correct 4670 ms 206044 KB Output is correct
81 Correct 4679 ms 205352 KB Output is correct
82 Correct 4644 ms 203564 KB Output is correct
83 Correct 4613 ms 205380 KB Output is correct
84 Correct 4667 ms 205940 KB Output is correct
85 Correct 1508 ms 203380 KB Output is correct
86 Correct 1563 ms 204048 KB Output is correct
87 Correct 4085 ms 202960 KB Output is correct
88 Correct 5806 ms 202892 KB Output is correct
89 Correct 1507 ms 213732 KB Output is correct
90 Correct 1530 ms 213684 KB Output is correct
91 Correct 1545 ms 213532 KB Output is correct
92 Correct 4155 ms 217672 KB Output is correct
93 Correct 3980 ms 217580 KB Output is correct
94 Correct 4833 ms 217700 KB Output is correct
95 Correct 4667 ms 217692 KB Output is correct
96 Correct 4591 ms 217636 KB Output is correct
97 Correct 1422 ms 213616 KB Output is correct
98 Correct 1418 ms 213884 KB Output is correct
99 Correct 1489 ms 214632 KB Output is correct
100 Correct 1689 ms 213596 KB Output is correct
101 Correct 1703 ms 213656 KB Output is correct
102 Correct 4995 ms 241064 KB Output is correct
103 Correct 4964 ms 241256 KB Output is correct
104 Correct 4933 ms 238664 KB Output is correct
105 Correct 4993 ms 238428 KB Output is correct
106 Correct 4927 ms 264648 KB Output is correct
107 Correct 4900 ms 264632 KB Output is correct
108 Correct 4782 ms 249028 KB Output is correct
109 Correct 4775 ms 248936 KB Output is correct
110 Correct 3795 ms 263560 KB Output is correct
111 Correct 3999 ms 264512 KB Output is correct
112 Correct 3270 ms 264560 KB Output is correct
113 Correct 4647 ms 218044 KB Output is correct
114 Correct 4695 ms 219792 KB Output is correct