oj.uz

Submission #635279

# Submission time Handle Problem Language Result Execution time Memory
635279 2022-08-25T20:57:19 Z tutis Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 98560 KB 
#include "towers.h"

#include <bits/stdc++.h>
using namespace std;
vector<int>H;
struct ST
{
    int l, r;
    ST *left, *right;
    int mn;
    ST() {}
    vector<pair<int, int>>V;
    vector<pair<int, int>>W;
    ST(int l, int r): l(l), r(r)
    {
        if (l < r)
        {
            left = new ST(l, (l + r) / 2);
            right = new ST((l + r) / 2 + 1, r);
            mn = min(left->mn, right->mn);
        }
        else
        {
            left = right = NULL;
            mn = H[l];
        }
        for (int i = l; i <= r; i++)
        {
            if (W.empty() || H[i] > W.back().first)
                W.push_back({H[i], i});
        }
        int mm = 1.1e9;
        for (int i = l + 1; i <= r; i++)
        {
            mm = min(mm, H[i - 1]);
            if (V.empty() || H[i] - mm > V.back().first)
                V.push_back({H[i] - mm, i});
        }
    }
    int get(int x, int y)
    {
        if (x <= l && r <= y)
            return mn;
        if (r < x || y < l)
            return 1.1e9;
        return min(left->get(x, y), right->get(x, y));
    }
    pair<int, int> get1(int L, int D, int mnl = 1.1e9)
    {
        if (L <= l)
        {
            int rr = -1;
            auto it = lower_bound(V.begin(), V.end(), make_pair(D, -1));
            if (it != V.end())
                rr = it->second;
            //W-mn>=D
            //W>=D+mn
            it = lower_bound(W.begin(), W.end(), make_pair(D + mnl, -1));
            if (it != W.end())
            {
                int r1 = it->second;
                if (rr == -1)
                    rr = r1;
                else
                    rr = min(rr, r1);
            }
            return {rr, mn};
        }
        if (r < L)
            return { -1, 1.1e9};
        pair<int, int> i = left->get1(L, D, mnl);
        pair<int, int> j = right->get1(L, D, min(i.second, mnl));
        j.second = min(j.second, i.second);
        if (i.first != -1)
            j.first = i.first;
        return j;
    }
} medis;
vector<vector<pair<int, int>>>Fl, Fr;
int N;
vector<int>prv;
vector<int>nxt;
void init(int N_, vector<int> H_) {
    N = N_;
    H = H_;
    prv = vector<int>(N, -1);
    nxt = vector<int>(N, N + 1);
    {
        vector<int>A;
        for (int i = 0; i < N; i++)
        {
            while (!A.empty() && H[A.back()] <= H[i])
                A.pop_back();
            if (!A.empty())
                prv[i] = A.back();
            A.push_back(i);
        }
        A.clear();
        for (int i = N - 1; i >= 0; i--)
        {
            while (!A.empty() && H[A.back()] <= H[i])
                A.pop_back();
            if (!A.empty())
                nxt[i] = A.back();
            A.push_back(i);
        }
    }
    vector<int> p(N);
    iota(p.begin(), p.end(), 0);
    sort(p.begin(), p.end(), [&](int a, int b) {return H[a] > H[b];});
    set<int>X;
    medis = ST(0, N - 1);
    auto get = [&](int l, int r)
    {
        if (l + 1 >= r)
            return -1;
        int h = medis.get(l + 1, r - 1);
        return max(0, min(H[l] - h, H[r] - h));
    };
    map<int, vector<pair<int, int>>>L;
    map<int, vector<pair<int, int>>>R;
    auto add = [&](int l, int r, int d, int w)
    {
        R[d].push_back({r, w});
        L[d].push_back({l, w});
    };
    for (int i : p)
    {
        int r = -1, l = -1;
        auto it = X.lower_bound(i);
        if (it != X.end())
        {
            r = *it;
        }
        if (it != X.begin())
        {
            it--;
            l = *it;
        }
        X.insert(i);
        if (l == -1 || r == -1)
        {
            if (r != -1 && i + 1 < r)
                add(i, r, get(i, r), 1);
            if (l != -1 && l + 1 < i)
                add(l, i, get(l, i), 1);
        }
        else
        {
            int d = get(l, r);
            int d1 = get(i, r);
            int d2 = get(l, i);
            if (d1 >= 0 || d2 >= 0)
            {
                add(i, r, d1, 1);
                add(l, i, d2, 1);
                assert(max(d1, d2) <= d);
                add(l, r, max(d1, d2), -1);
            }
        }
    }
    Fl = vector<vector<pair<int, int>>>(N);
    Fr = vector<vector<pair<int, int>>>(N);
    for (const auto &dd : L)
    {
        int d = dd.first;
        for (pair<int, int>lw : dd.second)
            for (int i = lw.first; i < N; i |= i + 1)
            {
                if (!Fl[i].empty() && Fl[i].back().first == d)
                    Fl[i].back().second += lw.second;
                else
                    Fl[i].push_back({d, lw.second});
            }
    }
    for (const auto &dd : R)
    {
        int d = dd.first;
        for (pair<int, int>rw : dd.second)
            for (int i = rw.first; i < N; i |= i + 1)
            {
                if (!Fr[i].empty() && Fr[i].back().first == d)
                    Fr[i].back().second += rw.second;
                else
                    Fr[i].push_back({d, rw.second});
            }
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 1; j < (int)Fl[i].size(); j++)
            Fl[i][j].second += Fl[i][j - 1].second;
        for (int j = 1; j < (int)Fr[i].size(); j++)
            Fr[i][j].second += Fr[i][j - 1].second;
    }
}
int get(int l, int r, int d)
{
    int ret = 0;
    int i = r;
    while (i >= 0)
    {
        if (!Fr[i].empty())
        {
            auto it = lower_bound(Fr[i].begin(), Fr[i].end(), make_pair(d, (int) - 1e9));
            ret += Fr[i].back().second;
            if (it != Fr[i].begin())
            {
                it--;
                ret -= it->second;
            }
        }
        i = (i & (i + 1)) - 1;
    }
    i = l - 1;
    while (i >= 0) {
        if (!Fl[i].empty())
        {
            auto it = lower_bound(Fl[i].begin(), Fl[i].end(), make_pair(d, (int) - 1e9));
            ret -= Fl[i].back().second;
            if (it != Fl[i].begin())
            {
                it--;
                ret += it->second;
            }
        }
        i = (i & (i + 1)) - 1;
    }
    return ret;
}
int max_towers(int L, int R, int D) {
    int xx = medis.get1(L, D).first;
    int yy = -1;
    for (int y = R - 1; y >= L; y--)
    {
        if (medis.get(y + 1, R) + D <= H[y])
        {
            yy = y;
            break;
        }
    }
    if (xx != -1 && yy != -1 && xx <= yy)
        return 2 + get(xx, yy, D);
    return 1;
}

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 6 ms 1940 KB Output is correct
3 Correct 5 ms 1872 KB Output is correct
4 Correct 4 ms 1744 KB Output is correct
5 Correct 5 ms 1744 KB Output is correct
6 Correct 4 ms 1704 KB Output is correct
7 Correct 5 ms 1800 KB Output is correct
8 Correct 2 ms 1360 KB Output is correct
9 Correct 2 ms 1104 KB Output is correct
10 Correct 3 ms 1744 KB Output is correct
11 Correct 3 ms 1744 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 1104 KB Output is correct
14 Correct 1 ms 1104 KB Output is correct
15 Correct 6 ms 1864 KB Output is correct
16 Correct 6 ms 1744 KB Output is correct
17 Correct 5 ms 1744 KB Output is correct
18 Correct 2 ms 976 KB Output is correct
19 Correct 3 ms 1616 KB Output is correct
20 Correct 6 ms 1872 KB Output is correct
21 Correct 4 ms 1744 KB Output is correct
22 Correct 4 ms 1804 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 3 ms 1488 KB Output is correct
25 Correct 3 ms 976 KB Output is correct
26 Correct 5 ms 1940 KB Output is correct
27 Correct 5 ms 1872 KB Output is correct
28 Correct 5 ms 1872 KB Output is correct
29 Correct 7 ms 1744 KB Output is correct
30 Correct 5 ms 1744 KB Output is correct
31 Correct 5 ms 1744 KB Output is correct
32 Correct 2 ms 1360 KB Output is correct
33 Correct 2 ms 1104 KB Output is correct
34 Correct 3 ms 1488 KB Output is correct
35 Correct 3 ms 1488 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 6 ms 1940 KB Output is correct
3 Correct 5 ms 1872 KB Output is correct
4 Correct 4 ms 1744 KB Output is correct
5 Correct 5 ms 1744 KB Output is correct
6 Correct 4 ms 1704 KB Output is correct
7 Correct 5 ms 1800 KB Output is correct
8 Correct 2 ms 1360 KB Output is correct
9 Correct 2 ms 1104 KB Output is correct
10 Correct 3 ms 1744 KB Output is correct
11 Correct 3 ms 1744 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 1104 KB Output is correct
14 Correct 1 ms 1104 KB Output is correct
15 Correct 6 ms 1864 KB Output is correct
16 Correct 6 ms 1744 KB Output is correct
17 Correct 5 ms 1744 KB Output is correct
18 Correct 2 ms 976 KB Output is correct
19 Correct 3 ms 1616 KB Output is correct
20 Correct 6 ms 1872 KB Output is correct
21 Correct 4 ms 1744 KB Output is correct
22 Correct 4 ms 1804 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 3 ms 1488 KB Output is correct
25 Correct 3 ms 976 KB Output is correct
26 Correct 5 ms 1940 KB Output is correct
27 Correct 5 ms 1872 KB Output is correct
28 Correct 5 ms 1872 KB Output is correct
29 Correct 7 ms 1744 KB Output is correct
30 Correct 5 ms 1744 KB Output is correct
31 Correct 5 ms 1744 KB Output is correct
32 Correct 2 ms 1360 KB Output is correct
33 Correct 2 ms 1104 KB Output is correct
34 Correct 3 ms 1488 KB Output is correct
35 Correct 3 ms 1488 KB Output is correct
36 Correct 344 ms 57092 KB Output is correct
37 Correct 565 ms 88500 KB Output is correct
38 Correct 591 ms 88732 KB Output is correct
39 Correct 539 ms 84084 KB Output is correct
40 Correct 521 ms 83808 KB Output is correct
41 Correct 530 ms 83952 KB Output is correct
42 Correct 534 ms 83608 KB Output is correct
43 Correct 122 ms 67980 KB Output is correct
44 Correct 76 ms 40584 KB Output is correct
45 Correct 228 ms 91452 KB Output is correct
46 Correct 176 ms 62304 KB Output is correct
47 Correct 568 ms 88832 KB Output is correct
48 Correct 560 ms 83660 KB Output is correct
49 Correct 548 ms 83400 KB Output is correct
50 Correct 73 ms 40600 KB Output is correct
51 Correct 125 ms 69112 KB Output is correct
52 Correct 576 ms 89072 KB Output is correct
53 Correct 511 ms 83684 KB Output is correct
54 Correct 503 ms 83560 KB Output is correct
55 Correct 77 ms 40552 KB Output is correct
56 Correct 248 ms 95168 KB Output is correct
57 Correct 562 ms 85320 KB Output is correct
58 Correct 563 ms 89188 KB Output is correct
59 Correct 579 ms 88480 KB Output is correct
60 Correct 518 ms 83580 KB Output is correct
61 Correct 514 ms 83712 KB Output is correct
62 Correct 507 ms 83408 KB Output is correct
63 Correct 527 ms 83492 KB Output is correct
64 Correct 127 ms 68036 KB Output is correct
65 Correct 82 ms 40628 KB Output is correct
66 Correct 269 ms 98560 KB Output is correct
67 Correct 90 ms 43576 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1364 ms 88504 KB Output is correct
2 Correct 1769 ms 89332 KB Output is correct
3 Correct 1832 ms 88880 KB Output is correct
4 Correct 1676 ms 84064 KB Output is correct
5 Correct 1814 ms 83436 KB Output is correct
6 Correct 1727 ms 83888 KB Output is correct
7 Correct 1639 ms 83844 KB Output is correct
8 Execution timed out 4009 ms 68020 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 20924 KB Output is correct
2 Correct 1847 ms 89024 KB Output is correct
3 Correct 1649 ms 88804 KB Output is correct
4 Correct 1835 ms 84004 KB Output is correct
5 Correct 1754 ms 83628 KB Output is correct
6 Correct 1588 ms 83660 KB Output is correct
7 Correct 1715 ms 83964 KB Output is correct
8 Execution timed out 4011 ms 67992 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 6 ms 1940 KB Output is correct
3 Correct 5 ms 1872 KB Output is correct
4 Correct 4 ms 1744 KB Output is correct
5 Correct 5 ms 1744 KB Output is correct
6 Correct 4 ms 1704 KB Output is correct
7 Correct 5 ms 1800 KB Output is correct
8 Correct 2 ms 1360 KB Output is correct
9 Correct 2 ms 1104 KB Output is correct
10 Correct 3 ms 1744 KB Output is correct
11 Correct 3 ms 1744 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 1104 KB Output is correct
14 Correct 1 ms 1104 KB Output is correct
15 Correct 6 ms 1864 KB Output is correct
16 Correct 6 ms 1744 KB Output is correct
17 Correct 5 ms 1744 KB Output is correct
18 Correct 2 ms 976 KB Output is correct
19 Correct 3 ms 1616 KB Output is correct
20 Correct 6 ms 1872 KB Output is correct
21 Correct 4 ms 1744 KB Output is correct
22 Correct 4 ms 1804 KB Output is correct
23 Correct 1 ms 976 KB Output is correct
24 Correct 3 ms 1488 KB Output is correct
25 Correct 3 ms 976 KB Output is correct
26 Correct 5 ms 1940 KB Output is correct
27 Correct 5 ms 1872 KB Output is correct
28 Correct 5 ms 1872 KB Output is correct
29 Correct 7 ms 1744 KB Output is correct
30 Correct 5 ms 1744 KB Output is correct
31 Correct 5 ms 1744 KB Output is correct
32 Correct 2 ms 1360 KB Output is correct
33 Correct 2 ms 1104 KB Output is correct
34 Correct 3 ms 1488 KB Output is correct
35 Correct 3 ms 1488 KB Output is correct
36 Correct 344 ms 57092 KB Output is correct
37 Correct 565 ms 88500 KB Output is correct
38 Correct 591 ms 88732 KB Output is correct
39 Correct 539 ms 84084 KB Output is correct
40 Correct 521 ms 83808 KB Output is correct
41 Correct 530 ms 83952 KB Output is correct
42 Correct 534 ms 83608 KB Output is correct
43 Correct 122 ms 67980 KB Output is correct
44 Correct 76 ms 40584 KB Output is correct
45 Correct 228 ms 91452 KB Output is correct
46 Correct 176 ms 62304 KB Output is correct
47 Correct 568 ms 88832 KB Output is correct
48 Correct 560 ms 83660 KB Output is correct
49 Correct 548 ms 83400 KB Output is correct
50 Correct 73 ms 40600 KB Output is correct
51 Correct 125 ms 69112 KB Output is correct
52 Correct 576 ms 89072 KB Output is correct
53 Correct 511 ms 83684 KB Output is correct
54 Correct 503 ms 83560 KB Output is correct
55 Correct 77 ms 40552 KB Output is correct
56 Correct 248 ms 95168 KB Output is correct
57 Correct 562 ms 85320 KB Output is correct
58 Correct 563 ms 89188 KB Output is correct
59 Correct 579 ms 88480 KB Output is correct
60 Correct 518 ms 83580 KB Output is correct
61 Correct 514 ms 83712 KB Output is correct
62 Correct 507 ms 83408 KB Output is correct
63 Correct 527 ms 83492 KB Output is correct
64 Correct 127 ms 68036 KB Output is correct
65 Correct 82 ms 40628 KB Output is correct
66 Correct 269 ms 98560 KB Output is correct
67 Correct 90 ms 43576 KB Output is correct
68 Correct 1364 ms 88504 KB Output is correct
69 Correct 1769 ms 89332 KB Output is correct
70 Correct 1832 ms 88880 KB Output is correct
71 Correct 1676 ms 84064 KB Output is correct
72 Correct 1814 ms 83436 KB Output is correct
73 Correct 1727 ms 83888 KB Output is correct
74 Correct 1639 ms 83844 KB Output is correct
75 Execution timed out 4009 ms 68020 KB Time limit exceeded
76 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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