oj.uz

답안 #635256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
635256 2022-08-25T18:23:16 Z tutis 송신탑 (IOI22_towers) C++17
11 / 100
 4000 ms 68384 KB 
#include "towers.h"

#include <bits/stdc++.h>
using namespace std;
struct ST
{
    int l, r;
    ST *left, *right;
    int mn;
    ST(int l, int r, const vector<int>& h): l(l), r(r)
    {
        if (l < r)
        {
            left = new ST(l, (l + r) / 2, h);
            right = new ST((l + r) / 2 + 1, r, h);
            mn = min(left->mn, right->mn);
        }
        else
        {
            left = right = NULL;
            mn = h[l];
        }
    }
    int get(int x, int y)
    {
        if (x <= l && r <= y)
            return mn;
        if (r < x || y < l)
            return 2e9;
        return min(left->get(x, y), right->get(x, y));
    }
};
vector<vector<pair<int, int>>>Fl, Fr;
int N;
vector<int>H;
void init(int N_, vector<int> H_) {
    N = N_;
    H = H_;
    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;
    ST medis(0, N - 1, H);
    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 = -1;
    int yy = -1;
    for (int x = L + 1; x <= R; x++)
    {
        for (int x1 = L; x1 < x; x1++)
            if (H[x] >= H[x1] + D)
                xx = x;
        if (xx != -1)
            break;
    }
    for (int y = R; y >= L; y--)
    {
        for (int y1 = y + 1; y1 <= R; y1++)
            if (H[y] >= H[y1] + D)
                yy = y;
        if (yy != -1)
            break;
    }
    if (xx != -1 && yy != -1 && xx <= yy)
        return 2 + get(xx, yy, D);
    return 1;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4070 ms 12360 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 5 ms 1488 KB Output is correct
3 Correct 6 ms 1488 KB Output is correct
4 Correct 4 ms 1360 KB Output is correct
5 Correct 6 ms 1360 KB Output is correct
6 Correct 5 ms 1360 KB Output is correct
7 Correct 4 ms 1320 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 3 ms 1140 KB Output is correct
11 Correct 4 ms 1360 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 704 KB Output is correct
15 Correct 6 ms 1440 KB Output is correct
16 Correct 4 ms 1360 KB Output is correct
17 Correct 4 ms 1360 KB Output is correct
18 Correct 1 ms 688 KB Output is correct
19 Correct 2 ms 976 KB Output is correct
20 Correct 5 ms 1488 KB Output is correct
21 Correct 4 ms 1360 KB Output is correct
22 Correct 4 ms 1360 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 2 ms 720 KB Output is correct
26 Correct 5 ms 1488 KB Output is correct
27 Correct 4 ms 1488 KB Output is correct
28 Correct 4 ms 1360 KB Output is correct
29 Correct 4 ms 1392 KB Output is correct
30 Correct 4 ms 1360 KB Output is correct
31 Correct 4 ms 1360 KB Output is correct
32 Correct 3 ms 592 KB Output is correct
33 Correct 3 ms 592 KB Output is correct
34 Correct 4 ms 848 KB Output is correct
35 Correct 2 ms 1144 KB Output is correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 5 ms 1488 KB Output is correct
3 Correct 6 ms 1488 KB Output is correct
4 Correct 4 ms 1360 KB Output is correct
5 Correct 6 ms 1360 KB Output is correct
6 Correct 5 ms 1360 KB Output is correct
7 Correct 4 ms 1320 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 3 ms 1140 KB Output is correct
11 Correct 4 ms 1360 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 704 KB Output is correct
15 Correct 6 ms 1440 KB Output is correct
16 Correct 4 ms 1360 KB Output is correct
17 Correct 4 ms 1360 KB Output is correct
18 Correct 1 ms 688 KB Output is correct
19 Correct 2 ms 976 KB Output is correct
20 Correct 5 ms 1488 KB Output is correct
21 Correct 4 ms 1360 KB Output is correct
22 Correct 4 ms 1360 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 2 ms 720 KB Output is correct
26 Correct 5 ms 1488 KB Output is correct
27 Correct 4 ms 1488 KB Output is correct
28 Correct 4 ms 1360 KB Output is correct
29 Correct 4 ms 1392 KB Output is correct
30 Correct 4 ms 1360 KB Output is correct
31 Correct 4 ms 1360 KB Output is correct
32 Correct 3 ms 592 KB Output is correct
33 Correct 3 ms 592 KB Output is correct
34 Correct 4 ms 848 KB Output is correct
35 Correct 2 ms 1144 KB Output is correct
36 Correct 313 ms 43436 KB Output is correct
37 Correct 550 ms 67768 KB Output is correct
38 Correct 529 ms 67892 KB Output is correct
39 Correct 475 ms 63260 KB Output is correct
40 Correct 480 ms 63196 KB Output is correct
41 Correct 493 ms 63392 KB Output is correct
42 Correct 469 ms 62860 KB Output is correct
43 Correct 1129 ms 20548 KB Output is correct
44 Correct 184 ms 20536 KB Output is correct
45 Correct 176 ms 46124 KB Output is correct
46 Correct 139 ms 42168 KB Output is correct
47 Correct 539 ms 67852 KB Output is correct
48 Correct 466 ms 62992 KB Output is correct
49 Correct 464 ms 62704 KB Output is correct
50 Correct 223 ms 20640 KB Output is correct
51 Correct 207 ms 21760 KB Output is correct
52 Correct 534 ms 68220 KB Output is correct
53 Correct 463 ms 63036 KB Output is correct
54 Correct 473 ms 63056 KB Output is correct
55 Correct 3640 ms 20556 KB Output is correct
56 Correct 562 ms 49728 KB Output is correct
57 Correct 503 ms 65172 KB Output is correct
58 Correct 532 ms 68384 KB Output is correct
59 Correct 515 ms 67644 KB Output is correct
60 Correct 457 ms 63048 KB Output is correct
61 Correct 471 ms 63196 KB Output is correct
62 Correct 458 ms 62756 KB Output is correct
63 Correct 477 ms 62976 KB Output is correct
64 Execution timed out 4057 ms 20552 KB Time limit exceeded
65 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1297 ms 67780 KB Output is correct
2 Correct 1545 ms 68272 KB Output is correct
3 Correct 1462 ms 68052 KB Output is correct
4 Correct 1262 ms 63396 KB Output is correct
5 Correct 1480 ms 62868 KB Output is correct
6 Correct 1346 ms 63256 KB Output is correct
7 Correct 1323 ms 63192 KB Output is correct
8 Execution timed out 4025 ms 20552 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4059 ms 15912 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 5 ms 1488 KB Output is correct
3 Correct 6 ms 1488 KB Output is correct
4 Correct 4 ms 1360 KB Output is correct
5 Correct 6 ms 1360 KB Output is correct
6 Correct 5 ms 1360 KB Output is correct
7 Correct 4 ms 1320 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 3 ms 1140 KB Output is correct
11 Correct 4 ms 1360 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 704 KB Output is correct
15 Correct 6 ms 1440 KB Output is correct
16 Correct 4 ms 1360 KB Output is correct
17 Correct 4 ms 1360 KB Output is correct
18 Correct 1 ms 688 KB Output is correct
19 Correct 2 ms 976 KB Output is correct
20 Correct 5 ms 1488 KB Output is correct
21 Correct 4 ms 1360 KB Output is correct
22 Correct 4 ms 1360 KB Output is correct
23 Correct 2 ms 592 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 2 ms 720 KB Output is correct
26 Correct 5 ms 1488 KB Output is correct
27 Correct 4 ms 1488 KB Output is correct
28 Correct 4 ms 1360 KB Output is correct
29 Correct 4 ms 1392 KB Output is correct
30 Correct 4 ms 1360 KB Output is correct
31 Correct 4 ms 1360 KB Output is correct
32 Correct 3 ms 592 KB Output is correct
33 Correct 3 ms 592 KB Output is correct
34 Correct 4 ms 848 KB Output is correct
35 Correct 2 ms 1144 KB Output is correct
36 Correct 313 ms 43436 KB Output is correct
37 Correct 550 ms 67768 KB Output is correct
38 Correct 529 ms 67892 KB Output is correct
39 Correct 475 ms 63260 KB Output is correct
40 Correct 480 ms 63196 KB Output is correct
41 Correct 493 ms 63392 KB Output is correct
42 Correct 469 ms 62860 KB Output is correct
43 Correct 1129 ms 20548 KB Output is correct
44 Correct 184 ms 20536 KB Output is correct
45 Correct 176 ms 46124 KB Output is correct
46 Correct 139 ms 42168 KB Output is correct
47 Correct 539 ms 67852 KB Output is correct
48 Correct 466 ms 62992 KB Output is correct
49 Correct 464 ms 62704 KB Output is correct
50 Correct 223 ms 20640 KB Output is correct
51 Correct 207 ms 21760 KB Output is correct
52 Correct 534 ms 68220 KB Output is correct
53 Correct 463 ms 63036 KB Output is correct
54 Correct 473 ms 63056 KB Output is correct
55 Correct 3640 ms 20556 KB Output is correct
56 Correct 562 ms 49728 KB Output is correct
57 Correct 503 ms 65172 KB Output is correct
58 Correct 532 ms 68384 KB Output is correct
59 Correct 515 ms 67644 KB Output is correct
60 Correct 457 ms 63048 KB Output is correct
61 Correct 471 ms 63196 KB Output is correct
62 Correct 458 ms 62756 KB Output is correct
63 Correct 477 ms 62976 KB Output is correct
64 Execution timed out 4057 ms 20552 KB Time limit exceeded
65 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4070 ms 12360 KB Time limit exceeded
2 Halted 0 ms 0 KB -