oj.uz

Submission #641658

# Submission time Handle Problem Language Result Execution time Memory
641658 2022-09-17T11:40:41 Z pls33 Rabbit Carrot (LMIO19_triusis) C++17
63 / 100
 1000 ms 3796 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#pragma region dalykai
using p32 = pair<int, int>;
using p32u = pair<uint32_t, uint32_t>;
using p64 = pair<int64_t, int64_t>;
using p64u = pair<uint64_t, uint64_t>;
using vi16 = vector<int16_t>;
using vi16u = vector<uint16_t>;
using vi32 = vector<int>;
using vi32u = vector<uint32_t>;
using vi64 = vector<int64_t>;
using vi64u = vector<uint64_t>;
using vp32 = vector<p32>;
using vp32u = vector<p32u>;
using vp64 = vector<p64>;
using vp64u = vector<p64u>;
using vvi32 = vector<vi32>;
using vvi32u = vector<vi32u>;
using vvi64 = vector<vi64>;
using vvi64u = vector<vi64u>;
using vvp32 = vector<vp32>;
using vvp32u = vector<vp32u>;
using vvp64 = vector<vp64>;
using vvp64u = vector<vp64u>;

using pf32 = pair<float, float>;
using pf64 = pair<double, double>;
using pf80 = pair<long double, long double>;
using vf32 = vector<float>;
using vf64 = vector<double>;
using vf80 = vector<long double>;
using vpf32 = vector<pf32>;
using vpf64 = vector<pf64>;
using vpf80 = vector<pf80>;
using vvf32 = vector<vf32>;
using vvf64 = vector<vf64>;
using vvf80 = vector<vf80>;
using vvpf32 = vector<vpf32>;
using vvpf64 = vector<vpf64>;
using vvpf80 = vector<vpf80>;

template <typename key, typename val>
using ord_map = tree<key, val, less<key>, rb_tree_tag,
                     tree_order_statistics_node_update>;

template <typename key>
using ord_set = tree<key, null_type, less<key>, rb_tree_tag,
                     tree_order_statistics_node_update>;

const int BUF_SZ = 1 << 15;
inline namespace fast_in
{
    char buf[BUF_SZ];
    int pos;
    int len;

    char next_char(FILE *f)
    {
        if (pos == len)
        {
            pos = 0;
            len = (int)fread(buf, 1, BUF_SZ, f);

            if (!len)
            {
                return EOF;
            }
        }

        return buf[pos++];
    }

    int read_int(FILE *f)
    {
        int x;
        char ch;
        int sgn = 1;

        while (!isdigit(ch = next_char(f)))
        {
            if (ch == '-')
            {
                sgn *= -1;
            }
        }

        x = ch - '0';
        while (isdigit(ch = next_char(f)))
        {
            x = x * 10 + (ch - '0');
        }

        return x * sgn;
    }
}

/**
 * @brief gale programos flush_out kviest!!
 */
inline namespace fast_out
{
    char buf[BUF_SZ];
    int pos;

    void flush_out(FILE *f)
    {
        fwrite(buf, 1, pos, f);
        pos = 0;
    }

    void write_char(char c, FILE *f)
    {
        if (pos == BUF_SZ)
        {
            flush_out(f);
        }

        buf[pos++] = c;
    }

    void write_int(int x, FILE *f)
    {
        static char num_buf[100];

        if (x < 0)
        {
            write_char('-', f);
            x *= -1;
        }

        int len = 0;
        for (; x >= 10; x /= 10)
        {
            num_buf[len++] = (char)('0' + (x % 10));
        }

        write_char((char)('0' + x), f);
        while (len)
        {
            write_char(num_buf[--len], f);
        }
        write_char('\n', f);
    }
}
#pragma endregion

int main()
{
#ifndef _AAAAAAAAA
    ios_base::sync_with_stdio(false);
    cin.tie(0);
#else
    freopen("triusis.in", "r", stdin);
#ifndef __linux__
    atexit([]()
           {
        freopen("con", "r", stdin);
        system("pause"); });
#endif
#endif

    int64_t n, m;
    cin >> n >> m;

    vi64 height(n);

    for (auto &h : height)
    {
        cin >> h;
    }

    vi64 dp(n);
    dp[0] = height.front() <= m;

    int64_t total = dp[0];
    for (int i = 1; i < n; i++)
    {
        int64_t cur = 0;

        // letai...
        for (int prev = 0; prev < i; prev++)
        {
            int64_t diff = height[i] - height[prev];
            int64_t need = m * (i - prev);
            if (diff <= need)
            {
                cur = max(cur, dp[prev]);
            }
        }

        if (cur == 0 && height[i] > m * (i + 1))
        {
            continue;
        }

        dp[i] = cur + 1;
        total = max(total, dp[i]);
    }

    // for (auto &d : dp)
    // {
    //     cout << d << ' ';
    // }
    // cout << '\n';

    cout << n - total << '\n';

    return 0;
}

Compilation message

triusis.cpp:8: warning: ignoring '#pragma region dalykai' [-Wunknown-pragmas]
    8 | #pragma region dalykai
      | 
triusis.cpp:151: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
  151 | #pragma endregion
      |

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 9 ms 324 KB Output is correct
21 Correct 13 ms 340 KB Output is correct
22 Correct 39 ms 408 KB Output is correct
23 Correct 13 ms 432 KB Output is correct
24 Correct 13 ms 340 KB Output is correct
25 Correct 13 ms 340 KB Output is correct
26 Correct 14 ms 424 KB Output is correct
27 Correct 32 ms 420 KB Output is correct
28 Correct 13 ms 384 KB Output is correct
29 Correct 13 ms 340 KB Output is correct
30 Correct 13 ms 420 KB Output is correct
31 Correct 11 ms 428 KB Output is correct
32 Correct 13 ms 340 KB Output is correct
33 Correct 14 ms 340 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 9 ms 324 KB Output is correct
5 Correct 13 ms 340 KB Output is correct
6 Correct 39 ms 408 KB Output is correct
7 Correct 13 ms 432 KB Output is correct
8 Correct 13 ms 340 KB Output is correct
9 Correct 13 ms 340 KB Output is correct
10 Correct 14 ms 424 KB Output is correct
11 Correct 32 ms 420 KB Output is correct
12 Correct 13 ms 384 KB Output is correct
13 Correct 13 ms 340 KB Output is correct
14 Correct 13 ms 420 KB Output is correct
15 Correct 11 ms 428 KB Output is correct
16 Correct 13 ms 340 KB Output is correct
17 Correct 14 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 40 ms 340 KB Output is correct
35 Correct 39 ms 340 KB Output is correct
36 Correct 41 ms 336 KB Output is correct
37 Correct 13 ms 340 KB Output is correct
38 Correct 32 ms 340 KB Output is correct
39 Correct 13 ms 340 KB Output is correct
40 Correct 11 ms 340 KB Output is correct
41 Correct 14 ms 424 KB Output is correct
42 Correct 13 ms 436 KB Output is correct
43 Correct 13 ms 432 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 340 KB Output is correct
2 Correct 39 ms 340 KB Output is correct
3 Correct 41 ms 336 KB Output is correct
4 Correct 13 ms 340 KB Output is correct
5 Correct 32 ms 340 KB Output is correct
6 Correct 13 ms 340 KB Output is correct
7 Correct 11 ms 340 KB Output is correct
8 Correct 14 ms 424 KB Output is correct
9 Correct 13 ms 436 KB Output is correct
10 Correct 13 ms 432 KB Output is correct
11 Correct 0 ms 300 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 9 ms 324 KB Output is correct
15 Correct 13 ms 340 KB Output is correct
16 Correct 39 ms 408 KB Output is correct
17 Correct 13 ms 432 KB Output is correct
18 Correct 13 ms 340 KB Output is correct
19 Correct 13 ms 340 KB Output is correct
20 Correct 14 ms 424 KB Output is correct
21 Correct 32 ms 420 KB Output is correct
22 Correct 13 ms 384 KB Output is correct
23 Correct 13 ms 340 KB Output is correct
24 Correct 13 ms 420 KB Output is correct
25 Correct 11 ms 428 KB Output is correct
26 Correct 13 ms 340 KB Output is correct
27 Correct 14 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 324 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Execution timed out 1095 ms 3796 KB Time limit exceeded
45 Halted 0 ms 0 KB -