oj.uz

답안 #885593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885593 2023-12-10T09:19:45 Z rukashii 3단 점프 (JOI19_jumps) C++17
100 / 100
 816 ms 193424 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define file  if (fopen("input.txt", "r")) { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); }
// #define int long long
#define f first
#define s second
 
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
    if (s.size()) setIn(s+".inp"), setOut(s+".out");
}
 
const int maxn = 5e5 + 2;
 
int a[maxn], n, q;
 
namespace Sub1
{
    void solve()
    {
        while (q--)
        {
            int l, r, ans = 0;
            cin >> l >> r;
 
            for (int i = l; i <= r; i++)
            {
                for (int j = i + 1; j <= r; j++)
                {
                    for (int k = j + 1; k <= r; k++)
                    {
                        if (k - j >= j - i)
                        {
                            ans = max(ans, a[i] + a[j] + a[k]);
                        }
                    }
                }
            }
 
            cout << ans << '\n';
        }
    }
} // namespace Sub1
 
namespace Sub2
{
    const int s2maxn = 5002;
 
    int dp[s2maxn][s2maxn], mx[s2maxn][s2maxn];
    void solve()
    {
        for (int i = 1; i <= n; i++)
        {
            mx[i][i] = a[i];
        }
 
        for (int i = 1; i <= n; i++)
        {
            for (int j = i + 1; j <= n; j++)
            {
                mx[i][j] = max(mx[i][j - 1], a[j]);
            }
        }
 
        for (int sz = 3; sz <= n; sz++)
        {
            for (int i = 1; i + sz - 1 <= n; i++)
            {
                int l = i, r = i + sz - 1;
                // if (sz == 3 && i == 1)
                    // cout << l << ' ' << r << ' ' << (l + r) / 2 << ' ' << mx[l][(l + r) / 2] << '\n';
                dp[l][r] = max({dp[l + 1][r], dp[l][r - 1], a[l] + a[r] + mx[l + 1][(l + r) / 2]});
            }
        }
 
        while (q--)
        {
            int l, r;
            cin >> l >> r;
 
            cout << dp[l][r] << '\n';
        }
    }
} // namespace Sub2
 
namespace Sub3
{
int prf[maxn];

void solve()
{
    stack <int> st;
    for (int i = 1; i <= n; i++)
    {
        while (st.size() && a[st.top()] < a[i])
        {
            if (i + (i - st.top() + 1) - 1 <= n)
                prf[i + i - st.top()] = max(prf[i + i - st.top()], a[i] + a[st.top()]);
            
            st.pop();
        }

        if (st.size())
            if (i + (i - st.top() + 1) - 1 <= n)
                prf[i + i - st.top()] = max(prf[i + i - st.top()], a[i] + a[st.top()]);
        st.push(i);
    }

    for (int i = 1; i <= n; i++)
    {
        prf[i] = max(prf[i - 1], prf[i]);
    }
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        ans = max(ans, prf[i] + a[i]);
    }

    cout << ans << '\n';
}
} // namespace Sub3

namespace Sub4
{
    struct node
    {
        int cur, mx, v;
    };

    node tree[maxn * 4];
    
    void build(int id, int l, int r)
    {
        if (l == r)
        {
            tree[id].cur = a[l];
            tree[id].v = a[l];
            return;
        }

        int mid = (l + r) / 2;

        build(id * 2, l, mid);
        build(id * 2 + 1, mid + 1, r);

        tree[id].v = max({tree[id * 2].v, tree[id * 2 + 1].v, tree[id * 2].mx + tree[id * 2 + 1].cur});
        tree[id].cur = max(tree[id * 2].cur, tree[id * 2 + 1].cur);
    }

    // void push(int id)
    // {
    //     int tmp = tree[id].mx ;

    //     tree[id * 2].mx = max(tmp, tree[id * 2].mx);
    //     tree[id * 2 + 1].mx = max(tmp, tree[id * 2 + 1].mx);
    //     tree[id * 2].v = max(tmp + tree[id * 2].cur, tree[id * 2].v);
    //     tree[id * 2 + 1].v = max(tmp + tree[id * 2 + 1].cur, tree[id * 2 + 1].v);
    // }

    node merge(node l, node r)
    {
        return {max(l.cur, r.cur), max(l.mx, r.mx), max({l.v, l.mx + r.cur, r.v})};
    }

    void update(int id, int l, int r, int u, int v, int vl)
    {
        if (r < u || v < l)
            return;
        if (l >= u && r <= v)
        {
            
            tree[id].mx = max(tree[id].mx, vl);
            tree[id].v = max(tree[id].cur + tree[id].mx, tree[id].v);
            return;
        }

        // push(id);
        int mid = (l + r) / 2;

        update(id * 2, l, mid, u, v, vl);
        update(id * 2 + 1, mid + 1, r, u, v, vl);

        tree[id] = merge(tree[id * 2], tree[id * 2 + 1]);
    }

    node get(int id, int l, int r, int u, int v)
    {
        if(r < u || v < l)
            return {0, 0, 0};
        if (l >= u && r <= v)
        {
            // cout << l << ' ' << r << ' ' << tree[id].v << '\n';
            return tree[id];
        }

        // push(id);
        int mid = (l + r) / 2;

        return merge(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
    }

    vector <pair <int, int>> Q[maxn];
    int ans[maxn];

    void solve()
    {
        for (int i = 1; i <= q; i++)
        {
            int l, r;
            cin >> l >> r;
            Q[l].push_back({r, i});
        }        

        build(1, 1, n);

        stack <int> st;
        for (int i = n; i >= 1; i--)
        {
            while (st.size() && a[st.top()] < a[i])
            {
                if (-i + 2 * st.top() <= n)
                    update(1, 1, n, -i + 2 * st.top(), -i + 2 * st.top(), a[i] + a[st.top()]);
                st.pop();
            }

            if (st.size())
                if (-i + 2 * st.top() <= n)
                    update(1, 1, n, -i + 2 * st.top(), -i + 2 * st.top(), a[i] + a[st.top()]);

            st.push(i);
            for (auto [r, id] : Q[i])
            {
                ans[id] = get(1, 1, n, i, r).v;
                // cout << " -> " <<  id << ' ' << ans[id] << '\n';
            }
        }

        // cout << tree[1].v << '\n';
        for (int i = 1; i <= q; i++)
            cout << ans[i] << "\n";
    }
} // namespace Sub4

 
signed main()
{
    // setIO();
    file;
    ios::sync_with_stdio(0); cin.tie(0);
 
    cin >> n;
    for (int i = 1; i <= n; i++)    
        cin >> a[i];
 
    cin >> q;
    if (n <= 100)
    {
        return Sub1::solve(), 0;
    }
    if (n <= 5000)
    {
        return Sub2::solve(), 0;
    }
    if (q == 1)
    {
        return Sub3::solve(), 0;
    }
    return Sub4::solve(), 0;
}

Compilation message

jumps.cpp: In function 'void setIn(std::string)':
jumps.cpp:9:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 | void setIn(string s) { freopen(s.c_str(),"r",stdin); }
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
jumps.cpp: In function 'void setOut(std::string)':
jumps.cpp:10:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void setOut(string s) { freopen(s.c_str(),"w",stdout); }
      |                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
jumps.cpp: In function 'int main()':
jumps.cpp:4:53: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    4 | #define file  if (fopen("input.txt", "r")) { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); }
      |                                              ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp:250:5: note: in expansion of macro 'file'
  250 |     file;
      |     ^~~~
jumps.cpp:4:87: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    4 | #define file  if (fopen("input.txt", "r")) { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); }
      |                                                                                ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp:250:5: note: in expansion of macro 'file'
  250 |     file;
      |     ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16728 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 7 ms 16732 KB Output is correct
5 Correct 5 ms 16732 KB Output is correct
6 Correct 5 ms 16832 KB Output is correct
7 Correct 5 ms 16732 KB Output is correct
8 Correct 5 ms 16732 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 4 ms 16728 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16728 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 7 ms 16732 KB Output is correct
5 Correct 5 ms 16732 KB Output is correct
6 Correct 5 ms 16832 KB Output is correct
7 Correct 5 ms 16732 KB Output is correct
8 Correct 5 ms 16732 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 4 ms 16728 KB Output is correct
11 Correct 456 ms 193424 KB Output is correct
12 Correct 403 ms 193056 KB Output is correct
13 Correct 415 ms 193108 KB Output is correct
14 Correct 396 ms 193244 KB Output is correct
15 Correct 407 ms 193316 KB Output is correct
16 Correct 399 ms 192596 KB Output is correct
17 Correct 413 ms 192688 KB Output is correct
18 Correct 384 ms 192628 KB Output is correct
19 Correct 400 ms 192976 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 19384 KB Output is correct
2 Correct 22 ms 19292 KB Output is correct
3 Correct 19 ms 20060 KB Output is correct
4 Correct 21 ms 19276 KB Output is correct
5 Correct 21 ms 19416 KB Output is correct
6 Correct 18 ms 18528 KB Output is correct
7 Correct 17 ms 18612 KB Output is correct
8 Correct 19 ms 18524 KB Output is correct
9 Correct 19 ms 18776 KB Output is correct

Subtask #4
54.0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16728 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 7 ms 16732 KB Output is correct
5 Correct 5 ms 16732 KB Output is correct
6 Correct 5 ms 16832 KB Output is correct
7 Correct 5 ms 16732 KB Output is correct
8 Correct 5 ms 16732 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 4 ms 16728 KB Output is correct
11 Correct 456 ms 193424 KB Output is correct
12 Correct 403 ms 193056 KB Output is correct
13 Correct 415 ms 193108 KB Output is correct
14 Correct 396 ms 193244 KB Output is correct
15 Correct 407 ms 193316 KB Output is correct
16 Correct 399 ms 192596 KB Output is correct
17 Correct 413 ms 192688 KB Output is correct
18 Correct 384 ms 192628 KB Output is correct
19 Correct 400 ms 192976 KB Output is correct
20 Correct 21 ms 19384 KB Output is correct
21 Correct 22 ms 19292 KB Output is correct
22 Correct 19 ms 20060 KB Output is correct
23 Correct 21 ms 19276 KB Output is correct
24 Correct 21 ms 19416 KB Output is correct
25 Correct 18 ms 18528 KB Output is correct
26 Correct 17 ms 18612 KB Output is correct
27 Correct 19 ms 18524 KB Output is correct
28 Correct 19 ms 18776 KB Output is correct
29 Correct 783 ms 56016 KB Output is correct
30 Correct 661 ms 57932 KB Output is correct
31 Correct 645 ms 56072 KB Output is correct
32 Correct 816 ms 55860 KB Output is correct
33 Correct 781 ms 56120 KB Output is correct
34 Correct 756 ms 53584 KB Output is correct
35 Correct 760 ms 53216 KB Output is correct
36 Correct 767 ms 53460 KB Output is correct
37 Correct 790 ms 54820 KB Output is correct
38 Correct 624 ms 61696 KB Output is correct
39 Correct 621 ms 61520 KB Output is correct
40 Correct 609 ms 58192 KB Output is correct
41 Correct 609 ms 57684 KB Output is correct
42 Correct 628 ms 57740 KB Output is correct
43 Correct 624 ms 59552 KB Output is correct
44 Correct 669 ms 60752 KB Output is correct
45 Correct 668 ms 61316 KB Output is correct
46 Correct 646 ms 57932 KB Output is correct
47 Correct 645 ms 57556 KB Output is correct
48 Correct 645 ms 57428 KB Output is correct
49 Correct 644 ms 59472 KB Output is correct
50 Correct 693 ms 59220 KB Output is correct
51 Correct 692 ms 59140 KB Output is correct
52 Correct 691 ms 56576 KB Output is correct
53 Correct 698 ms 56236 KB Output is correct
54 Correct 694 ms 56400 KB Output is correct
55 Correct 692 ms 58196 KB Output is correct