oj.uz

Submission #928972

# Submission time Handle Problem Language Result Execution time Memory
928972 2024-02-17T11:05:33 Z SUNWOOOOOOOO Packing Biscuits (IOI20_biscuits) C++17
42 / 100
 1000 ms 21036 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++){
        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 1 ms 436 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 500 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 432 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 440 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2088 KB Output is correct
2 Correct 20 ms 1804 KB Output is correct
3 Correct 31 ms 2008 KB Output is correct
4 Correct 1 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 1 ms 344 KB Output is correct
8 Correct 79 ms 2288 KB Output is correct
9 Correct 56 ms 1988 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 656 KB Output is correct
13 Correct 78 ms 2004 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 21036 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 1 ms 436 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 500 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 432 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 440 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 9 ms 2088 KB Output is correct
25 Correct 20 ms 1804 KB Output is correct
26 Correct 31 ms 2008 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 79 ms 2288 KB Output is correct
32 Correct 56 ms 1988 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 656 KB Output is correct
36 Correct 78 ms 2004 KB Output is correct
37 Execution timed out 1061 ms 21036 KB Time limit exceeded
38 Halted 0 ms 0 KB -