oj.uz

Submission #40834

# Submission time Handle Problem Language Result Execution time Memory
40834 2018-02-08T17:17:16 Z DoanPhuDuc Port Facility (JOI17_port_facility) C++
100 / 100
 1309 ms 636032 KB 
#include <bits/stdc++.h>

#define FOR(x, a, b) for (int x = a; x <= b; ++x)
#define FOD(x, a, b) for (int x = a; x >= b; --x)
#define REP(x, a, b) for (int x = a; x < b; ++x)
#define DEBUG(X) { cout << #X << " = " << X << endl; }
#define PR(A, n) { cout << #A << " = "; FOR(_, 1, n) cout << A[_] << " "; cout << endl; }
#define PR0(A, n)  { cout << #A << " = "; REP(_, 0, n) cout << A[_] << " "; cout << endl; }
#define BitCount(x) __builtin_popcount(x)

using namespace std;

typedef pair <int, int> II;
typedef long long LL;

const int N = 2 * (1e6 + 10);
const int INF = 0x3f3f3f3f;
const int BASE = 1e9 + 7;

int n;
int a[N], b[N], c[N], pos[N];

struct Segment {
    int l, r;
    Segment () {}
    Segment (int l, int r) : l(l), r(r) {}
    bool operator < (const Segment &that) const {
        return l < that.l;
    }
} seg[N];

struct SegmentTree {
    #define m ((l + r) >> 1)
    int st[2][4 * N];
    void Build(int k, int l, int r) {
        if (l == r) {
            st[0][k] = (a[l] > l ? a[l] : 0);
            st[1][k] = (a[l] < l ? a[l] : INF);
            return;
        }
        Build(k << 1, l, m);
        Build(k << 1 | 1, m + 1, r);
        st[0][k] = max(st[0][k << 1], st[0][k << 1 | 1]);
        st[1][k] = min(st[1][k << 1], st[1][k << 1 | 1]);
    }
    void Push1(int k, int l, int r, int i, int j, int val, int u, queue <int> &Q) {
        if (l > j || r < i) return;
        if (st[0][k] < val) return;
        if (l == r) {
            st[0][k] = 0;
            int v = pos[l];
            if (v == u) return;
            if (c[v] == -1) {
                c[v] = c[u] ^ 1;
                Q.push(v);
            }
            return;
        }
        Push1(k << 1, l, m, i, j, val, u, Q);
        Push1(k << 1 | 1, m + 1, r, i, j, val, u, Q);
        st[0][k] = max(st[0][k << 1], st[0][k << 1 | 1]);
    }
    void Push2(int k, int l, int r, int i, int j, int val, int u, queue <int> &Q) {
        if (l > j || r < i) return;
        if (st[1][k] > val) return;
        if (l == r) {
            st[1][k] = INF;
            int v = pos[l];
            if (v == u) return;
            if (c[v] == -1) {
                c[v] = c[u] ^ 1;
                Q.push(v);
            }
            return;
        }
        Push2(k << 1, l, m, i, j, val, u, Q);
        Push2(k << 1 | 1, m + 1, r, i, j, val, u, Q);
        st[1][k] = min(st[1][k << 1], st[1][k << 1 | 1]);
    }
    void Disable(int k, int l, int r, int i) {
        if (l == r) {
            st[0][k] = 0;
            st[1][k] = INF;
            return;
        }
        if (i <= m) Disable(k << 1, l, m, i);
            else Disable(k << 1 | 1, m + 1, r, i);
        st[0][k] = max(st[0][k << 1], st[0][k << 1 | 1]);
        st[1][k] = min(st[1][k << 1], st[1][k << 1 | 1]);
    }
    #undef m
} ST;

bool Check(vector <Segment> &A) {
    sort(A.begin(), A.end());
    memset(b, -1, sizeof b);
    REP(i, 0, A.size()) {
        b[A[i].l] = A[i].r;
        b[A[i].r] = A[i].l;
    }
    stack <int> ST;
    FOR(timer, 1, 2 * n) {
        if (b[timer] == -1) continue;
        if (b[timer] > timer) {
            int l = timer, r = b[timer];
            if (ST.size() == 0 || ST.top() > r) ST.push(r);
                else return false;
        } else {
            int r = timer;
            if (ST.size() && ST.top() == r) ST.pop();
                else return false;
        }
    }
    return true;
}

int main() {
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif // LOCAL
    scanf("%d", &n);
    FOR(i, 1, n) {
        int l, r; scanf("%d%d", &l, &r);
        seg[i] = Segment(l, r);
    }
    sort(seg + 1, seg + n + 1);
    memset(c, -1, sizeof c);
    FOR(i, 1, n) {
        int l = seg[i].l, r = seg[i].r;
        pos[l] = i; pos[r] = i;
        a[l] = r; a[r] = l;
    }
    ST.Build(1, 1, 2 * n);
    LL ans = 1;
    FOR(i, 1, n) if (c[i] == -1) {
      //  DEBUG(i);
        queue <int> Q; Q.push(i);
        ST.Disable(1, 1, 2 * n, seg[i].l);
        ST.Disable(1, 1, 2 * n, seg[i].r);
        c[i] = 0;
        while (Q.size()) {
            int u = Q.front(); Q.pop();
            int l = seg[u].l, r = seg[u].r;
            //cout << u << " = " << l << " " << r << endl;
            ST.Push1(1, 1, 2 * n, l, r, r, u, Q);
            ST.Push2(1, 1, 2 * n, l, r, l, u, Q);
        }
        ans = ans * 2 % BASE;
    }
    vector <Segment> Z[2];
    FOR(i, 1, n)  Z[c[i]].push_back(seg[i]);
    FOR(i, 0, 1) if (Check(Z[i]) == false) {
        puts("0");
        return 0;
    }
    cout << ans;
    return 0;
}

Compilation message

port_facility.cpp: In function 'bool Check(std::vector<Segment>&)':
port_facility.cpp:5:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(x, a, b) for (int x = a; x < b; ++x)
                                        ^
port_facility.cpp:97:5: note: in expansion of macro 'REP'
     REP(i, 0, A.size()) {
     ^
port_facility.cpp:105:17: warning: unused variable 'l' [-Wunused-variable]
             int l = timer, r = b[timer];
                 ^
port_facility.cpp: In function 'int main()':
port_facility.cpp:122:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
port_facility.cpp:124:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int l, r; scanf("%d%d", &l, &r);
                                        ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 15992 KB Output is correct
2 Correct 14 ms 16096 KB Output is correct
3 Correct 13 ms 16096 KB Output is correct
4 Correct 14 ms 16096 KB Output is correct
5 Correct 14 ms 16096 KB Output is correct
6 Correct 13 ms 16096 KB Output is correct
7 Correct 14 ms 16112 KB Output is correct
8 Correct 14 ms 16240 KB Output is correct
9 Correct 13 ms 16240 KB Output is correct
10 Correct 14 ms 16240 KB Output is correct
11 Correct 13 ms 16240 KB Output is correct
12 Correct 13 ms 16240 KB Output is correct
13 Correct 14 ms 16240 KB Output is correct
14 Correct 16 ms 16240 KB Output is correct
15 Correct 13 ms 16240 KB Output is correct
16 Correct 13 ms 16296 KB Output is correct
17 Correct 13 ms 16296 KB Output is correct
18 Correct 13 ms 16296 KB Output is correct
19 Correct 13 ms 16296 KB Output is correct
20 Correct 14 ms 16296 KB Output is correct
21 Correct 14 ms 16296 KB Output is correct
22 Correct 14 ms 16296 KB Output is correct
23 Correct 22 ms 16296 KB Output is correct
24 Correct 14 ms 16296 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 15992 KB Output is correct
2 Correct 14 ms 16096 KB Output is correct
3 Correct 13 ms 16096 KB Output is correct
4 Correct 14 ms 16096 KB Output is correct
5 Correct 14 ms 16096 KB Output is correct
6 Correct 13 ms 16096 KB Output is correct
7 Correct 14 ms 16112 KB Output is correct
8 Correct 14 ms 16240 KB Output is correct
9 Correct 13 ms 16240 KB Output is correct
10 Correct 14 ms 16240 KB Output is correct
11 Correct 13 ms 16240 KB Output is correct
12 Correct 13 ms 16240 KB Output is correct
13 Correct 14 ms 16240 KB Output is correct
14 Correct 16 ms 16240 KB Output is correct
15 Correct 13 ms 16240 KB Output is correct
16 Correct 13 ms 16296 KB Output is correct
17 Correct 13 ms 16296 KB Output is correct
18 Correct 13 ms 16296 KB Output is correct
19 Correct 13 ms 16296 KB Output is correct
20 Correct 14 ms 16296 KB Output is correct
21 Correct 14 ms 16296 KB Output is correct
22 Correct 14 ms 16296 KB Output is correct
23 Correct 22 ms 16296 KB Output is correct
24 Correct 14 ms 16296 KB Output is correct
25 Correct 15 ms 16364 KB Output is correct
26 Correct 19 ms 16364 KB Output is correct
27 Correct 15 ms 16408 KB Output is correct
28 Correct 15 ms 16408 KB Output is correct
29 Correct 15 ms 16408 KB Output is correct
30 Correct 15 ms 16408 KB Output is correct
31 Correct 15 ms 16408 KB Output is correct
32 Correct 15 ms 16444 KB Output is correct
33 Correct 14 ms 16444 KB Output is correct
34 Correct 15 ms 16444 KB Output is correct
35 Correct 16 ms 16444 KB Output is correct
36 Correct 15 ms 16444 KB Output is correct
37 Correct 15 ms 16444 KB Output is correct
38 Correct 14 ms 16444 KB Output is correct
39 Correct 18 ms 16444 KB Output is correct
40 Correct 16 ms 16444 KB Output is correct
41 Correct 14 ms 16444 KB Output is correct
42 Correct 14 ms 16444 KB Output is correct
43 Correct 14 ms 16444 KB Output is correct
44 Correct 14 ms 16444 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 15992 KB Output is correct
2 Correct 14 ms 16096 KB Output is correct
3 Correct 13 ms 16096 KB Output is correct
4 Correct 14 ms 16096 KB Output is correct
5 Correct 14 ms 16096 KB Output is correct
6 Correct 13 ms 16096 KB Output is correct
7 Correct 14 ms 16112 KB Output is correct
8 Correct 14 ms 16240 KB Output is correct
9 Correct 13 ms 16240 KB Output is correct
10 Correct 14 ms 16240 KB Output is correct
11 Correct 13 ms 16240 KB Output is correct
12 Correct 13 ms 16240 KB Output is correct
13 Correct 14 ms 16240 KB Output is correct
14 Correct 16 ms 16240 KB Output is correct
15 Correct 13 ms 16240 KB Output is correct
16 Correct 13 ms 16296 KB Output is correct
17 Correct 13 ms 16296 KB Output is correct
18 Correct 13 ms 16296 KB Output is correct
19 Correct 13 ms 16296 KB Output is correct
20 Correct 14 ms 16296 KB Output is correct
21 Correct 14 ms 16296 KB Output is correct
22 Correct 14 ms 16296 KB Output is correct
23 Correct 22 ms 16296 KB Output is correct
24 Correct 14 ms 16296 KB Output is correct
25 Correct 15 ms 16364 KB Output is correct
26 Correct 19 ms 16364 KB Output is correct
27 Correct 15 ms 16408 KB Output is correct
28 Correct 15 ms 16408 KB Output is correct
29 Correct 15 ms 16408 KB Output is correct
30 Correct 15 ms 16408 KB Output is correct
31 Correct 15 ms 16408 KB Output is correct
32 Correct 15 ms 16444 KB Output is correct
33 Correct 14 ms 16444 KB Output is correct
34 Correct 15 ms 16444 KB Output is correct
35 Correct 16 ms 16444 KB Output is correct
36 Correct 15 ms 16444 KB Output is correct
37 Correct 15 ms 16444 KB Output is correct
38 Correct 14 ms 16444 KB Output is correct
39 Correct 18 ms 16444 KB Output is correct
40 Correct 16 ms 16444 KB Output is correct
41 Correct 14 ms 16444 KB Output is correct
42 Correct 14 ms 16444 KB Output is correct
43 Correct 14 ms 16444 KB Output is correct
44 Correct 14 ms 16444 KB Output is correct
45 Correct 115 ms 25048 KB Output is correct
46 Correct 117 ms 26348 KB Output is correct
47 Correct 121 ms 27680 KB Output is correct
48 Correct 132 ms 28872 KB Output is correct
49 Correct 120 ms 30120 KB Output is correct
50 Correct 116 ms 31460 KB Output is correct
51 Correct 121 ms 32812 KB Output is correct
52 Correct 124 ms 33980 KB Output is correct
53 Correct 94 ms 35496 KB Output is correct
54 Correct 74 ms 36468 KB Output is correct
55 Correct 78 ms 37736 KB Output is correct
56 Correct 76 ms 38992 KB Output is correct
57 Correct 110 ms 40412 KB Output is correct
58 Correct 121 ms 41560 KB Output is correct
59 Correct 121 ms 42820 KB Output is correct
60 Correct 127 ms 44208 KB Output is correct
61 Correct 124 ms 45316 KB Output is correct
62 Correct 124 ms 46576 KB Output is correct
63 Correct 122 ms 47960 KB Output is correct
64 Correct 114 ms 49048 KB Output is correct
65 Correct 119 ms 50472 KB Output is correct
66 Correct 103 ms 51544 KB Output is correct
67 Correct 98 ms 52888 KB Output is correct
68 Correct 106 ms 54276 KB Output is correct
69 Correct 89 ms 55560 KB Output is correct
70 Correct 86 ms 56824 KB Output is correct
71 Correct 78 ms 57960 KB Output is correct
72 Correct 102 ms 59216 KB Output is correct
73 Correct 85 ms 60728 KB Output is correct
74 Correct 83 ms 61916 KB Output is correct
75 Correct 94 ms 63044 KB Output is correct
76 Correct 106 ms 64328 KB Output is correct
77 Correct 104 ms 65692 KB Output is correct
78 Correct 123 ms 66720 KB Output is correct
79 Correct 127 ms 68176 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 15992 KB Output is correct
2 Correct 14 ms 16096 KB Output is correct
3 Correct 13 ms 16096 KB Output is correct
4 Correct 14 ms 16096 KB Output is correct
5 Correct 14 ms 16096 KB Output is correct
6 Correct 13 ms 16096 KB Output is correct
7 Correct 14 ms 16112 KB Output is correct
8 Correct 14 ms 16240 KB Output is correct
9 Correct 13 ms 16240 KB Output is correct
10 Correct 14 ms 16240 KB Output is correct
11 Correct 13 ms 16240 KB Output is correct
12 Correct 13 ms 16240 KB Output is correct
13 Correct 14 ms 16240 KB Output is correct
14 Correct 16 ms 16240 KB Output is correct
15 Correct 13 ms 16240 KB Output is correct
16 Correct 13 ms 16296 KB Output is correct
17 Correct 13 ms 16296 KB Output is correct
18 Correct 13 ms 16296 KB Output is correct
19 Correct 13 ms 16296 KB Output is correct
20 Correct 14 ms 16296 KB Output is correct
21 Correct 14 ms 16296 KB Output is correct
22 Correct 14 ms 16296 KB Output is correct
23 Correct 22 ms 16296 KB Output is correct
24 Correct 14 ms 16296 KB Output is correct
25 Correct 15 ms 16364 KB Output is correct
26 Correct 19 ms 16364 KB Output is correct
27 Correct 15 ms 16408 KB Output is correct
28 Correct 15 ms 16408 KB Output is correct
29 Correct 15 ms 16408 KB Output is correct
30 Correct 15 ms 16408 KB Output is correct
31 Correct 15 ms 16408 KB Output is correct
32 Correct 15 ms 16444 KB Output is correct
33 Correct 14 ms 16444 KB Output is correct
34 Correct 15 ms 16444 KB Output is correct
35 Correct 16 ms 16444 KB Output is correct
36 Correct 15 ms 16444 KB Output is correct
37 Correct 15 ms 16444 KB Output is correct
38 Correct 14 ms 16444 KB Output is correct
39 Correct 18 ms 16444 KB Output is correct
40 Correct 16 ms 16444 KB Output is correct
41 Correct 14 ms 16444 KB Output is correct
42 Correct 14 ms 16444 KB Output is correct
43 Correct 14 ms 16444 KB Output is correct
44 Correct 14 ms 16444 KB Output is correct
45 Correct 115 ms 25048 KB Output is correct
46 Correct 117 ms 26348 KB Output is correct
47 Correct 121 ms 27680 KB Output is correct
48 Correct 132 ms 28872 KB Output is correct
49 Correct 120 ms 30120 KB Output is correct
50 Correct 116 ms 31460 KB Output is correct
51 Correct 121 ms 32812 KB Output is correct
52 Correct 124 ms 33980 KB Output is correct
53 Correct 94 ms 35496 KB Output is correct
54 Correct 74 ms 36468 KB Output is correct
55 Correct 78 ms 37736 KB Output is correct
56 Correct 76 ms 38992 KB Output is correct
57 Correct 110 ms 40412 KB Output is correct
58 Correct 121 ms 41560 KB Output is correct
59 Correct 121 ms 42820 KB Output is correct
60 Correct 127 ms 44208 KB Output is correct
61 Correct 124 ms 45316 KB Output is correct
62 Correct 124 ms 46576 KB Output is correct
63 Correct 122 ms 47960 KB Output is correct
64 Correct 114 ms 49048 KB Output is correct
65 Correct 119 ms 50472 KB Output is correct
66 Correct 103 ms 51544 KB Output is correct
67 Correct 98 ms 52888 KB Output is correct
68 Correct 106 ms 54276 KB Output is correct
69 Correct 89 ms 55560 KB Output is correct
70 Correct 86 ms 56824 KB Output is correct
71 Correct 78 ms 57960 KB Output is correct
72 Correct 102 ms 59216 KB Output is correct
73 Correct 85 ms 60728 KB Output is correct
74 Correct 83 ms 61916 KB Output is correct
75 Correct 94 ms 63044 KB Output is correct
76 Correct 106 ms 64328 KB Output is correct
77 Correct 104 ms 65692 KB Output is correct
78 Correct 123 ms 66720 KB Output is correct
79 Correct 127 ms 68176 KB Output is correct
80 Correct 1309 ms 140684 KB Output is correct
81 Correct 1272 ms 155096 KB Output is correct
82 Correct 1232 ms 169652 KB Output is correct
83 Correct 1237 ms 184336 KB Output is correct
84 Correct 1242 ms 198916 KB Output is correct
85 Correct 1172 ms 212976 KB Output is correct
86 Correct 1276 ms 227920 KB Output is correct
87 Correct 1186 ms 241796 KB Output is correct
88 Correct 945 ms 260132 KB Output is correct
89 Correct 735 ms 270772 KB Output is correct
90 Correct 758 ms 285428 KB Output is correct
91 Correct 755 ms 299944 KB Output is correct
92 Correct 1226 ms 314552 KB Output is correct
93 Correct 1185 ms 329116 KB Output is correct
94 Correct 1293 ms 345644 KB Output is correct
95 Correct 1207 ms 358780 KB Output is correct
96 Correct 1191 ms 373300 KB Output is correct
97 Correct 1256 ms 389248 KB Output is correct
98 Correct 1235 ms 402284 KB Output is correct
99 Correct 1216 ms 416680 KB Output is correct
100 Correct 1108 ms 430996 KB Output is correct
101 Correct 1126 ms 445688 KB Output is correct
102 Correct 789 ms 462260 KB Output is correct
103 Correct 815 ms 476844 KB Output is correct
104 Correct 797 ms 491960 KB Output is correct
105 Correct 780 ms 506648 KB Output is correct
106 Correct 755 ms 520336 KB Output is correct
107 Correct 755 ms 534888 KB Output is correct
108 Correct 745 ms 550228 KB Output is correct
109 Correct 861 ms 564864 KB Output is correct
110 Correct 976 ms 576784 KB Output is correct
111 Correct 1006 ms 591392 KB Output is correct
112 Correct 1022 ms 605872 KB Output is correct
113 Correct 1223 ms 621608 KB Output is correct
114 Correct 1248 ms 636032 KB Output is correct