oj.uz

Submission #93958

# Submission time Handle Problem Language Result Execution time Memory
93958 2019-01-13T18:06:32 Z Alexa2001 Port Facility (JOI17_port_facility) C++17
100 / 100
 3183 ms 204732 KB 
#include <bits/stdc++.h>
#define left_son (node<<1)
#define right_son ((node<<1)|1)
#define mid ((st+dr)>>1)

using namespace std;

typedef pair<int,int> Pair;
const int Nmax = 2e6 + 5, Mod = 1e9 + 7, bs = (1<<17);

int col[Nmax], A[Nmax], B[Nmax];
int n, cursor, who[Nmax];
char buffer[bs+2];

/// 19:00

class STree
{
    int a[Nmax<<2];

    public:
        int tip;

        int query(int node, int st, int dr, int L, int R, int val)
        {
            if(L <= st && dr <= R)
            {
                if(a[node] > val)
                {
                    if(a[node] > 0) return who[a[node]];
                        else return who[-a[node]];
                }
                return -1;
            }

            int res = -1;
            if(L <= mid) res = query(left_son, st, mid, L, R, val);
            if(res == -1 && mid < R) res = query(right_son, mid+1, dr, L, R, val);
            return res;
        }

        void del(int node, int st, int dr, int pos)
        {
            if(st == dr)
            {
                a[node] = INT_MIN;
                return;
            }
            if(pos <= mid) del(left_son, st, mid, pos);
                else del(right_son, mid+1, dr, pos);
            a[node] = max(a[left_son], a[right_son]);
        }

        void init(int node, int st, int dr)
        {
            a[node] = INT_MIN;
            if(st == dr) return;
            init(left_son, st, mid);
            init(right_son, mid+1, dr);
        }

        void update(int node, int st, int dr, int pos, int val)
        {
            if(st == dr)
            {
                a[node] = val;
                return;
            }
            if(pos <= mid) update(left_son, st, mid, pos, val);
                else update(right_son, mid+1, dr, pos, val);
            a[node] = max(a[left_son], a[right_son]);
        }

} aint1, aint2;

void dfs(int node, int C = 1)
{
    aint1.del(1, 1, 2*n, A[node]);
    aint2.del(1, 1, 2*n, B[node]);
    col[node] = C;

    while(1)
    {
        int x = aint1.query(1, 1, 2*n, A[node], B[node], B[node]);
        if(x == -1) break;
        dfs(x, 3 - C);
    }

    while(1)
    {
        int x = aint2.query(1, 1, 2*n, A[node], B[node], -A[node]);
        if(x == -1) break;
        dfs(x, 3 - C);
    }
}

bool check(vector<Pair> &v)
{
    sort(v.begin(), v.end());

    priority_queue< int, vector<int>, greater<int> > heap;
    int i;

    for(i=0; i<v.size(); ++i)
    {
        while(heap.size() && heap.top() < v[i].first) heap.pop();
        if(heap.size() && heap.top() < v[i].second) return 0;
        heap.push(v[i].second);
    }
    return 1;
}

void read(int &n)
{
    while(!isdigit(buffer[cursor]))
    {
        ++cursor;
        if(cursor == bs) fread(buffer, 1, bs, stdin), cursor = 0;
    }

    n = 0;
    while(isdigit(buffer[cursor]))
    {
        n = n * 10 + buffer[cursor] - '0';
        ++cursor;
        if(cursor == bs) fread(buffer, 1, bs, stdin), cursor = 0;
    }
}

int main()
{
 //   freopen("input", "r", stdin);
    cin.sync_with_stdio(false);

    fread(buffer, 1, bs, stdin), cursor = 0;

    int i;
    read(n);
    for(i=1; i<=n; ++i) read(A[i]), read(B[i]);

    aint1.tip = 1; aint2.tip = 2;

    aint1.init(1, 1, 2*n);
    aint2.init(1, 1, 2*n);

    for(i=1; i<=n; ++i)
    {
        aint1.update(1, 1, 2*n, A[i], B[i]);
        aint2.update(1, 1, 2*n, B[i], -A[i]);

        who[A[i]] = who[B[i]] = i;
    }

    int ans = 1;
    for(i=1; i<=n; ++i)
        if(!col[i])
        {
            ans = 2 * ans % Mod;
            dfs(i);
        }

    vector<Pair> v[3];
    for(i=1; i<=n; ++i) v[col[i]].push_back({A[i], B[i]});

    if(check(v[1]) && check(v[2])) cout << ans << '\n';
        else cout << 0 << '\n';

    return 0;
}

Compilation message

port_facility.cpp: In function 'bool check(std::vector<std::pair<int, int> >&)':
port_facility.cpp:104:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<v.size(); ++i)
              ~^~~~~~~~~
port_facility.cpp: In function 'void read(int&)':
port_facility.cpp:118:53: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         if(cursor == bs) fread(buffer, 1, bs, stdin), cursor = 0;
                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
port_facility.cpp:126:53: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         if(cursor == bs) fread(buffer, 1, bs, stdin), cursor = 0;
                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
port_facility.cpp: In function 'int main()':
port_facility.cpp:135:32: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     fread(buffer, 1, bs, stdin), cursor = 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 1 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 380 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 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 3 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 1 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 380 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 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 632 KB Output is correct
26 Correct 3 ms 632 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 3 ms 636 KB Output is correct
31 Correct 3 ms 632 KB Output is correct
32 Correct 3 ms 632 KB Output is correct
33 Correct 3 ms 632 KB Output is correct
34 Correct 3 ms 632 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 4 ms 504 KB Output is correct
37 Correct 3 ms 760 KB Output is correct
38 Correct 3 ms 760 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 0 ms 760 KB Output is correct
42 Correct 3 ms 888 KB Output is correct
43 Correct 3 ms 760 KB Output is correct
44 Correct 3 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 1 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 380 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 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 632 KB Output is correct
26 Correct 3 ms 632 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 3 ms 636 KB Output is correct
31 Correct 3 ms 632 KB Output is correct
32 Correct 3 ms 632 KB Output is correct
33 Correct 3 ms 632 KB Output is correct
34 Correct 3 ms 632 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 4 ms 504 KB Output is correct
37 Correct 3 ms 760 KB Output is correct
38 Correct 3 ms 760 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 0 ms 760 KB Output is correct
42 Correct 3 ms 888 KB Output is correct
43 Correct 3 ms 760 KB Output is correct
44 Correct 3 ms 760 KB Output is correct
45 Correct 117 ms 8816 KB Output is correct
46 Correct 124 ms 11120 KB Output is correct
47 Correct 121 ms 8220 KB Output is correct
48 Correct 119 ms 10220 KB Output is correct
49 Correct 151 ms 8432 KB Output is correct
50 Correct 115 ms 10596 KB Output is correct
51 Correct 130 ms 10224 KB Output is correct
52 Correct 110 ms 7796 KB Output is correct
53 Correct 137 ms 8276 KB Output is correct
54 Correct 113 ms 20036 KB Output is correct
55 Correct 110 ms 13812 KB Output is correct
56 Correct 136 ms 13820 KB Output is correct
57 Correct 130 ms 7624 KB Output is correct
58 Correct 133 ms 7796 KB Output is correct
59 Correct 160 ms 7800 KB Output is correct
60 Correct 159 ms 8052 KB Output is correct
61 Correct 157 ms 7664 KB Output is correct
62 Correct 134 ms 8180 KB Output is correct
63 Correct 142 ms 8044 KB Output is correct
64 Correct 132 ms 7628 KB Output is correct
65 Correct 169 ms 18520 KB Output is correct
66 Correct 181 ms 18548 KB Output is correct
67 Correct 157 ms 18924 KB Output is correct
68 Correct 153 ms 18920 KB Output is correct
69 Correct 135 ms 16428 KB Output is correct
70 Correct 134 ms 16488 KB Output is correct
71 Correct 140 ms 20380 KB Output is correct
72 Correct 127 ms 20432 KB Output is correct
73 Correct 129 ms 16592 KB Output is correct
74 Correct 129 ms 16468 KB Output is correct
75 Correct 135 ms 14956 KB Output is correct
76 Correct 133 ms 20092 KB Output is correct
77 Correct 131 ms 19948 KB Output is correct
78 Correct 147 ms 10720 KB Output is correct
79 Correct 148 ms 9328 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 1 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 380 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 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 632 KB Output is correct
26 Correct 3 ms 632 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 3 ms 636 KB Output is correct
31 Correct 3 ms 632 KB Output is correct
32 Correct 3 ms 632 KB Output is correct
33 Correct 3 ms 632 KB Output is correct
34 Correct 3 ms 632 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 4 ms 504 KB Output is correct
37 Correct 3 ms 760 KB Output is correct
38 Correct 3 ms 760 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 0 ms 760 KB Output is correct
42 Correct 3 ms 888 KB Output is correct
43 Correct 3 ms 760 KB Output is correct
44 Correct 3 ms 760 KB Output is correct
45 Correct 117 ms 8816 KB Output is correct
46 Correct 124 ms 11120 KB Output is correct
47 Correct 121 ms 8220 KB Output is correct
48 Correct 119 ms 10220 KB Output is correct
49 Correct 151 ms 8432 KB Output is correct
50 Correct 115 ms 10596 KB Output is correct
51 Correct 130 ms 10224 KB Output is correct
52 Correct 110 ms 7796 KB Output is correct
53 Correct 137 ms 8276 KB Output is correct
54 Correct 113 ms 20036 KB Output is correct
55 Correct 110 ms 13812 KB Output is correct
56 Correct 136 ms 13820 KB Output is correct
57 Correct 130 ms 7624 KB Output is correct
58 Correct 133 ms 7796 KB Output is correct
59 Correct 160 ms 7800 KB Output is correct
60 Correct 159 ms 8052 KB Output is correct
61 Correct 157 ms 7664 KB Output is correct
62 Correct 134 ms 8180 KB Output is correct
63 Correct 142 ms 8044 KB Output is correct
64 Correct 132 ms 7628 KB Output is correct
65 Correct 169 ms 18520 KB Output is correct
66 Correct 181 ms 18548 KB Output is correct
67 Correct 157 ms 18924 KB Output is correct
68 Correct 153 ms 18920 KB Output is correct
69 Correct 135 ms 16428 KB Output is correct
70 Correct 134 ms 16488 KB Output is correct
71 Correct 140 ms 20380 KB Output is correct
72 Correct 127 ms 20432 KB Output is correct
73 Correct 129 ms 16592 KB Output is correct
74 Correct 129 ms 16468 KB Output is correct
75 Correct 135 ms 14956 KB Output is correct
76 Correct 133 ms 20092 KB Output is correct
77 Correct 131 ms 19948 KB Output is correct
78 Correct 147 ms 10720 KB Output is correct
79 Correct 148 ms 9328 KB Output is correct
80 Correct 2293 ms 70732 KB Output is correct
81 Correct 2308 ms 83748 KB Output is correct
82 Correct 2197 ms 80120 KB Output is correct
83 Correct 2119 ms 84360 KB Output is correct
84 Correct 2218 ms 85952 KB Output is correct
85 Correct 2109 ms 80548 KB Output is correct
86 Correct 2170 ms 84172 KB Output is correct
87 Correct 2015 ms 76004 KB Output is correct
88 Correct 2611 ms 83600 KB Output is correct
89 Correct 2064 ms 200796 KB Output is correct
90 Correct 1840 ms 138232 KB Output is correct
91 Correct 1905 ms 138260 KB Output is correct
92 Correct 1848 ms 77540 KB Output is correct
93 Correct 1796 ms 75872 KB Output is correct
94 Correct 2132 ms 78428 KB Output is correct
95 Correct 2012 ms 77916 KB Output is correct
96 Correct 2093 ms 78508 KB Output is correct
97 Correct 2062 ms 77456 KB Output is correct
98 Correct 2142 ms 79844 KB Output is correct
99 Correct 2031 ms 78508 KB Output is correct
100 Correct 3183 ms 198392 KB Output is correct
101 Correct 2944 ms 198792 KB Output is correct
102 Correct 2093 ms 193148 KB Output is correct
103 Correct 1985 ms 192948 KB Output is correct
104 Correct 1911 ms 165684 KB Output is correct
105 Correct 2020 ms 167592 KB Output is correct
106 Correct 2297 ms 204696 KB Output is correct
107 Correct 2119 ms 204732 KB Output is correct
108 Correct 2133 ms 165696 KB Output is correct
109 Correct 2166 ms 165568 KB Output is correct
110 Correct 2126 ms 198348 KB Output is correct
111 Correct 2177 ms 200832 KB Output is correct
112 Correct 1830 ms 200756 KB Output is correct
113 Correct 2122 ms 80072 KB Output is correct
114 Correct 1981 ms 84160 KB Output is correct