oj.uz

Submission #1110034

# Submission time Handle Problem Language Result Execution time Memory
1110034 2024-11-08T13:56:39 Z cpptowin K blocks (IZhO14_blocks) C++17
53 / 100
 1000 ms 15172 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define inf (int)1e9
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
    x += k;
    x %= mod;
    if (x < 0)
        x += mod;
}
void del(int &x, int k)
{
    x -= k;
    x %= mod;
    if (x < 0)
        x += mod;
}
struct SegmentTree
{
    vector<int> st;
    int n;
    /// real n
    SegmentTree(int _n = 0) : n(_n)
    {
        st.resize(4 * n + 10, inf);
    }
    void resize(int _n)
    {
        n = _n;
        st.resize(4 * n + 10, inf);
    }
    void update(int id, int l, int r, int x, int val)
    {
        if (x > r or x < l)
            return;
        if (l == r)
        {
            st[id] += val;
            return;
        }
        int mid = (l + r) >> 1;
        update(id << 1, l, mid, x, val);
        update(id << 1 | 1, mid + 1, r, x, val);
        st[id] = min(st[id << 1], st[id << 1 | 1]);
    }
    void assign(int id, int l, int r, int x, int val)
    {
        if (x > r or x < l)
            return;
        if (l == r)
        {
            st[id] = val;
            return;
        }
        int mid = (l + r) >> 1;
        assign(id << 1, l, mid, x, val);
        assign(id << 1 | 1, mid + 1, r, x, val);
        st[id] = min(st[id << 1], st[id << 1 | 1]);
    }
    int get(int id, int l, int r, int u, int v)
    {
        if (l > v || u > r)
            return inf;
        if (u <= l && r <= v)
            return st[id];
        int mid = (l + r) >> 1;
        return min(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
    }
    int get(int l, int r)
    {
        return get(1, 1, n, l, r);
    }
    void update(int x, int val)
    {
        update(1, 1, n, x, val);
    }
    void assign(int x, int val)
    {
        assign(1, 1, n, x, val);
    }
};
int n, k, a[maxn];
int l[maxn], r[maxn], f[2][maxn];
void L(int a[], int n, int ans[])
{
    stack<int> st;
    fo(i, 1, n)
    {
        while (st.size() and a[st.top()] <= a[i])
            st.pop();
        ans[i] = (st.empty() ? 0 : st.top());
        st.push(i);
    }
}
void R(int a[], int n, int ans[])
{
    stack<int> st;
    fod(i, n, 1)
    {
        while (st.size() and a[st.top()] <= a[i])
            st.pop();
        ans[i] = (st.empty() ? n + 1 : st.top());
        st.push(i);
    }
}
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    fo(i, 1, n) cin >> a[i];
    L(a, n, l);
    R(a, n, r);
    int maxx = 0;
    fo(i,1,n) maximize(maxx,a[i]),f[1][i] = maxx;
    fo(j, 2, k)
    {
        SegmentTree st(n);
        priority_queue<pii,vii,greater<pii>> q;
        fo(i, 1, n)
        {
            f[j & 1][i] = st.get(l[i], i - 1) + a[i];
            while(ss(q) and q.top().se < i) q.pop();
            if(ss(q))
            minimize(f[j & 1][i],q.top().fi);
            st.assign(i,f[j & 1 ^ 1][i]);
            q.push({f[j & 1][i],r[i] - 1});
        }
    }
    int ans = inf;
    fod(i, n, 1) if (r[i] == n + 1) minimize(ans, f[k & 1][i]);
    cout << ans;
}

Compilation message

blocks.cpp:147:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  147 | main()
      | ^~~~
blocks.cpp: In function 'int main()':
blocks.cpp:173:29: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
  173 |             st.assign(i,f[j & 1 ^ 1][i]);
      |                           ~~^~~
blocks.cpp:152:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  152 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:153:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  153 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 2 ms 8528 KB Output is correct
5 Correct 2 ms 8528 KB Output is correct
6 Correct 2 ms 8528 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 1 ms 8528 KB Output is correct
10 Correct 2 ms 8528 KB Output is correct
11 Correct 2 ms 8528 KB Output is correct
12 Correct 2 ms 8528 KB Output is correct
13 Correct 2 ms 8528 KB Output is correct
14 Correct 2 ms 8696 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Correct 2 ms 8528 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 2 ms 8528 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8668 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 2 ms 8528 KB Output is correct
5 Correct 1 ms 8528 KB Output is correct
6 Correct 2 ms 8528 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 1 ms 8528 KB Output is correct
9 Correct 2 ms 8528 KB Output is correct
10 Correct 1 ms 8528 KB Output is correct
11 Correct 2 ms 8528 KB Output is correct
12 Correct 1 ms 8528 KB Output is correct
13 Correct 1 ms 8528 KB Output is correct
14 Correct 1 ms 8528 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Correct 2 ms 8528 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 1 ms 8528 KB Output is correct
19 Correct 1 ms 8528 KB Output is correct
20 Correct 2 ms 8528 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 2 ms 8528 KB Output is correct
5 Correct 2 ms 8528 KB Output is correct
6 Correct 2 ms 8528 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 1 ms 8528 KB Output is correct
10 Correct 2 ms 8528 KB Output is correct
11 Correct 2 ms 8528 KB Output is correct
12 Correct 2 ms 8528 KB Output is correct
13 Correct 2 ms 8528 KB Output is correct
14 Correct 2 ms 8696 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Correct 2 ms 8528 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 2 ms 8528 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 2 ms 8668 KB Output is correct
21 Correct 2 ms 8528 KB Output is correct
22 Correct 2 ms 8528 KB Output is correct
23 Correct 1 ms 8528 KB Output is correct
24 Correct 2 ms 8528 KB Output is correct
25 Correct 2 ms 8528 KB Output is correct
26 Correct 1 ms 8528 KB Output is correct
27 Correct 2 ms 8528 KB Output is correct
28 Correct 1 ms 8528 KB Output is correct
29 Correct 2 ms 8528 KB Output is correct
30 Correct 1 ms 8528 KB Output is correct
31 Correct 1 ms 8528 KB Output is correct
32 Correct 1 ms 8528 KB Output is correct
33 Correct 2 ms 8528 KB Output is correct
34 Correct 2 ms 8528 KB Output is correct
35 Correct 2 ms 8528 KB Output is correct
36 Correct 1 ms 8528 KB Output is correct
37 Correct 1 ms 8528 KB Output is correct
38 Correct 2 ms 8528 KB Output is correct
39 Correct 2 ms 8528 KB Output is correct
40 Correct 2 ms 8528 KB Output is correct
41 Correct 2 ms 8528 KB Output is correct
42 Correct 2 ms 8664 KB Output is correct
43 Correct 2 ms 8528 KB Output is correct
44 Correct 1 ms 8528 KB Output is correct
45 Correct 1 ms 8536 KB Output is correct
46 Correct 2 ms 8692 KB Output is correct
47 Correct 1 ms 8528 KB Output is correct
48 Correct 2 ms 8528 KB Output is correct
49 Correct 2 ms 8528 KB Output is correct
50 Correct 2 ms 8528 KB Output is correct
51 Correct 2 ms 8528 KB Output is correct
52 Correct 2 ms 8528 KB Output is correct
53 Correct 2 ms 8696 KB Output is correct
54 Correct 3 ms 8696 KB Output is correct
55 Correct 2 ms 8528 KB Output is correct
56 Correct 3 ms 8528 KB Output is correct
57 Correct 2 ms 8528 KB Output is correct

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 2 ms 8528 KB Output is correct
5 Correct 2 ms 8528 KB Output is correct
6 Correct 2 ms 8528 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 1 ms 8528 KB Output is correct
10 Correct 2 ms 8528 KB Output is correct
11 Correct 2 ms 8528 KB Output is correct
12 Correct 2 ms 8528 KB Output is correct
13 Correct 2 ms 8528 KB Output is correct
14 Correct 2 ms 8696 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Correct 2 ms 8528 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 2 ms 8528 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 2 ms 8668 KB Output is correct
21 Correct 2 ms 8528 KB Output is correct
22 Correct 2 ms 8528 KB Output is correct
23 Correct 1 ms 8528 KB Output is correct
24 Correct 2 ms 8528 KB Output is correct
25 Correct 2 ms 8528 KB Output is correct
26 Correct 1 ms 8528 KB Output is correct
27 Correct 2 ms 8528 KB Output is correct
28 Correct 1 ms 8528 KB Output is correct
29 Correct 2 ms 8528 KB Output is correct
30 Correct 1 ms 8528 KB Output is correct
31 Correct 1 ms 8528 KB Output is correct
32 Correct 1 ms 8528 KB Output is correct
33 Correct 2 ms 8528 KB Output is correct
34 Correct 2 ms 8528 KB Output is correct
35 Correct 2 ms 8528 KB Output is correct
36 Correct 1 ms 8528 KB Output is correct
37 Correct 1 ms 8528 KB Output is correct
38 Correct 2 ms 8528 KB Output is correct
39 Correct 2 ms 8528 KB Output is correct
40 Correct 2 ms 8528 KB Output is correct
41 Correct 2 ms 8528 KB Output is correct
42 Correct 2 ms 8664 KB Output is correct
43 Correct 2 ms 8528 KB Output is correct
44 Correct 1 ms 8528 KB Output is correct
45 Correct 1 ms 8536 KB Output is correct
46 Correct 2 ms 8692 KB Output is correct
47 Correct 1 ms 8528 KB Output is correct
48 Correct 2 ms 8528 KB Output is correct
49 Correct 2 ms 8528 KB Output is correct
50 Correct 2 ms 8528 KB Output is correct
51 Correct 2 ms 8528 KB Output is correct
52 Correct 2 ms 8528 KB Output is correct
53 Correct 2 ms 8696 KB Output is correct
54 Correct 3 ms 8696 KB Output is correct
55 Correct 2 ms 8528 KB Output is correct
56 Correct 3 ms 8528 KB Output is correct
57 Correct 2 ms 8528 KB Output is correct
58 Correct 36 ms 8892 KB Output is correct
59 Correct 5 ms 8528 KB Output is correct
60 Correct 47 ms 11600 KB Output is correct
61 Correct 535 ms 11600 KB Output is correct
62 Execution timed out 1045 ms 15172 KB Time limit exceeded
63 Halted 0 ms 0 KB -