oj.uz

답안 #707719

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707719 2023-03-09T19:49:54 Z Johann Uplifting Excursion (BOI22_vault) C++14
5 / 100
 5000 ms 12136 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()

const int MAXSIZE = 1000000;

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];

    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 (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

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 8148 KB Output is correct
2 Correct 21 ms 8148 KB Output is correct
3 Correct 10 ms 8088 KB Output is correct
4 Correct 69 ms 8148 KB Output is correct
5 Correct 576 ms 8148 KB Output is correct
6 Correct 599 ms 8168 KB Output is correct
7 Correct 557 ms 8152 KB Output is correct
8 Correct 599 ms 8148 KB Output is correct
9 Correct 850 ms 8292 KB Output is correct
10 Correct 485 ms 8148 KB Output is correct
11 Correct 491 ms 8148 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 8148 KB Output is correct
2 Correct 21 ms 8148 KB Output is correct
3 Correct 10 ms 8088 KB Output is correct
4 Correct 69 ms 8148 KB Output is correct
5 Correct 576 ms 8148 KB Output is correct
6 Correct 599 ms 8168 KB Output is correct
7 Correct 557 ms 8152 KB Output is correct
8 Correct 599 ms 8148 KB Output is correct
9 Correct 850 ms 8292 KB Output is correct
10 Correct 485 ms 8148 KB Output is correct
11 Correct 491 ms 8148 KB Output is correct
12 Correct 15 ms 8148 KB Output is correct
13 Correct 21 ms 8132 KB Output is correct
14 Correct 10 ms 8148 KB Output is correct
15 Correct 67 ms 8148 KB Output is correct
16 Correct 614 ms 8160 KB Output is correct
17 Correct 655 ms 8156 KB Output is correct
18 Correct 512 ms 8152 KB Output is correct
19 Correct 644 ms 8148 KB Output is correct
20 Correct 773 ms 8148 KB Output is correct
21 Correct 468 ms 8148 KB Output is correct
22 Correct 487 ms 8148 KB Output is correct
23 Correct 3215 ms 8332 KB Output is correct
24 Correct 3240 ms 8296 KB Output is correct
25 Correct 1560 ms 8284 KB Output is correct
26 Execution timed out 5068 ms 8928 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 8148 KB Output is correct
2 Incorrect 697 ms 12136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 8148 KB Output is correct
2 Incorrect 697 ms 12136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 8148 KB Output is correct
2 Incorrect 697 ms 12136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 8148 KB Output is correct
2 Correct 21 ms 8148 KB Output is correct
3 Correct 10 ms 8088 KB Output is correct
4 Correct 69 ms 8148 KB Output is correct
5 Correct 576 ms 8148 KB Output is correct
6 Correct 599 ms 8168 KB Output is correct
7 Correct 557 ms 8152 KB Output is correct
8 Correct 599 ms 8148 KB Output is correct
9 Correct 850 ms 8292 KB Output is correct
10 Correct 485 ms 8148 KB Output is correct
11 Correct 491 ms 8148 KB Output is correct
12 Correct 71 ms 8148 KB Output is correct
13 Incorrect 697 ms 12136 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 8148 KB Output is correct
2 Incorrect 697 ms 12136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 8148 KB Output is correct
2 Correct 21 ms 8148 KB Output is correct
3 Correct 10 ms 8088 KB Output is correct
4 Correct 69 ms 8148 KB Output is correct
5 Correct 576 ms 8148 KB Output is correct
6 Correct 599 ms 8168 KB Output is correct
7 Correct 557 ms 8152 KB Output is correct
8 Correct 599 ms 8148 KB Output is correct
9 Correct 850 ms 8292 KB Output is correct
10 Correct 485 ms 8148 KB Output is correct
11 Correct 491 ms 8148 KB Output is correct
12 Correct 15 ms 8148 KB Output is correct
13 Correct 21 ms 8132 KB Output is correct
14 Correct 10 ms 8148 KB Output is correct
15 Correct 67 ms 8148 KB Output is correct
16 Correct 614 ms 8160 KB Output is correct
17 Correct 655 ms 8156 KB Output is correct
18 Correct 512 ms 8152 KB Output is correct
19 Correct 644 ms 8148 KB Output is correct
20 Correct 773 ms 8148 KB Output is correct
21 Correct 468 ms 8148 KB Output is correct
22 Correct 487 ms 8148 KB Output is correct
23 Correct 3215 ms 8332 KB Output is correct
24 Correct 3240 ms 8296 KB Output is correct
25 Correct 1560 ms 8284 KB Output is correct
26 Execution timed out 5068 ms 8928 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 8148 KB Output is correct
2 Incorrect 697 ms 12136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 8148 KB Output is correct
2 Correct 21 ms 8148 KB Output is correct
3 Correct 10 ms 8088 KB Output is correct
4 Correct 69 ms 8148 KB Output is correct
5 Correct 576 ms 8148 KB Output is correct
6 Correct 599 ms 8168 KB Output is correct
7 Correct 557 ms 8152 KB Output is correct
8 Correct 599 ms 8148 KB Output is correct
9 Correct 850 ms 8292 KB Output is correct
10 Correct 485 ms 8148 KB Output is correct
11 Correct 491 ms 8148 KB Output is correct
12 Correct 15 ms 8148 KB Output is correct
13 Correct 21 ms 8132 KB Output is correct
14 Correct 10 ms 8148 KB Output is correct
15 Correct 67 ms 8148 KB Output is correct
16 Correct 614 ms 8160 KB Output is correct
17 Correct 655 ms 8156 KB Output is correct
18 Correct 512 ms 8152 KB Output is correct
19 Correct 644 ms 8148 KB Output is correct
20 Correct 773 ms 8148 KB Output is correct
21 Correct 468 ms 8148 KB Output is correct
22 Correct 487 ms 8148 KB Output is correct
23 Correct 3215 ms 8332 KB Output is correct
24 Correct 3240 ms 8296 KB Output is correct
25 Correct 1560 ms 8284 KB Output is correct
26 Execution timed out 5068 ms 8928 KB Time limit exceeded
27 Halted 0 ms 0 KB -