oj.uz

Submission #1110037

# Submission time Handle Problem Language Result Execution time Memory
1110037 2024-11-08T14:08:09 Z cpptowin K blocks (IZhO14_blocks) C++17
100 / 100
 902 ms 24788 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;
}
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);
    }
}
int rmq[maxn][18];
int get(int l,int r) 
{
    if(l > r) return inf;
    int lg = __lg(r - l + 1);
    return min(rmq[l][lg],rmq[r - (1 << lg) + 1][lg]);
}
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)
    {
        priority_queue<pii,vii,greater<pii>> q;
        fo(i,1,n) rmq[i][0] = f[j & 1 ^ 1][i];
        fo(k,1,17) fo(i,1,n)
        rmq[i][k] = min(rmq[i][k - 1],rmq[i + (1 << k - 1)][k - 1]);
        fo(i, 1, n)
        {
            f[j & 1][i] = get(max(l[i],1), 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);
            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:90:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   90 | main()
      | ^~~~
blocks.cpp: In function 'int main()':
blocks.cpp:109:35: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
  109 |         fo(i,1,n) rmq[i][0] = f[j & 1 ^ 1][i];
      |                                 ~~^~~
blocks.cpp:111:55: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  111 |         rmq[i][k] = min(rmq[i][k - 1],rmq[i + (1 << k - 1)][k - 1]);
      |                                                     ~~^~~
blocks.cpp:95:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:96:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |         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 1 ms 8528 KB Output is correct
3 Correct 1 ms 8528 KB Output is correct
4 Correct 2 ms 10576 KB Output is correct
5 Correct 2 ms 10576 KB Output is correct
6 Correct 1 ms 8528 KB Output is correct
7 Correct 2 ms 10576 KB Output is correct
8 Correct 2 ms 10576 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 2 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 1 ms 8528 KB Output is correct
13 Correct 2 ms 10748 KB Output is correct
14 Correct 2 ms 10576 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 2 ms 10576 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 1 ms 8528 KB Output is correct
3 Correct 1 ms 8528 KB Output is correct
4 Correct 2 ms 10576 KB Output is correct
5 Correct 2 ms 10576 KB Output is correct
6 Correct 1 ms 8528 KB Output is correct
7 Correct 2 ms 10576 KB Output is correct
8 Correct 2 ms 10576 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 2 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 1 ms 8528 KB Output is correct
13 Correct 2 ms 10748 KB Output is correct
14 Correct 2 ms 10576 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 2 ms 10576 KB Output is correct
19 Correct 1 ms 8700 KB Output is correct
20 Correct 1 ms 8528 KB Output is correct
21 Correct 2 ms 8528 KB Output is correct
22 Correct 2 ms 10576 KB Output is correct
23 Correct 2 ms 10576 KB Output is correct
24 Correct 2 ms 8528 KB Output is correct
25 Correct 2 ms 10576 KB Output is correct
26 Correct 2 ms 10576 KB Output is correct
27 Correct 2 ms 10576 KB Output is correct
28 Correct 2 ms 10576 KB Output is correct
29 Correct 2 ms 10576 KB Output is correct
30 Correct 2 ms 10576 KB Output is correct
31 Correct 2 ms 10576 KB Output is correct
32 Correct 2 ms 10576 KB Output is correct
33 Correct 2 ms 10576 KB Output is correct
34 Correct 2 ms 10576 KB Output is correct
35 Correct 1 ms 10576 KB Output is correct
36 Correct 2 ms 10576 KB Output is correct
37 Correct 2 ms 10576 KB Output is correct
38 Correct 2 ms 10576 KB Output is correct
39 Correct 2 ms 10576 KB Output is correct
40 Correct 2 ms 8528 KB Output is correct
41 Correct 2 ms 8696 KB Output is correct
42 Correct 1 ms 8528 KB Output is correct
43 Correct 2 ms 10576 KB Output is correct
44 Correct 2 ms 10576 KB Output is correct
45 Correct 2 ms 8528 KB Output is correct
46 Correct 2 ms 10576 KB Output is correct
47 Correct 1 ms 10576 KB Output is correct
48 Correct 1 ms 10576 KB Output is correct
49 Correct 2 ms 10576 KB Output is correct
50 Correct 2 ms 10576 KB Output is correct
51 Correct 2 ms 10744 KB Output is correct
52 Correct 2 ms 10576 KB Output is correct
53 Correct 3 ms 10744 KB Output is correct
54 Correct 2 ms 10576 KB Output is correct
55 Correct 2 ms 10576 KB Output is correct
56 Correct 2 ms 10576 KB Output is correct
57 Correct 3 ms 10576 KB Output is correct
58 Correct 15 ms 12880 KB Output is correct
59 Correct 5 ms 10576 KB Output is correct
60 Correct 21 ms 17116 KB Output is correct
61 Correct 157 ms 16976 KB Output is correct
62 Correct 544 ms 23252 KB Output is correct
63 Correct 21 ms 23884 KB Output is correct
64 Correct 220 ms 23884 KB Output is correct
65 Correct 2 ms 10576 KB Output is correct
66 Correct 2 ms 10576 KB Output is correct
67 Correct 2 ms 10576 KB Output is correct
68 Correct 2 ms 10624 KB Output is correct
69 Correct 2 ms 8528 KB Output is correct
70 Correct 3 ms 10576 KB Output is correct
71 Correct 76 ms 13048 KB Output is correct
72 Correct 4 ms 13024 KB Output is correct
73 Correct 21 ms 12880 KB Output is correct
74 Correct 5 ms 10832 KB Output is correct
75 Correct 30 ms 17348 KB Output is correct
76 Correct 237 ms 17232 KB Output is correct
77 Correct 712 ms 23888 KB Output is correct
78 Correct 28 ms 23680 KB Output is correct
79 Correct 308 ms 23892 KB Output is correct
80 Correct 13 ms 13392 KB Output is correct
81 Correct 79 ms 23888 KB Output is correct
82 Correct 745 ms 23892 KB Output is correct
83 Correct 1 ms 8528 KB Output is correct
84 Correct 2 ms 10576 KB Output is correct
85 Correct 85 ms 13136 KB Output is correct
86 Correct 4 ms 13136 KB Output is correct
87 Correct 22 ms 13136 KB Output is correct
88 Correct 5 ms 11088 KB Output is correct
89 Correct 34 ms 17860 KB Output is correct
90 Correct 312 ms 17816 KB Output is correct
91 Correct 902 ms 24760 KB Output is correct
92 Correct 32 ms 24668 KB Output is correct
93 Correct 399 ms 24788 KB Output is correct
94 Correct 4 ms 12880 KB Output is correct
95 Correct 51 ms 13040 KB Output is correct
96 Correct 3 ms 10576 KB Output is correct
97 Correct 2 ms 8664 KB Output is correct
98 Correct 2 ms 10576 KB Output is correct
99 Correct 2 ms 10576 KB Output is correct