oj.uz

Submission #107330

# Submission time Handle Problem Language Result Execution time Memory
107330 2019-04-23T10:59:34 Z popovicirobert Port Facility (JOI17_port_facility) C++14
78 / 100
 6000 ms 246016 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

using namespace std;

const int MOD = (int) 1e9 + 7;
const int INF = (int) 1e9;

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

struct SegTree {

    vector <int> aint;
    int n;

    inline void init(int _n) {
        n = _n;
        aint.resize(4 * n + 1, -INF);
    }

    void update(int nod, int left, int right, int pos, int cur) {
        if(left == right) {
            aint[nod] = cur;
        }
        else {
            int mid = (left + right) / 2;

            if(pos <= mid) update(2 * nod, left, mid, pos, cur);
            else update(2 * nod + 1, mid + 1, right, pos, cur);

            aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
        }
    }

    int query(int nod, int left, int right, int l, int r) {
        if(l <= left && right <= r) {
            return aint[nod];
        }
        else {
            int mid = (left + right) / 2;
            int ans = -INF;

            if(l <= mid) ans = max(ans, query(2 * nod, left, mid, l, r));

            if(mid < r) ans = max(ans, query(2 * nod + 1, mid + 1, right, l, r));

            return ans;
        }
    }

    void update(int pos, int cur) {
        update(1, 1, n, pos, cur);
    }

    int query(int l, int r) {
        return query(1, 1, n, l, r);
    }

};


SegTree stl, str;

vector < pair <int, int> > arr;
vector <int> col, vis, who;
int n;

void dfs(int nod, int c) {

    col[nod] = c;
    vis[nod] = 1;

    while(1) {

        int cur = str.query(arr[nod].first, arr[nod].second);

        if(cur <= arr[nod].second) {
            break;
        }

        int id = who[cur];

        str.update(arr[id].first, -INF);

        if(vis[id] == 0) {
             dfs(id, c ^ 1);
        }

    }

    while(1) {

        int cur = -stl.query(arr[nod].first, arr[nod].second);

        if(cur >= arr[nod].first) {
            break;
        }

        int id = who[cur];

        stl.update(arr[id].second, -INF);

        if(vis[id] == 0) {
             dfs(id, c ^ 1);
        }

    }

}

struct Fenwick {

    vector <int> aib;
    int n;

    inline void init(int _n) {
        n = _n;
        aib.resize(n + 1);
    }

    inline void update(int pos) {
        for(int i = pos; i <= n; i += lsb(i)) {
            aib[i]++;
        }
    }

    inline int query(int pos) {
        int ans = 0;
        for(int i = pos; i > 0; i -= lsb(i)) {
            ans += aib[i];
        }
        return ans;
    }

    inline int sum(int l, int r) {
        return query(r) - query(l - 1);
    }

};


int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n;

    arr.resize(n + 1);
    stl.init(2 * n), str.init(2 * n);
    who.resize(2 * n + 1);

    for(i = 1; i <= n; i++) {
        cin >> arr[i].first >> arr[i].second;

        str.update(arr[i].first, arr[i].second);
        stl.update(arr[i].second, -arr[i].first);

        who[arr[i].first] = who[arr[i].second] = i;
    }

    vis.resize(n + 1), col.resize(n + 1);
    int ans = 1;

    for(i = 1; i <= n; i++) {
        if(vis[i] == 0) {
            dfs(i, 0);
            ans *= 2;
            mod(ans);
        }
    }


    Fenwick fen[2];

    for(i = 0; i < 2; i++) {
        fen[i].init(2 * n);
    }

    vector <int> ord(n + 1);
    iota(ord.begin(), ord.end(), 0);

    sort(ord.begin(), ord.end(), [&](const int &a, const int &b) {

            return arr[a].first < arr[b].first;

         });

    for(i = 1; i <= n; i++) {

        int id = ord[i];

        if(fen[col[id]].sum(arr[id].first, arr[id].second) > 0) {
            ans = 0;
        }

        fen[col[id]].update(arr[id].second);

    }


    cout << ans;

    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 5 ms 640 KB Output is correct
26 Correct 5 ms 684 KB Output is correct
27 Correct 4 ms 640 KB Output is correct
28 Correct 7 ms 684 KB Output is correct
29 Correct 5 ms 640 KB Output is correct
30 Correct 5 ms 768 KB Output is correct
31 Correct 7 ms 684 KB Output is correct
32 Correct 5 ms 684 KB Output is correct
33 Correct 6 ms 740 KB Output is correct
34 Correct 5 ms 768 KB Output is correct
35 Correct 5 ms 640 KB Output is correct
36 Correct 7 ms 640 KB Output is correct
37 Correct 6 ms 768 KB Output is correct
38 Correct 7 ms 684 KB Output is correct
39 Correct 6 ms 640 KB Output is correct
40 Correct 4 ms 640 KB Output is correct
41 Correct 4 ms 812 KB Output is correct
42 Correct 5 ms 768 KB Output is correct
43 Correct 5 ms 768 KB Output is correct
44 Correct 4 ms 768 KB Output is correct
45 Correct 251 ms 13940 KB Output is correct
46 Correct 269 ms 15736 KB Output is correct
47 Correct 242 ms 12824 KB Output is correct
48 Correct 254 ms 15736 KB Output is correct
49 Correct 259 ms 13164 KB Output is correct
50 Correct 245 ms 15244 KB Output is correct
51 Correct 274 ms 15160 KB Output is correct
52 Correct 208 ms 12284 KB Output is correct
53 Correct 225 ms 12408 KB Output is correct
54 Correct 290 ms 24748 KB Output is correct
55 Correct 296 ms 18516 KB Output is correct
56 Correct 266 ms 18524 KB Output is correct
57 Correct 218 ms 12152 KB Output is correct
58 Correct 199 ms 12312 KB Output is correct
59 Correct 240 ms 12156 KB Output is correct
60 Correct 237 ms 12152 KB Output is correct
61 Correct 332 ms 12276 KB Output is correct
62 Correct 220 ms 12124 KB Output is correct
63 Correct 254 ms 12396 KB Output is correct
64 Correct 254 ms 12280 KB Output is correct
65 Correct 394 ms 24784 KB Output is correct
66 Correct 417 ms 24812 KB Output is correct
67 Correct 240 ms 18544 KB Output is correct
68 Correct 260 ms 18544 KB Output is correct
69 Correct 244 ms 17912 KB Output is correct
70 Correct 262 ms 17784 KB Output is correct
71 Correct 246 ms 24736 KB Output is correct
72 Correct 262 ms 24696 KB Output is correct
73 Correct 274 ms 20696 KB Output is correct
74 Correct 254 ms 20472 KB Output is correct
75 Correct 309 ms 19676 KB Output is correct
76 Correct 259 ms 24680 KB Output is correct
77 Correct 238 ms 24868 KB Output is correct
78 Correct 285 ms 15480 KB Output is correct
79 Correct 263 ms 14072 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 5 ms 640 KB Output is correct
26 Correct 5 ms 684 KB Output is correct
27 Correct 4 ms 640 KB Output is correct
28 Correct 7 ms 684 KB Output is correct
29 Correct 5 ms 640 KB Output is correct
30 Correct 5 ms 768 KB Output is correct
31 Correct 7 ms 684 KB Output is correct
32 Correct 5 ms 684 KB Output is correct
33 Correct 6 ms 740 KB Output is correct
34 Correct 5 ms 768 KB Output is correct
35 Correct 5 ms 640 KB Output is correct
36 Correct 7 ms 640 KB Output is correct
37 Correct 6 ms 768 KB Output is correct
38 Correct 7 ms 684 KB Output is correct
39 Correct 6 ms 640 KB Output is correct
40 Correct 4 ms 640 KB Output is correct
41 Correct 4 ms 812 KB Output is correct
42 Correct 5 ms 768 KB Output is correct
43 Correct 5 ms 768 KB Output is correct
44 Correct 4 ms 768 KB Output is correct
45 Correct 251 ms 13940 KB Output is correct
46 Correct 269 ms 15736 KB Output is correct
47 Correct 242 ms 12824 KB Output is correct
48 Correct 254 ms 15736 KB Output is correct
49 Correct 259 ms 13164 KB Output is correct
50 Correct 245 ms 15244 KB Output is correct
51 Correct 274 ms 15160 KB Output is correct
52 Correct 208 ms 12284 KB Output is correct
53 Correct 225 ms 12408 KB Output is correct
54 Correct 290 ms 24748 KB Output is correct
55 Correct 296 ms 18516 KB Output is correct
56 Correct 266 ms 18524 KB Output is correct
57 Correct 218 ms 12152 KB Output is correct
58 Correct 199 ms 12312 KB Output is correct
59 Correct 240 ms 12156 KB Output is correct
60 Correct 237 ms 12152 KB Output is correct
61 Correct 332 ms 12276 KB Output is correct
62 Correct 220 ms 12124 KB Output is correct
63 Correct 254 ms 12396 KB Output is correct
64 Correct 254 ms 12280 KB Output is correct
65 Correct 394 ms 24784 KB Output is correct
66 Correct 417 ms 24812 KB Output is correct
67 Correct 240 ms 18544 KB Output is correct
68 Correct 260 ms 18544 KB Output is correct
69 Correct 244 ms 17912 KB Output is correct
70 Correct 262 ms 17784 KB Output is correct
71 Correct 246 ms 24736 KB Output is correct
72 Correct 262 ms 24696 KB Output is correct
73 Correct 274 ms 20696 KB Output is correct
74 Correct 254 ms 20472 KB Output is correct
75 Correct 309 ms 19676 KB Output is correct
76 Correct 259 ms 24680 KB Output is correct
77 Correct 238 ms 24868 KB Output is correct
78 Correct 285 ms 15480 KB Output is correct
79 Correct 263 ms 14072 KB Output is correct
80 Correct 3271 ms 116412 KB Output is correct
81 Correct 3588 ms 114716 KB Output is correct
82 Correct 3378 ms 109676 KB Output is correct
83 Correct 3353 ms 114976 KB Output is correct
84 Correct 3452 ms 116344 KB Output is correct
85 Correct 3592 ms 110664 KB Output is correct
86 Correct 3511 ms 115056 KB Output is correct
87 Correct 2583 ms 108548 KB Output is correct
88 Correct 3779 ms 108684 KB Output is correct
89 Correct 4140 ms 231452 KB Output is correct
90 Correct 4117 ms 183552 KB Output is correct
91 Correct 4180 ms 183344 KB Output is correct
92 Correct 3426 ms 120920 KB Output is correct
93 Correct 2501 ms 120840 KB Output is correct
94 Correct 3313 ms 120572 KB Output is correct
95 Correct 3607 ms 120720 KB Output is correct
96 Correct 3207 ms 120944 KB Output is correct
97 Correct 3496 ms 120756 KB Output is correct
98 Correct 3315 ms 120840 KB Output is correct
99 Correct 3339 ms 120952 KB Output is correct
100 Execution timed out 6002 ms 246016 KB Time limit exceeded
101 Halted 0 ms 0 KB -