oj.uz

답안 #1110023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1110023 2024-11-08T13:35:20 Z cpptowin K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 3 ms 8784 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 int long long
#define inf (int)1e18
#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 walkright(int id, int l, int r, int x, int val)
    {
        if (st[id] >= val)
            return -1;
        if (r < x)
            return -1;
        if (l == r)
            return l;
        int ans = -1;
        int mid = (l + r) >> 1;
        if (st[id << 1] < val)
            ans = walkright(id << 1, l, mid, x, val);
        if (ans == -1)
            ans = walkright(id << 1 | 1, mid + 1, r, x, val);
        return ans;
    }
    int walkleft(int id, int l, int r, int x, int val)
    {
        if (st[id] >= val)
            return -1;
        if (x < l)
            return -1;
        if (l == r)
            return l;
        int ans = -1;
        int mid = (l + r) >> 1;
        if (st[id << 1 | 1] < val)
            ans = walkleft(id << 1 | 1, mid + 1, r, x, val);
        if (ans == -1)
            ans = walkleft(id << 1, l, mid, x, val);
        return ans;
    }
    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 walkleft(int x, int val)
    {
        return walkleft(1, 1, n, x, val);
    }
    int walkright(int x, int val)
    {
        return walkright(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);
        fo(i, 1, n)
        {
            f[j & 1][i] = st.get(l[i], i - 1) + a[i];
            st.assign(i,f[j & 1 ^ 1][i]);
        }
    }
    int ans = inf;
    fod(i, n, 1) if (r[i] == n + 1) minimize(ans, f[k & 1][i]);
    cout << ans;
}

Compilation message

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

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8696 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 8660 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 1 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 3 ms 8696 KB Output is correct
14 Correct 2 ms 8528 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Incorrect 2 ms 8528 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 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 8696 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 1 ms 8528 KB Output is correct
9 Correct 2 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 8528 KB Output is correct
15 Incorrect 1 ms 8528 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8696 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 8660 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 1 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 3 ms 8696 KB Output is correct
14 Correct 2 ms 8528 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Incorrect 2 ms 8528 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8528 KB Output is correct
2 Correct 2 ms 8528 KB Output is correct
3 Correct 2 ms 8696 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 8660 KB Output is correct
7 Correct 2 ms 8528 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 1 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 3 ms 8696 KB Output is correct
14 Correct 2 ms 8528 KB Output is correct
15 Correct 2 ms 8528 KB Output is correct
16 Incorrect 2 ms 8528 KB Output isn't correct
17 Halted 0 ms 0 KB -