oj.uz

Submission #708029

# Submission time Handle Problem Language Result Execution time Memory
708029 2023-03-10T19:47:57 Z Johann Uplifting Excursion (BOI22_vault) C++14
5 / 100
 5000 ms 15940 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
typedef vector<ll> vi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

void resetPQ(priority_queue<pii, vpii> &q, int cut)
{
    priority_queue<pii, vpii> qq;
    while (!q.empty())
    {
        pii tmp = q.top();
        q.pop();
        if (tmp.second >= cut)
            qq.push(tmp);
    }
    swap(q, qq);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    ll M, L;
    cin >> M >> L;
    vi A(2 * M + 1);
    for (int i = 0; i < sz(A); ++i)
        cin >> A[i];

    int an = accumulate(A.begin(), A.begin() + M, 0);
    int ap = accumulate(A.begin() + M + 1, A.begin() + 2 * M + 1, 0);

    int MAXSIZE = 2 * M * max(an, ap);

    vi dp(MAXSIZE, -1);
    ll center = MAXSIZE / 2;
    dp[center] = A[M];
    for (int foo = 0; foo < 2; ++foo)
    {
        reverse(all(A)), reverse(all(dp));
        for (ll m = 1; m <= M; ++m)
        {
            ll maxNum = A[m + M];
            for (ll r = 0; r < m; ++r)
            {
                priority_queue<pii, vpii> q;
                for (int i = 0; m * i + r < sz(dp); ++i)
                {
                    int idx = m * i + r;
                    while (!q.empty() && q.top().second < idx - maxNum * m)
                        q.pop();
                    // if (sz(q) > 2 * m)
                    //    resetPQ(q, idx - maxNum * m);
                    if (dp[idx] != -1)
                        q.push({dp[idx] - i, idx});
                    if (!q.empty())
                        dp[idx] = i + q.top().first;
                }
            }
        }
    }

    ll ans = -1;
    if (0 <= center + L && center + L < sz(dp))
        ans = dp[center + L];
    if (ans == -1)
        cout << "impossible\n";
    else
        cout << ans << "\n";

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 159 ms 1376 KB Output is correct
6 Correct 164 ms 1416 KB Output is correct
7 Correct 53 ms 840 KB Output is correct
8 Correct 152 ms 1332 KB Output is correct
9 Correct 339 ms 2208 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 159 ms 1376 KB Output is correct
6 Correct 164 ms 1416 KB Output is correct
7 Correct 53 ms 840 KB Output is correct
8 Correct 152 ms 1332 KB Output is correct
9 Correct 339 ms 2208 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 155 ms 1384 KB Output is correct
17 Correct 163 ms 1364 KB Output is correct
18 Correct 49 ms 844 KB Output is correct
19 Correct 151 ms 1336 KB Output is correct
20 Correct 370 ms 2132 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 3454 ms 8904 KB Output is correct
24 Correct 3290 ms 8376 KB Output is correct
25 Correct 629 ms 3260 KB Output is correct
26 Execution timed out 5026 ms 15940 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 159 ms 1376 KB Output is correct
6 Correct 164 ms 1416 KB Output is correct
7 Correct 53 ms 840 KB Output is correct
8 Correct 152 ms 1332 KB Output is correct
9 Correct 339 ms 2208 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Runtime error 1 ms 468 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 159 ms 1376 KB Output is correct
6 Correct 164 ms 1416 KB Output is correct
7 Correct 53 ms 840 KB Output is correct
8 Correct 152 ms 1332 KB Output is correct
9 Correct 339 ms 2208 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 155 ms 1384 KB Output is correct
17 Correct 163 ms 1364 KB Output is correct
18 Correct 49 ms 844 KB Output is correct
19 Correct 151 ms 1336 KB Output is correct
20 Correct 370 ms 2132 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 3454 ms 8904 KB Output is correct
24 Correct 3290 ms 8376 KB Output is correct
25 Correct 629 ms 3260 KB Output is correct
26 Execution timed out 5026 ms 15940 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 159 ms 1376 KB Output is correct
6 Correct 164 ms 1416 KB Output is correct
7 Correct 53 ms 840 KB Output is correct
8 Correct 152 ms 1332 KB Output is correct
9 Correct 339 ms 2208 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 155 ms 1384 KB Output is correct
17 Correct 163 ms 1364 KB Output is correct
18 Correct 49 ms 844 KB Output is correct
19 Correct 151 ms 1336 KB Output is correct
20 Correct 370 ms 2132 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 3454 ms 8904 KB Output is correct
24 Correct 3290 ms 8376 KB Output is correct
25 Correct 629 ms 3260 KB Output is correct
26 Execution timed out 5026 ms 15940 KB Time limit exceeded
27 Halted 0 ms 0 KB -