oj.uz

답안 #817078

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
817078 2023-08-09T09:12:35 Z finn__ 송신탑 (IOI22_towers) C++17
4 / 100
 4000 ms 17488 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

template <typename T, size_t L>
struct segtree_max
{
    T t[L << 1];

    void update(size_t i, T x)
    {
        i += L;
        t[i] = max(t[i], x);
        while (i >>= 1)
            t[i] = max(t[i << 1], t[i << 1 | 1]);
    }

    T range_max(size_t i, size_t j)
    {
        i += L, j += L;
        T x = numeric_limits<T>::min();

        while (i <= j)
        {
            if (i & 1)
                x = max(x, t[i++]);
            if (!(j & 1))
                x = max(x, t[j--]);
            i >>= 1;
            j >>= 1;
        }

        return x;
    }

    void reset() { memset(t, 0, sizeof t); }
};

template <typename T, size_t L>
struct fenwick_tree
{
    T t[L];

    void update(int64_t i, T x)
    {
        ++i;
        while (i <= L)
            t[i - 1] += x, i += i & -i;
    }

    T range_sum(int64_t i, int64_t j)
    {
        ++j;
        T x = 0;
        while (j)
            x += t[j - 1], j -= j & -j;
        while (i)
            x -= t[i - 1], i -= i & -i;
        return x;
    }
};

constexpr size_t N = 100000;

bool subtask1;
int h[N], coords[3 * N];
size_t n, peak_pos;

segtree_max<int64_t, 1 << 19> towers, intermediate;
fenwick_tree<int, N> valleys;

void init(int n_, vector<int> h_)
{
    n = n_;
    copy(h_.begin(), h_.end(), h);
    bool increasing = 1;
    subtask1 = 1;
    for (size_t i = 0; i + 1 < n; ++i)
    {
        if (h[i] < h[i + 1] && !increasing)
        {
            subtask1 = 0;
            break;
        }
        if (h[i] > h[i + 1])
            increasing = 0;
    }

    if (subtask1)
    {
        while (peak_pos + 1 < n && h[peak_pos + 1] > h[peak_pos])
            ++peak_pos;
        return;
    }

    for (size_t i = 0; i < n; ++i)
        if ((!i || h[i - 1] > h[i]) && (i + 1 == n || h[i + 1] > h[i]))
            valleys.update(i, 1);
}

size_t ind(int64_t coord) { return lower_bound(coords, coords + 3 * n, coord) - coords; }

int max_towers(int l, int r, int d)
{
    if (subtask1)
    {
        if (l >= peak_pos || r <= peak_pos)
            return 1;
        return (h[peak_pos] >= h[l] + d && h[peak_pos] >= h[r] + d) + 1;
    }
    else if (d == 1)
    {
        return valleys.range_sum(l, r);
    }
    else
    {
        memcpy(coords, h, sizeof h);
        for (size_t i = 0; i < n; ++i)
            coords[n + i] = coords[i] + d, coords[2 * n + i] = coords[i] - d;
        sort(coords, coords + 3 * n);

        towers.reset();
        intermediate.reset();

        towers.update(ind(h[l]), 1);
        int ans = 1;
        for (size_t i = l + 1; i <= r; ++i)
        {
            // as intermediate
            int64_t v = towers.range_max(0, ind(h[i] - d));
            intermediate.update(ind(h[i]), v);

            // as tower
            v = intermediate.range_max(ind(h[i] + d), 3 * n - 1) + 1;
            towers.update(ind(h[i]), v);
            ans = max<int>(ans, v);
        }

        return ans;
    }
}

Compilation message

towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:107:15: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
  107 |         if (l >= peak_pos || r <= peak_pos)
      |             ~~^~~~~~~~~~~
towers.cpp:107:32: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
  107 |         if (l >= peak_pos || r <= peak_pos)
      |                              ~~^~~~~~~~~~~
towers.cpp:127:34: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  127 |         for (size_t i = l + 1; i <= r; ++i)
      |                                ~~^~~~
towers.cpp: In instantiation of 'void fenwick_tree<T, L>::update(int64_t, T) [with T = int; long unsigned int L = 100000; int64_t = long int]':
towers.cpp:98:32:   required from here
towers.cpp:47:18: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'long unsigned int' [-Wsign-compare]
   47 |         while (i <= L)
      |                ~~^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 976 KB Output is correct
2 Correct 712 ms 1476 KB Output is correct
3 Correct 651 ms 1476 KB Output is correct
4 Correct 697 ms 1360 KB Output is correct
5 Correct 595 ms 1352 KB Output is correct
6 Correct 740 ms 1360 KB Output is correct
7 Correct 660 ms 1488 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17104 KB Output is correct
2 Correct 8 ms 17160 KB Output is correct
3 Correct 7 ms 17112 KB Output is correct
4 Correct 8 ms 17104 KB Output is correct
5 Correct 8 ms 17104 KB Output is correct
6 Correct 8 ms 17160 KB Output is correct
7 Correct 8 ms 17104 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 7 ms 17044 KB Output is correct
11 Correct 8 ms 17104 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '79', found: '78'
16 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17104 KB Output is correct
2 Correct 8 ms 17160 KB Output is correct
3 Correct 7 ms 17112 KB Output is correct
4 Correct 8 ms 17104 KB Output is correct
5 Correct 8 ms 17104 KB Output is correct
6 Correct 8 ms 17160 KB Output is correct
7 Correct 8 ms 17104 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 7 ms 17044 KB Output is correct
11 Correct 8 ms 17104 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '79', found: '78'
16 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 586 ms 1852 KB 1st lines differ - on the 1st token, expected: '11903', found: '11902'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17104 KB Output is correct
2 Correct 8 ms 17160 KB Output is correct
3 Correct 7 ms 17112 KB Output is correct
4 Correct 8 ms 17104 KB Output is correct
5 Correct 8 ms 17104 KB Output is correct
6 Correct 8 ms 17160 KB Output is correct
7 Correct 8 ms 17104 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 7 ms 17044 KB Output is correct
11 Correct 8 ms 17104 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '79', found: '78'
16 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 976 KB Output is correct
2 Correct 712 ms 1476 KB Output is correct
3 Correct 651 ms 1476 KB Output is correct
4 Correct 697 ms 1360 KB Output is correct
5 Correct 595 ms 1352 KB Output is correct
6 Correct 740 ms 1360 KB Output is correct
7 Correct 660 ms 1488 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 8 ms 17104 KB Output is correct
12 Correct 8 ms 17160 KB Output is correct
13 Correct 7 ms 17112 KB Output is correct
14 Correct 8 ms 17104 KB Output is correct
15 Correct 8 ms 17104 KB Output is correct
16 Correct 8 ms 17160 KB Output is correct
17 Correct 8 ms 17104 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 7 ms 17044 KB Output is correct
21 Correct 8 ms 17104 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '79', found: '78'
26 Halted 0 ms 0 KB -