oj.uz

Submission #173751

# Submission time Handle Problem Language Result Execution time Memory
173751 2020-01-05T09:52:35 Z gs18103 Port Facility (JOI17_port_facility) C++14
100 / 100
 4835 ms 171412 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define em emplace
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 1010101;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;

struct containor {
    int s, e, c;
} arr[MAX];
int idx1[2*MAX], idx2[2*MAX], n;

struct SEG {
    vector <pii> tree;
    void init(int n) {
        tree.resize(4*n+10);
        for(int i = 0; i < tree.size(); i++) tree[i] = make_pair(-INF, 0);
    }
    void update(int node, int s, int e, int k, int val) {
        if(s == e) {
            tree[node] = make_pair(val, k);
            return;
        }
        int m = (s + e) / 2;
        if(k <= m) update(node*2, s, m, k, val);
        else update(node*2+1, m+1, e, k, val);
        tree[node] = max(tree[node*2], tree[node*2+1]);
    }
    pii cal(int node, int s, int e, int l, int r) {
        if(s > r || e < l) return make_pair(-INF, 0);
        if(s >= l && e <= r) return tree[node];
        int m = (s + e) / 2;
        return max(cal(node*2, s, m, l, r), cal(node*2+1, m+1, e, l, r));
    }
} st1, st2;

queue <pii> q;

void bfs(int x, int c) {
    arr[x].c = c;
    pii temp;
    temp = st1.cal(1, 1, 2*n, arr[x].s+1, arr[x].e-1);
    while(temp.fi > arr[x].e) {
        int i = idx1[temp.se];
        st1.update(1, 1, 2*n, arr[i].s, -INF);
        st2.update(1, 1, 2*n, arr[i].e, -INF);
        q.em(i, 3-c);
        temp = st1.cal(1, 1, 2*n, arr[x].s+1, arr[x].e-1);
    }
    temp = st2.cal(1, 1, 2*n, arr[x].s+1, arr[x].e-1);
    while(temp.fi > -arr[x].s) {
        int i = idx2[temp.se];
        st1.update(1, 1, 2*n, arr[i].s, -INF);
        st2.update(1, 1, 2*n, arr[i].e, -INF);
        q.em(i, 3-c);
        temp = st2.cal(1, 1, 2*n, arr[x].s+1, arr[x].e-1);
    }
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    cin >> n;
    st1.init(2*n), st2.init(2*n);
    for(int i = 1; i <= n; i++) {
        cin >> arr[i].s >> arr[i].e;
        st1.update(1, 1, 2*n, arr[i].s, arr[i].e);
        st2.update(1, 1, 2*n, arr[i].e, -arr[i].s);
        idx1[arr[i].s] = idx2[arr[i].e] = i;
    }

    int ans = 1;
    for(int i = 1; i <= n; i++) {
        if(arr[i].c == 0) {
            st1.update(1, 1, 2*n, arr[i].s, -INF);
            st2.update(1, 1, 2*n, arr[i].e, -INF);
            q.em(i, 1);
            while(!q.empty()) {
                int x = q.front().fi, c = q.front().se;
                q.pop();
                bfs(x, c);
            }
            ans = (ans * 2) % mod;
        }
    }
    
    sort(arr+1, arr+n+1, [](containor a, containor b) {
        return a.s < b.s;
    });
    for(int i = 1; i <= n; i++) {
        pii c1 = st1.cal(1, 1, 2*n, arr[i].s, arr[i].e);
        pii c2 = st2.cal(1, 1, 2*n, arr[i].s, arr[i].e);
        if(c1.fi != -INF && (c1.fi == arr[i].c || c2.fi == -arr[i].c)) {
            return !(cout << 0);
        }
        st1.update(1, 1, 2*n, arr[i].e, arr[i].c);
        st2.update(1, 1, 2*n, arr[i].e, -arr[i].c);
    }
    cout << ans;
}

Compilation message

port_facility.cpp: In member function 'void SEG::init(int)':
port_facility.cpp:27:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < tree.size(); i++) tree[i] = make_pair(-INF, 0);
                        ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 7 ms 632 KB Output is correct
26 Correct 7 ms 888 KB Output is correct
27 Correct 7 ms 760 KB Output is correct
28 Correct 7 ms 632 KB Output is correct
29 Correct 7 ms 768 KB Output is correct
30 Correct 7 ms 760 KB Output is correct
31 Correct 7 ms 632 KB Output is correct
32 Correct 7 ms 760 KB Output is correct
33 Correct 6 ms 760 KB Output is correct
34 Correct 6 ms 760 KB Output is correct
35 Correct 6 ms 760 KB Output is correct
36 Correct 7 ms 632 KB Output is correct
37 Correct 5 ms 760 KB Output is correct
38 Correct 5 ms 760 KB Output is correct
39 Correct 6 ms 760 KB Output is correct
40 Correct 6 ms 760 KB Output is correct
41 Correct 7 ms 760 KB Output is correct
42 Correct 7 ms 760 KB Output is correct
43 Correct 5 ms 760 KB Output is correct
44 Correct 6 ms 760 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 7 ms 632 KB Output is correct
26 Correct 7 ms 888 KB Output is correct
27 Correct 7 ms 760 KB Output is correct
28 Correct 7 ms 632 KB Output is correct
29 Correct 7 ms 768 KB Output is correct
30 Correct 7 ms 760 KB Output is correct
31 Correct 7 ms 632 KB Output is correct
32 Correct 7 ms 760 KB Output is correct
33 Correct 6 ms 760 KB Output is correct
34 Correct 6 ms 760 KB Output is correct
35 Correct 6 ms 760 KB Output is correct
36 Correct 7 ms 632 KB Output is correct
37 Correct 5 ms 760 KB Output is correct
38 Correct 5 ms 760 KB Output is correct
39 Correct 6 ms 760 KB Output is correct
40 Correct 6 ms 760 KB Output is correct
41 Correct 7 ms 760 KB Output is correct
42 Correct 7 ms 760 KB Output is correct
43 Correct 5 ms 760 KB Output is correct
44 Correct 6 ms 760 KB Output is correct
45 Correct 358 ms 17000 KB Output is correct
46 Correct 393 ms 16996 KB Output is correct
47 Correct 360 ms 16980 KB Output is correct
48 Correct 367 ms 16996 KB Output is correct
49 Correct 360 ms 17040 KB Output is correct
50 Correct 281 ms 17016 KB Output is correct
51 Correct 307 ms 17052 KB Output is correct
52 Correct 286 ms 17112 KB Output is correct
53 Correct 405 ms 16220 KB Output is correct
54 Correct 252 ms 17052 KB Output is correct
55 Correct 253 ms 16644 KB Output is correct
56 Correct 248 ms 16852 KB Output is correct
57 Correct 313 ms 17068 KB Output is correct
58 Correct 308 ms 17016 KB Output is correct
59 Correct 345 ms 17152 KB Output is correct
60 Correct 361 ms 17016 KB Output is correct
61 Correct 365 ms 17000 KB Output is correct
62 Correct 254 ms 17272 KB Output is correct
63 Correct 271 ms 17136 KB Output is correct
64 Correct 265 ms 16988 KB Output is correct
65 Correct 306 ms 17216 KB Output is correct
66 Correct 294 ms 17504 KB Output is correct
67 Correct 338 ms 17528 KB Output is correct
68 Correct 348 ms 17232 KB Output is correct
69 Correct 354 ms 17528 KB Output is correct
70 Correct 361 ms 17400 KB Output is correct
71 Correct 335 ms 17100 KB Output is correct
72 Correct 339 ms 17024 KB Output is correct
73 Correct 348 ms 17008 KB Output is correct
74 Correct 348 ms 17028 KB Output is correct
75 Correct 280 ms 16988 KB Output is correct
76 Correct 289 ms 16980 KB Output is correct
77 Correct 272 ms 16900 KB Output is correct
78 Correct 360 ms 17016 KB Output is correct
79 Correct 355 ms 16888 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 7 ms 632 KB Output is correct
26 Correct 7 ms 888 KB Output is correct
27 Correct 7 ms 760 KB Output is correct
28 Correct 7 ms 632 KB Output is correct
29 Correct 7 ms 768 KB Output is correct
30 Correct 7 ms 760 KB Output is correct
31 Correct 7 ms 632 KB Output is correct
32 Correct 7 ms 760 KB Output is correct
33 Correct 6 ms 760 KB Output is correct
34 Correct 6 ms 760 KB Output is correct
35 Correct 6 ms 760 KB Output is correct
36 Correct 7 ms 632 KB Output is correct
37 Correct 5 ms 760 KB Output is correct
38 Correct 5 ms 760 KB Output is correct
39 Correct 6 ms 760 KB Output is correct
40 Correct 6 ms 760 KB Output is correct
41 Correct 7 ms 760 KB Output is correct
42 Correct 7 ms 760 KB Output is correct
43 Correct 5 ms 760 KB Output is correct
44 Correct 6 ms 760 KB Output is correct
45 Correct 358 ms 17000 KB Output is correct
46 Correct 393 ms 16996 KB Output is correct
47 Correct 360 ms 16980 KB Output is correct
48 Correct 367 ms 16996 KB Output is correct
49 Correct 360 ms 17040 KB Output is correct
50 Correct 281 ms 17016 KB Output is correct
51 Correct 307 ms 17052 KB Output is correct
52 Correct 286 ms 17112 KB Output is correct
53 Correct 405 ms 16220 KB Output is correct
54 Correct 252 ms 17052 KB Output is correct
55 Correct 253 ms 16644 KB Output is correct
56 Correct 248 ms 16852 KB Output is correct
57 Correct 313 ms 17068 KB Output is correct
58 Correct 308 ms 17016 KB Output is correct
59 Correct 345 ms 17152 KB Output is correct
60 Correct 361 ms 17016 KB Output is correct
61 Correct 365 ms 17000 KB Output is correct
62 Correct 254 ms 17272 KB Output is correct
63 Correct 271 ms 17136 KB Output is correct
64 Correct 265 ms 16988 KB Output is correct
65 Correct 306 ms 17216 KB Output is correct
66 Correct 294 ms 17504 KB Output is correct
67 Correct 338 ms 17528 KB Output is correct
68 Correct 348 ms 17232 KB Output is correct
69 Correct 354 ms 17528 KB Output is correct
70 Correct 361 ms 17400 KB Output is correct
71 Correct 335 ms 17100 KB Output is correct
72 Correct 339 ms 17024 KB Output is correct
73 Correct 348 ms 17008 KB Output is correct
74 Correct 348 ms 17028 KB Output is correct
75 Correct 280 ms 16988 KB Output is correct
76 Correct 289 ms 16980 KB Output is correct
77 Correct 272 ms 16900 KB Output is correct
78 Correct 360 ms 17016 KB Output is correct
79 Correct 355 ms 16888 KB Output is correct
80 Correct 4354 ms 167896 KB Output is correct
81 Correct 4407 ms 167928 KB Output is correct
82 Correct 4420 ms 167672 KB Output is correct
83 Correct 4389 ms 167820 KB Output is correct
84 Correct 4355 ms 167692 KB Output is correct
85 Correct 3748 ms 168424 KB Output is correct
86 Correct 3929 ms 168300 KB Output is correct
87 Correct 3724 ms 167716 KB Output is correct
88 Correct 4835 ms 159868 KB Output is correct
89 Correct 3233 ms 168096 KB Output is correct
90 Correct 3273 ms 164144 KB Output is correct
91 Correct 3218 ms 164048 KB Output is correct
92 Correct 3909 ms 167672 KB Output is correct
93 Correct 3774 ms 167788 KB Output is correct
94 Correct 4535 ms 167640 KB Output is correct
95 Correct 4516 ms 167668 KB Output is correct
96 Correct 4329 ms 167712 KB Output is correct
97 Correct 3655 ms 169060 KB Output is correct
98 Correct 3836 ms 168440 KB Output is correct
99 Correct 3487 ms 169924 KB Output is correct
100 Correct 4264 ms 170848 KB Output is correct
101 Correct 4333 ms 170792 KB Output is correct
102 Correct 4659 ms 171192 KB Output is correct
103 Correct 4509 ms 171412 KB Output is correct
104 Correct 4496 ms 170520 KB Output is correct
105 Correct 4515 ms 171308 KB Output is correct
106 Correct 4447 ms 168168 KB Output is correct
107 Correct 4476 ms 168108 KB Output is correct
108 Correct 4430 ms 167852 KB Output is correct
109 Correct 4476 ms 168156 KB Output is correct
110 Correct 3493 ms 167696 KB Output is correct
111 Correct 3582 ms 167912 KB Output is correct
112 Correct 3523 ms 167832 KB Output is correct
113 Correct 4517 ms 167736 KB Output is correct
114 Correct 4443 ms 167828 KB Output is correct