oj.uz

Submission #928974

# Submission time Handle Problem Language Result Execution time Memory
928974 2024-02-17T11:09:48 Z SUNWOOOOOOOO Packing Biscuits (IOI20_biscuits) C++17
42 / 100
 1000 ms 21272 KB 
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using pLL = array <LL, 2>;

LL count_tastiness(LL x, vector<LL> A) {
    A.resize(61);
    LL ans = 0;
    vector <pLL> dp, ndp, ndp1, ndp2; // {j, dp[i][j]}
    dp.push_back({A[0], 1});
	for (LL i = 0; i < 60; i++){
        if (dp.size() > 200000) break;
        for (pLL elm : dp){
            LL j = elm[0], val = elm[1];
            if (j >= x) ndp1.push_back({A[i + 1] + (j - x) / 2, val});
            ndp2.push_back({A[i + 1] + j / 2, val});
        }
        dp.clear();
        merge(ndp1.begin(), ndp1.end(), ndp2.begin(), ndp2.end(), back_inserter(ndp));
        for (pLL elm : ndp){
            if (dp.empty() || dp.back()[0] != elm[0]) dp.push_back(elm);
            else dp.back()[1] += elm[1];
        }
        ndp.clear();
        ndp1.clear();
        ndp2.clear();
    }

    for (pLL elm : dp) ans += elm[1];
    return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2344 KB Output is correct
2 Correct 19 ms 1808 KB Output is correct
3 Correct 30 ms 2016 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 83 ms 1972 KB Output is correct
9 Correct 57 ms 2116 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 13 ms 756 KB Output is correct
13 Correct 77 ms 2012 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1028 ms 21272 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 11 ms 2344 KB Output is correct
25 Correct 19 ms 1808 KB Output is correct
26 Correct 30 ms 2016 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 83 ms 1972 KB Output is correct
32 Correct 57 ms 2116 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 13 ms 756 KB Output is correct
36 Correct 77 ms 2012 KB Output is correct
37 Execution timed out 1028 ms 21272 KB Time limit exceeded
38 Halted 0 ms 0 KB -