oj.uz

Submission #721850

# Submission time Handle Problem Language Result Execution time Memory
721850 2023-04-11T07:52:47 Z kas_s Uplifting Excursion (BOI22_vault) C++17
0 / 100
 5000 ms 3148 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

int main () {
    ios::sync_with_stdio(0); cin.tie(0);
    int M, L;
    cin >> M >> L;
    map<int, int> sums;
    sums[0] = 0;
    vector<int> a;
    for (int i = -M, x; i <= M; i++) {
        cin >> x;
        for (int j = 0; j < x; j++) {
            a.push_back(i);
        }
    }
    int N = (int)a.size();
    for (int i = 0; i < N; i++) {
        map<int, int> curr;
        for (auto &[k, v]: sums) {
            curr[a[i] + k] = max(curr[a[i] + k], v + 1);
        }
        for (auto &[k, v]: curr) {
            sums[k] = max(sums[k], v);
        }
    }
    if (sums.count(L)) {
        cout << sums[L] << '\n';
    } else {
        cout << "impossible\n";
    }
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Execution timed out 5021 ms 3148 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Execution timed out 5021 ms 3148 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

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

Subtask #3-2
0 / 10.0

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

Subtask #4-1
0 / 10.0

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

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Execution timed out 5021 ms 3148 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

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

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Execution timed out 5021 ms 3148 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

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

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Execution timed out 5021 ms 3148 KB Time limit exceeded
7 Halted 0 ms 0 KB -