oj.uz

Submission #694075

# Submission time Handle Problem Language Result Execution time Memory
694075 2023-02-03T17:28:01 Z finn__ Uplifting Excursion (BOI22_vault) C++17
0 / 100
 0 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int64_t m, l;
    cin >> m >> l;

    vector<uint64_t> dp1(2 * m * m * m, 0), dp2(2 * m * m * m, 0);
    vector<int64_t> q;
    q.push_back(m * m * m);
    for (int64_t i = -m; i <= m; i++)
    {
        int64_t a;
        cin >> a;
        vector<int64_t> y;
        for (int64_t const &j : q)
        {
            for (int64_t k = 1; k <= a; k++)
            {
                if (dp2[j + k * i] < dp1[j] + k)
                {
                    dp2[j + k * i] = dp1[j] + k;
                    y.push_back(j + k * i);
                }
                y.push_back(j);
            }
        }
        swap(y, q);
        sort(q.begin(), q.end());
        q.resize(unique(q.begin(), q.end()) - q.begin());
        swap(dp1, dp2);

        for (unsigned const &j : q)
            dp2[j] = dp1[j];
    }

    if (m * m * m + l < dp1.size() && dp1[m * m * m + l])
        cout << dp1[m * m * m + l] << '\n';
    else
        cout << "impossible\n";
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long unsigned int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     if (m * m * m + l < dp1.size() && dp1[m * m * m + l])
      |         ~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 332 KB Output isn't correct
2 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 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 332 KB Output isn't correct
2 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 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 332 KB Output isn't correct
2 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 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -