oj.uz

Submission #107333

# Submission time Handle Problem Language Result Execution time Memory
107333 2019-04-23T11:04:56 Z popovicirobert Port Facility (JOI17_port_facility) C++14
78 / 100
 3203 ms 111928 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;
const int MAXN = (int) 1e6;

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

struct SegTree {

    int aint[8 * MAXN + 1];
    int n;

    inline void init(int _n) {
        n = _n;
        for(int i = 1; i <= 4 * n; i++) {
            aint[i] = -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;

pair <int, int> arr[MAXN + 1];
int who[2 * MAXN + 1], vis[MAXN + 1], col[MAXN + 1];
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 {

    int aib[2 * MAXN + 1];
    int n;

    inline void init(int _n) {
        n = _n;
    }

    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;

    stl.init(2 * n), str.init(2 * n);

    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;
    }

    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 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 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 3 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 3 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 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 3 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 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 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 3 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 3 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 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 3 ms 384 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 5 ms 768 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 5 ms 768 KB Output is correct
31 Correct 7 ms 768 KB Output is correct
32 Correct 6 ms 640 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 5 ms 768 KB Output is correct
35 Correct 4 ms 640 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 6 ms 768 KB Output is correct
38 Correct 6 ms 768 KB Output is correct
39 Correct 5 ms 640 KB Output is correct
40 Correct 6 ms 640 KB Output is correct
41 Correct 4 ms 768 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 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 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 3 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 3 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 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 3 ms 384 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 5 ms 768 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 5 ms 768 KB Output is correct
31 Correct 7 ms 768 KB Output is correct
32 Correct 6 ms 640 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 5 ms 768 KB Output is correct
35 Correct 4 ms 640 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 6 ms 768 KB Output is correct
38 Correct 6 ms 768 KB Output is correct
39 Correct 5 ms 640 KB Output is correct
40 Correct 6 ms 640 KB Output is correct
41 Correct 4 ms 768 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 271 ms 12280 KB Output is correct
46 Correct 244 ms 13680 KB Output is correct
47 Correct 238 ms 11512 KB Output is correct
48 Correct 245 ms 13560 KB Output is correct
49 Correct 225 ms 11620 KB Output is correct
50 Correct 234 ms 13304 KB Output is correct
51 Correct 309 ms 13100 KB Output is correct
52 Correct 179 ms 10232 KB Output is correct
53 Correct 222 ms 9848 KB Output is correct
54 Correct 296 ms 19328 KB Output is correct
55 Correct 311 ms 14660 KB Output is correct
56 Correct 294 ms 14712 KB Output is correct
57 Correct 246 ms 11056 KB Output is correct
58 Correct 181 ms 10336 KB Output is correct
59 Correct 204 ms 11128 KB Output is correct
60 Correct 257 ms 11128 KB Output is correct
61 Correct 280 ms 11000 KB Output is correct
62 Correct 207 ms 11128 KB Output is correct
63 Correct 227 ms 11004 KB Output is correct
64 Correct 266 ms 11012 KB Output is correct
65 Correct 376 ms 20064 KB Output is correct
66 Correct 385 ms 19960 KB Output is correct
67 Correct 263 ms 14744 KB Output is correct
68 Correct 242 ms 14712 KB Output is correct
69 Correct 277 ms 14328 KB Output is correct
70 Correct 243 ms 14460 KB Output is correct
71 Correct 239 ms 19320 KB Output is correct
72 Correct 232 ms 19448 KB Output is correct
73 Correct 256 ms 16168 KB Output is correct
74 Correct 259 ms 16120 KB Output is correct
75 Correct 310 ms 16528 KB Output is correct
76 Correct 227 ms 20344 KB Output is correct
77 Correct 226 ms 20344 KB Output is correct
78 Correct 261 ms 13300 KB Output is correct
79 Correct 229 ms 12408 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 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 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 3 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 3 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 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 3 ms 384 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 7 ms 896 KB Output is correct
27 Correct 5 ms 768 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 5 ms 768 KB Output is correct
31 Correct 7 ms 768 KB Output is correct
32 Correct 6 ms 640 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 5 ms 768 KB Output is correct
35 Correct 4 ms 640 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 6 ms 768 KB Output is correct
38 Correct 6 ms 768 KB Output is correct
39 Correct 5 ms 640 KB Output is correct
40 Correct 6 ms 640 KB Output is correct
41 Correct 4 ms 768 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 271 ms 12280 KB Output is correct
46 Correct 244 ms 13680 KB Output is correct
47 Correct 238 ms 11512 KB Output is correct
48 Correct 245 ms 13560 KB Output is correct
49 Correct 225 ms 11620 KB Output is correct
50 Correct 234 ms 13304 KB Output is correct
51 Correct 309 ms 13100 KB Output is correct
52 Correct 179 ms 10232 KB Output is correct
53 Correct 222 ms 9848 KB Output is correct
54 Correct 296 ms 19328 KB Output is correct
55 Correct 311 ms 14660 KB Output is correct
56 Correct 294 ms 14712 KB Output is correct
57 Correct 246 ms 11056 KB Output is correct
58 Correct 181 ms 10336 KB Output is correct
59 Correct 204 ms 11128 KB Output is correct
60 Correct 257 ms 11128 KB Output is correct
61 Correct 280 ms 11000 KB Output is correct
62 Correct 207 ms 11128 KB Output is correct
63 Correct 227 ms 11004 KB Output is correct
64 Correct 266 ms 11012 KB Output is correct
65 Correct 376 ms 20064 KB Output is correct
66 Correct 385 ms 19960 KB Output is correct
67 Correct 263 ms 14744 KB Output is correct
68 Correct 242 ms 14712 KB Output is correct
69 Correct 277 ms 14328 KB Output is correct
70 Correct 243 ms 14460 KB Output is correct
71 Correct 239 ms 19320 KB Output is correct
72 Correct 232 ms 19448 KB Output is correct
73 Correct 256 ms 16168 KB Output is correct
74 Correct 259 ms 16120 KB Output is correct
75 Correct 310 ms 16528 KB Output is correct
76 Correct 227 ms 20344 KB Output is correct
77 Correct 226 ms 20344 KB Output is correct
78 Correct 261 ms 13300 KB Output is correct
79 Correct 229 ms 12408 KB Output is correct
80 Incorrect 3203 ms 111928 KB Output isn't correct
81 Halted 0 ms 0 KB -