oj.uz

Submission #754598

# Submission time Handle Problem Language Result Execution time Memory
754598 2023-06-08T06:47:27 Z boris_mihov Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 10664 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <stack>

typedef long long llong;
const int MAXLOG = 20 + 5;
const int MAXN = 100000 + 10;
const int INF  = 1e9;

int n;
struct Sparse
{
    int sparse[MAXLOG][MAXN];
    int lg[MAXN];

    void build(int _vals[])
    {
        for (int i = 1 ; i <= n ; ++i)
        {
            sparse[0][i] = _vals[i];
        }

        for (int log = 1 ; (1 << log) <= n ; ++log)
        {
            for (int i = 1 ; i + (1 << log) - 1 <= n ; ++i)
            {
                sparse[log][i] = std::max(sparse[log - 1][i], sparse[log - 1][i + (1 << log - 1)]);
            }
        }
    
        for (int i = 1 ; i <= n ; ++i)
        {
            lg[i] = lg[i - 1];
            if ((1 << lg[i] + 1) < i)
            {
                lg[i]++;
            }
        }
    }

    int findMAX(int l, int r)
    {
        int log = lg[r - l + 1];
        return std::max(sparse[log][l], sparse[log][r - (1 << log) + 1]);
    }
};

int a[MAXN];
int b[MAXN];
int c[MAXN];
int d[MAXN];
int h[MAXN];
Sparse sparse;
std::stack <int> st;
std::vector <int> v;
int isClimb = -1;

void init(int N, std::vector <int> H) 
{
    n = N;
    for (int i = 1 ; i <= n ; ++i)
    {
        h[i] = H[i - 1];
    }

    sparse.build(h);
    st.push(0);

    for (int i = 1 ; i <= n ; ++i)
    {
        while (h[st.top()] > h[i])
        {
            st.pop();
        }

        a[i] = st.top();
        st.push(i);
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        if ((i == 1 || h[i - 1] < h[i]) && (i == n || h[i] > h[i + 1]))
        {
            isClimb = i;
            break;
        }
    }

    for (int i = 1 ; i < isClimb ; ++i)
    {
        if (h[i] > h[i + 1])
        {
            isClimb = -1;
            break;
        }
    }

    if (isClimb != -1)
    {
        for (int i = isClimb ; i < n ; ++i)
        {
            if (h[i] < h[i + 1])
            {
                isClimb = -1;
                break;
            }
        }
    }

    while (!st.empty())
    {
        st.pop();
    }

    st.push(n + 1);
    for (int i = n ; i >= 1 ; --i)
    {
        while (h[st.top()] > h[i])
        {
            st.pop();
        }

        c[i] = st.top();
        st.push(i);
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        if (a[i] == i - 1)
        {
            b[i] = 0;
        } else
        {
            b[i] = sparse.findMAX(a[i] + 1, i - 1) - h[i];
        }

        if (c[i] == i + 1)
        {
            d[i] = 0;
        } else
        {
            d[i] = sparse.findMAX(i + 1, c[i] - 1) - h[i];
        }
    }

    v.push_back(d[1]);
    v.push_back(b[n]);
    for (int i = 2 ; i < n ; ++i)
    {
        v.push_back(std::min(b[i], d[i]));
    }

    std::sort(v.begin(), v.end());
}

bool entered;
int max_towers(int L, int R, int D) 
{
    L++; R++;
    // if (isClimb != -1)
    // {
    //     if (isClimb < L || R < isClimb)
    //     {
    //         return 1;
    //     }

    //     if (h[L] + D <= h[isClimb] && h[R] + D <= h[isClimb])
    //     {
    //         return 2;
    //     }

    //     return 1;
    // }

    if (L == R)
    {
        return 1;
    }

    // if (L == 1 && R == n)
    // {
    //     int l = -1, r = n, mid;
    //     while (l < r - 1)
    //     {
    //         mid = (l + r) / 2;
    //         if (v[mid] < D) l = mid;
    //         else r = mid;
    //     }

    //     return n - r;
    // }

    int ans = 0;
    for (int i = L ; i <= R ; ++i)
    {
        if ((a[i] < L || b[i] >= D) && (c[i] > R || d[i] >= D))
        {
            ans++;
        }
    }

    return ans;
}

Compilation message

towers.cpp: In member function 'void Sparse::build(int*)':
towers.cpp:30:93: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   30 |                 sparse[log][i] = std::max(sparse[log - 1][i], sparse[log - 1][i + (1 << log - 1)]);
      |                                                                                         ~~~~^~~
towers.cpp:37:29: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   37 |             if ((1 << lg[i] + 1) < i)
      |                       ~~~~~~^~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 999 ms 6168 KB Output is correct
2 Correct 3387 ms 10428 KB Output is correct
3 Correct 3230 ms 10392 KB Output is correct
4 Correct 3540 ms 10448 KB Output is correct
5 Execution timed out 4074 ms 10664 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 436 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 436 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 15 ms 6576 KB Output is correct
37 Correct 22 ms 10148 KB Output is correct
38 Correct 23 ms 10148 KB Output is correct
39 Correct 22 ms 10180 KB Output is correct
40 Correct 30 ms 10148 KB Output is correct
41 Correct 24 ms 10148 KB Output is correct
42 Correct 31 ms 10144 KB Output is correct
43 Correct 18 ms 10448 KB Output is correct
44 Correct 18 ms 10540 KB Output is correct
45 Correct 18 ms 10260 KB Output is correct
46 Correct 18 ms 10412 KB Output is correct
47 Correct 23 ms 10152 KB Output is correct
48 Correct 21 ms 10180 KB Output is correct
49 Correct 24 ms 10216 KB Output is correct
50 Correct 29 ms 10652 KB Output is correct
51 Correct 18 ms 10424 KB Output is correct
52 Correct 23 ms 10180 KB Output is correct
53 Correct 26 ms 10188 KB Output is correct
54 Correct 23 ms 10188 KB Output is correct
55 Correct 19 ms 10660 KB Output is correct
56 Correct 18 ms 10432 KB Output is correct
57 Correct 23 ms 9920 KB Output is correct
58 Correct 25 ms 10244 KB Output is correct
59 Correct 24 ms 10144 KB Output is correct
60 Correct 30 ms 10140 KB Output is correct
61 Correct 26 ms 10168 KB Output is correct
62 Correct 34 ms 10188 KB Output is correct
63 Correct 32 ms 10148 KB Output is correct
64 Correct 26 ms 10412 KB Output is correct
65 Correct 23 ms 10556 KB Output is correct
66 Correct 20 ms 10284 KB Output is correct
67 Correct 25 ms 10656 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4016 ms 10148 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3174 ms 2640 KB Output is correct
2 Execution timed out 4038 ms 10184 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 436 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 15 ms 6576 KB Output is correct
37 Correct 22 ms 10148 KB Output is correct
38 Correct 23 ms 10148 KB Output is correct
39 Correct 22 ms 10180 KB Output is correct
40 Correct 30 ms 10148 KB Output is correct
41 Correct 24 ms 10148 KB Output is correct
42 Correct 31 ms 10144 KB Output is correct
43 Correct 18 ms 10448 KB Output is correct
44 Correct 18 ms 10540 KB Output is correct
45 Correct 18 ms 10260 KB Output is correct
46 Correct 18 ms 10412 KB Output is correct
47 Correct 23 ms 10152 KB Output is correct
48 Correct 21 ms 10180 KB Output is correct
49 Correct 24 ms 10216 KB Output is correct
50 Correct 29 ms 10652 KB Output is correct
51 Correct 18 ms 10424 KB Output is correct
52 Correct 23 ms 10180 KB Output is correct
53 Correct 26 ms 10188 KB Output is correct
54 Correct 23 ms 10188 KB Output is correct
55 Correct 19 ms 10660 KB Output is correct
56 Correct 18 ms 10432 KB Output is correct
57 Correct 23 ms 9920 KB Output is correct
58 Correct 25 ms 10244 KB Output is correct
59 Correct 24 ms 10144 KB Output is correct
60 Correct 30 ms 10140 KB Output is correct
61 Correct 26 ms 10168 KB Output is correct
62 Correct 34 ms 10188 KB Output is correct
63 Correct 32 ms 10148 KB Output is correct
64 Correct 26 ms 10412 KB Output is correct
65 Correct 23 ms 10556 KB Output is correct
66 Correct 20 ms 10284 KB Output is correct
67 Correct 25 ms 10656 KB Output is correct
68 Execution timed out 4016 ms 10148 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 999 ms 6168 KB Output is correct
2 Correct 3387 ms 10428 KB Output is correct
3 Correct 3230 ms 10392 KB Output is correct
4 Correct 3540 ms 10448 KB Output is correct
5 Execution timed out 4074 ms 10664 KB Time limit exceeded
6 Halted 0 ms 0 KB -