oj.uz

Submission #45582

# Submission time Handle Problem Language Result Execution time Memory
45582 2018-04-15T13:52:04 Z kuzmichev_dima Port Facility (JOI17_port_facility) C++14
100 / 100
 5715 ms 153696 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
#include <unordered_set>

using namespace std;

#define INF 1e+9
#define mp make_pair
#define pb push_back
#define fi first
#define fs first
#define se second
#define i64 long long
#define li long long
#define lint long long
#define pii pair<int, int>
#define vi vector<int>

#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define fore(i, b, e) for (int i = (int)b; i <= (int)e; i++)

#define MAX_FLAG 0
#define MIN_FLAG 1

const int MOD = 1e9+7;
const int maxn = 1e6+5;
const int inf = 1e9;

typedef int Tree[maxn * 8];

int s[maxn];
int f[maxn];
int inits[maxn];
int initf[maxn];
int n;
unordered_set<int> in_process;
Tree tree_max, tree_min;
int s_pos_to_i[2 * maxn];
int f_pos_to_i[2 * maxn];
int color[maxn];
int undef;

inline int select_max(int fi, int se) {
    return f[fi] > f[se] ? fi : se;
}

inline int select_min(int fi, int se) {
    return s[fi] < s[se] ? fi : se;
}

int get(const Tree& tree, int i, int L, int R, int A, int B, bool flag) {
    //printf("get i = %d L = %d R = %d A = %d B = %d\n", i, L, R, A, B);
    if (L >= B || A >= R)
        return undef;
    if (L >= A && R <= B)
        return tree[i];
    int M = (L + R) / 2;
    int g1 = get(tree, 2 * i, L, M, A, B, flag);
    int g2 = get(tree, 2 * i + 1, M, R, A, B, flag);
    return flag == MAX_FLAG ? select_max(g1, g2) : select_min(g1, g2);
}

void upd(Tree& tree, int i, int L, int R, int pos, bool flag) {
    if (L + 1 == R) {
        tree[i] = undef;
        return;
    }
    int M = (L + R) / 2;
    if (pos < M)
        upd(tree,i * 2, L, M, pos, flag);
    else upd(tree, i * 2 + 1, M, R, pos, flag);
    tree[i] = (flag == MIN_FLAG ? select_min(tree[i * 2], tree[i * 2 + 1]) : select_max(tree[i * 2], tree[i * 2 + 1]));
}

inline void add(int num) {
    in_process.insert(num);
    upd(tree_max, 1, 0, 2 * n, s[num], MAX_FLAG);
    upd(tree_min, 1, 0, 2 * n, f[num], MIN_FLAG);
    f[num] = -inf;
    s[num] = inf;
}

void build(Tree& tree, int i, int L, int R, bool flag) {
    // printf("build i = %d L = %d R = %d\n", i, L, R);
    if (L + 1 == R) {
        tree[i] = flag == MIN_FLAG ? f_pos_to_i[L] : s_pos_to_i[L];
        return;
    }
    int M = (L + R) / 2;
    build(tree, 2 * i, L, M, flag);
    build(tree, 2 * i + 1, M, R, flag);
    tree[i] = (flag == MIN_FLAG ? select_min(tree[i * 2], tree[i * 2 + 1]) : select_max(tree[i * 2], tree[i * 2 + 1]));
}

struct Event {
    int num, x, typ;
};

bool operator < (Event first, Event second) {
    return first.x < second.x;
}

int main() {
#ifdef LOCAL
    freopen("inp", "r", stdin);
    //freopen("outp", "w", stdout);
#else
    // freopen(TASKNAME ".in", "r", stdin);
    // freopen(TASKNAME ".out", "w", stdout);
#endif
    scanf("%d", &n);
    undef = n;
    s[undef] = inf;
    f[undef] = -inf;
    forn(i, n) {
        scanf("%d%d", &s[i], &f[i]);
        --s[i];
        --f[i];
        inits[i] = s[i];
        initf[i] = f[i];
        //printf("s[%d] =%d f[%d] = %d\n", i, s[i], i, f[i]);
    }
    forn(i, 2 * n) {
        f_pos_to_i[i] = s_pos_to_i[i] = undef;
    }
    forn(i, n) {
        f_pos_to_i[f[i]] = i;
        s_pos_to_i[s[i]] = i;
    }
    forn(i, n)
        color[i] = 2;
    build(tree_min, 1, 0, 2 * n, MIN_FLAG);
    build(tree_max, 1, 0, 2 * n, MAX_FLAG);
    int ans = 1;
    /*forn(i, n) {
        printf("s[%d] = %d f[%d] = %d\n", i, s[i], i, f[i]);
    }*/
    int start = 0;
    while(true) {
        while(start < n && color[start] != 2)
            ++start;
        if (start == n)
            break;
        //printf("\n================\n");
        //printf("start = %d\n", start);
        ans = ans * 2 % MOD;
        color[start] = 0;
        add(start);
        while(!in_process.empty()) {
            int x = *in_process.begin();
            //printf("x = %d [%d; %d]\n", x, inits[x], initf[x]);
            in_process.erase(in_process.begin());
            while(true) {
                int next = get(tree_max, 1, 0, 2 * n, inits[x] + 1, initf[x], MAX_FLAG);
                //printf("next = %d\n", next);
                if (next == undef || f[next] < initf[x])
                    break;
                color[next] = 1 - color[x];
                add(next);
            }
            while(true) {
                int next = get(tree_min, 1, 0, 2 * n, inits[x] + 1, initf[x], MIN_FLAG);
                if (next == undef || s[next] > inits[x])
                    break;
                color[next] = 1 - color[x];
                add(next);
            }
        }
    }
    vector<Event> events;
    forn(i, n) {
        events.pb({i, inits[i], 1});
        events.pb({i, initf[i], -1});
    }
    sort(events.begin(), events.end());
    set<int> S[2];
/*    forn(i, n)
        printf("color[%d] = %d\n", i, color[i]);*/
    for (const Event& event : events) {
        //printf("event x = %d num = %d typ = %d\n", event.x, event.num, event.typ);
        if (event.typ == 1) {
            if (!S[color[event.num]].empty()) {
                //printf("begin = %d\n", *S[1 - color[event.num]].begin());
                if (*S[color[event.num]].begin() < initf[event.num]) {
                    printf("0");
                    exit(0);
                }
            }
            S[color[event.num]].insert(initf[event.num]);
        } else {
            S[color[event.num]].erase(initf[event.num]);
        }
    }
    printf("%d\n", ans);
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:121:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
port_facility.cpp:126:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &s[i], &f[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

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 408 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 2 ms 660 KB Output is correct
14 Correct 2 ms 660 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 680 KB Output is correct
17 Correct 2 ms 680 KB Output is correct
18 Correct 2 ms 680 KB Output is correct
19 Correct 2 ms 680 KB Output is correct
20 Correct 2 ms 680 KB Output is correct
21 Correct 2 ms 680 KB Output is correct
22 Correct 2 ms 680 KB Output is correct
23 Correct 2 ms 680 KB Output is correct
24 Correct 2 ms 680 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 408 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 2 ms 660 KB Output is correct
14 Correct 2 ms 660 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 680 KB Output is correct
17 Correct 2 ms 680 KB Output is correct
18 Correct 2 ms 680 KB Output is correct
19 Correct 2 ms 680 KB Output is correct
20 Correct 2 ms 680 KB Output is correct
21 Correct 2 ms 680 KB Output is correct
22 Correct 2 ms 680 KB Output is correct
23 Correct 2 ms 680 KB Output is correct
24 Correct 2 ms 680 KB Output is correct
25 Correct 6 ms 868 KB Output is correct
26 Correct 6 ms 868 KB Output is correct
27 Correct 6 ms 868 KB Output is correct
28 Correct 6 ms 868 KB Output is correct
29 Correct 6 ms 868 KB Output is correct
30 Correct 8 ms 868 KB Output is correct
31 Correct 6 ms 868 KB Output is correct
32 Correct 6 ms 868 KB Output is correct
33 Correct 6 ms 900 KB Output is correct
34 Correct 5 ms 988 KB Output is correct
35 Correct 5 ms 988 KB Output is correct
36 Correct 5 ms 988 KB Output is correct
37 Correct 6 ms 988 KB Output is correct
38 Correct 5 ms 988 KB Output is correct
39 Correct 5 ms 988 KB Output is correct
40 Correct 5 ms 988 KB Output is correct
41 Correct 8 ms 988 KB Output is correct
42 Correct 6 ms 988 KB Output is correct
43 Correct 7 ms 988 KB Output is correct
44 Correct 5 ms 988 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 408 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 2 ms 660 KB Output is correct
14 Correct 2 ms 660 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 680 KB Output is correct
17 Correct 2 ms 680 KB Output is correct
18 Correct 2 ms 680 KB Output is correct
19 Correct 2 ms 680 KB Output is correct
20 Correct 2 ms 680 KB Output is correct
21 Correct 2 ms 680 KB Output is correct
22 Correct 2 ms 680 KB Output is correct
23 Correct 2 ms 680 KB Output is correct
24 Correct 2 ms 680 KB Output is correct
25 Correct 6 ms 868 KB Output is correct
26 Correct 6 ms 868 KB Output is correct
27 Correct 6 ms 868 KB Output is correct
28 Correct 6 ms 868 KB Output is correct
29 Correct 6 ms 868 KB Output is correct
30 Correct 8 ms 868 KB Output is correct
31 Correct 6 ms 868 KB Output is correct
32 Correct 6 ms 868 KB Output is correct
33 Correct 6 ms 900 KB Output is correct
34 Correct 5 ms 988 KB Output is correct
35 Correct 5 ms 988 KB Output is correct
36 Correct 5 ms 988 KB Output is correct
37 Correct 6 ms 988 KB Output is correct
38 Correct 5 ms 988 KB Output is correct
39 Correct 5 ms 988 KB Output is correct
40 Correct 5 ms 988 KB Output is correct
41 Correct 8 ms 988 KB Output is correct
42 Correct 6 ms 988 KB Output is correct
43 Correct 7 ms 988 KB Output is correct
44 Correct 5 ms 988 KB Output is correct
45 Correct 317 ms 13028 KB Output is correct
46 Correct 308 ms 13088 KB Output is correct
47 Correct 307 ms 13088 KB Output is correct
48 Correct 321 ms 13344 KB Output is correct
49 Correct 327 ms 13344 KB Output is correct
50 Correct 328 ms 13344 KB Output is correct
51 Correct 296 ms 13344 KB Output is correct
52 Correct 230 ms 13344 KB Output is correct
53 Correct 326 ms 15544 KB Output is correct
54 Correct 344 ms 15544 KB Output is correct
55 Correct 358 ms 15544 KB Output is correct
56 Correct 309 ms 15544 KB Output is correct
57 Correct 243 ms 15544 KB Output is correct
58 Correct 257 ms 15544 KB Output is correct
59 Correct 264 ms 15544 KB Output is correct
60 Correct 332 ms 15544 KB Output is correct
61 Correct 287 ms 15544 KB Output is correct
62 Correct 284 ms 15544 KB Output is correct
63 Correct 263 ms 15544 KB Output is correct
64 Correct 261 ms 15544 KB Output is correct
65 Correct 335 ms 15544 KB Output is correct
66 Correct 365 ms 15544 KB Output is correct
67 Correct 385 ms 15544 KB Output is correct
68 Correct 370 ms 15544 KB Output is correct
69 Correct 363 ms 15544 KB Output is correct
70 Correct 357 ms 15544 KB Output is correct
71 Correct 330 ms 16332 KB Output is correct
72 Correct 355 ms 16352 KB Output is correct
73 Correct 351 ms 16352 KB Output is correct
74 Correct 360 ms 16352 KB Output is correct
75 Correct 241 ms 16352 KB Output is correct
76 Correct 232 ms 16352 KB Output is correct
77 Correct 229 ms 16352 KB Output is correct
78 Correct 312 ms 16352 KB Output is correct
79 Correct 299 ms 16352 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 408 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 2 ms 660 KB Output is correct
14 Correct 2 ms 660 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 680 KB Output is correct
17 Correct 2 ms 680 KB Output is correct
18 Correct 2 ms 680 KB Output is correct
19 Correct 2 ms 680 KB Output is correct
20 Correct 2 ms 680 KB Output is correct
21 Correct 2 ms 680 KB Output is correct
22 Correct 2 ms 680 KB Output is correct
23 Correct 2 ms 680 KB Output is correct
24 Correct 2 ms 680 KB Output is correct
25 Correct 6 ms 868 KB Output is correct
26 Correct 6 ms 868 KB Output is correct
27 Correct 6 ms 868 KB Output is correct
28 Correct 6 ms 868 KB Output is correct
29 Correct 6 ms 868 KB Output is correct
30 Correct 8 ms 868 KB Output is correct
31 Correct 6 ms 868 KB Output is correct
32 Correct 6 ms 868 KB Output is correct
33 Correct 6 ms 900 KB Output is correct
34 Correct 5 ms 988 KB Output is correct
35 Correct 5 ms 988 KB Output is correct
36 Correct 5 ms 988 KB Output is correct
37 Correct 6 ms 988 KB Output is correct
38 Correct 5 ms 988 KB Output is correct
39 Correct 5 ms 988 KB Output is correct
40 Correct 5 ms 988 KB Output is correct
41 Correct 8 ms 988 KB Output is correct
42 Correct 6 ms 988 KB Output is correct
43 Correct 7 ms 988 KB Output is correct
44 Correct 5 ms 988 KB Output is correct
45 Correct 317 ms 13028 KB Output is correct
46 Correct 308 ms 13088 KB Output is correct
47 Correct 307 ms 13088 KB Output is correct
48 Correct 321 ms 13344 KB Output is correct
49 Correct 327 ms 13344 KB Output is correct
50 Correct 328 ms 13344 KB Output is correct
51 Correct 296 ms 13344 KB Output is correct
52 Correct 230 ms 13344 KB Output is correct
53 Correct 326 ms 15544 KB Output is correct
54 Correct 344 ms 15544 KB Output is correct
55 Correct 358 ms 15544 KB Output is correct
56 Correct 309 ms 15544 KB Output is correct
57 Correct 243 ms 15544 KB Output is correct
58 Correct 257 ms 15544 KB Output is correct
59 Correct 264 ms 15544 KB Output is correct
60 Correct 332 ms 15544 KB Output is correct
61 Correct 287 ms 15544 KB Output is correct
62 Correct 284 ms 15544 KB Output is correct
63 Correct 263 ms 15544 KB Output is correct
64 Correct 261 ms 15544 KB Output is correct
65 Correct 335 ms 15544 KB Output is correct
66 Correct 365 ms 15544 KB Output is correct
67 Correct 385 ms 15544 KB Output is correct
68 Correct 370 ms 15544 KB Output is correct
69 Correct 363 ms 15544 KB Output is correct
70 Correct 357 ms 15544 KB Output is correct
71 Correct 330 ms 16332 KB Output is correct
72 Correct 355 ms 16352 KB Output is correct
73 Correct 351 ms 16352 KB Output is correct
74 Correct 360 ms 16352 KB Output is correct
75 Correct 241 ms 16352 KB Output is correct
76 Correct 232 ms 16352 KB Output is correct
77 Correct 229 ms 16352 KB Output is correct
78 Correct 312 ms 16352 KB Output is correct
79 Correct 299 ms 16352 KB Output is correct
80 Correct 4040 ms 116664 KB Output is correct
81 Correct 4059 ms 116664 KB Output is correct
82 Correct 3976 ms 116664 KB Output is correct
83 Correct 3997 ms 116664 KB Output is correct
84 Correct 4067 ms 116664 KB Output is correct
85 Correct 3678 ms 116664 KB Output is correct
86 Correct 3962 ms 116664 KB Output is correct
87 Correct 3126 ms 116664 KB Output is correct
88 Correct 4898 ms 139208 KB Output is correct
89 Correct 4581 ms 139208 KB Output is correct
90 Correct 4533 ms 139208 KB Output is correct
91 Correct 4100 ms 139208 KB Output is correct
92 Correct 3189 ms 139208 KB Output is correct
93 Correct 3135 ms 139208 KB Output is correct
94 Correct 3863 ms 139208 KB Output is correct
95 Correct 3889 ms 139208 KB Output is correct
96 Correct 3637 ms 139208 KB Output is correct
97 Correct 3650 ms 139208 KB Output is correct
98 Correct 3699 ms 139208 KB Output is correct
99 Correct 3899 ms 139208 KB Output is correct
100 Correct 4954 ms 139208 KB Output is correct
101 Correct 5024 ms 139208 KB Output is correct
102 Correct 4728 ms 139208 KB Output is correct
103 Correct 5102 ms 139208 KB Output is correct
104 Correct 5301 ms 139208 KB Output is correct
105 Correct 4979 ms 139208 KB Output is correct
106 Correct 4877 ms 153696 KB Output is correct
107 Correct 4857 ms 153696 KB Output is correct
108 Correct 5149 ms 153696 KB Output is correct
109 Correct 5715 ms 153696 KB Output is correct
110 Correct 3097 ms 153696 KB Output is correct
111 Correct 2992 ms 153696 KB Output is correct
112 Correct 2862 ms 153696 KB Output is correct
113 Correct 4120 ms 153696 KB Output is correct
114 Correct 4141 ms 153696 KB Output is correct