oj.uz

Submission #425666

# Submission time Handle Problem Language Result Execution time Memory
425666 2021-06-13T09:55:58 Z idk321 Packing Biscuits (IOI20_biscuits) C++17
42 / 100
 1000 ms 1371140 KB 
#include "biscuits.h"
#include <bits/stdc++.h>;
using namespace std;
typedef long long ll;


long long count_tastiness(long long x, std::vector<long long> a) {
    ll sum = 0;
    int k = 60;
    for (int i = 0; i < a.size(); i++)
    {
        sum += (1LL << i) * a[i];
    }




    if (sum <= 100000)
    {
        int res = 0;

        for (int i = 0; i <= sum; i++)
        {
            bool poss = true;
            vector<ll> cur(60);
            for (int j = 0; j < a.size(); j++) cur[j] = a[j];
            for (int j = 0; j < k; j++)
            {
                if ((1LL << j) & i)
                {
                    cur[j] -= x;

                    if (cur[j] < 0)
                    {
                        poss = false;
                        break;
                    }
                }


                if (j + 1 < k)
                {
                    cur[j + 1] += cur[j] / 2;
                }
            }


            if (poss) res++;
        }

        return res;
    }


    a.resize(k);
    for (int i = 0; i < k - 1; i++)
    {
        if (a[i] - (x + 2) >= 0)
        {
            ll diff = (a[i] - (x + 2));
            a[i + 1] += diff / 2;
            a[i] -= (diff / 2) * 2;
        }
    }

    vector<vector<ll>> dp(k + 1, vector<ll>(x * 10));
    dp[k][0] = 1;
    for (int i = k - 1;i >= 0; i--)
    {

        for (int j = 0; (j + a[i]) / 2 < x * 10 && j < x * 10; j++)
        {

            if (j + a[i] < x)
            {
                dp[i][j] = dp[i + 1][(j + a[i]) / 2];
            } else
            {
                dp[i][j] = dp[i + 1][(j + a[i]) / 2] + dp[i + 1][(j + a[i] - x) / 2];
            }
        }
    }



    return dp[0][0];
}

/*
1
15 1
1 2 0 2 1 0 0 2 2 1 1 2 0 0 1
*/

Compilation message

biscuits.cpp:2:25: warning: extra tokens at end of #include directive
    2 | #include <bits/stdc++.h>;
      |                         ^
biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:10:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i = 0; i < a.size(); i++)
      |                     ~~^~~~~~~~~~
biscuits.cpp:26:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |             for (int j = 0; j < a.size(); j++) cur[j] = a[j];
      |                             ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 204 KB Output is correct
2 Correct 87 ms 204 KB Output is correct
3 Correct 26 ms 292 KB Output is correct
4 Correct 83 ms 204 KB Output is correct
5 Correct 18 ms 204 KB Output is correct
6 Correct 230 ms 272 KB Output is correct
7 Correct 12 ms 288 KB Output is correct
8 Correct 225 ms 204 KB Output is correct
9 Correct 27 ms 204 KB Output is correct
10 Correct 68 ms 204 KB Output is correct
11 Correct 11 ms 204 KB Output is correct
12 Correct 178 ms 292 KB Output is correct
13 Correct 155 ms 272 KB Output is correct
14 Correct 128 ms 324 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 48964 KB Output is correct
2 Correct 168 ms 43368 KB Output is correct
3 Correct 150 ms 46836 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 418 ms 48972 KB Output is correct
9 Correct 397 ms 48972 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 5 ms 940 KB Output is correct
12 Correct 52 ms 6900 KB Output is correct
13 Correct 406 ms 48284 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 204 KB Output is correct
2 Correct 87 ms 204 KB Output is correct
3 Correct 26 ms 292 KB Output is correct
4 Correct 83 ms 204 KB Output is correct
5 Correct 18 ms 204 KB Output is correct
6 Correct 230 ms 272 KB Output is correct
7 Correct 12 ms 288 KB Output is correct
8 Correct 225 ms 204 KB Output is correct
9 Correct 27 ms 204 KB Output is correct
10 Correct 68 ms 204 KB Output is correct
11 Correct 11 ms 204 KB Output is correct
12 Correct 178 ms 292 KB Output is correct
13 Correct 155 ms 272 KB Output is correct
14 Correct 128 ms 324 KB Output is correct
15 Correct 39 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 229 ms 48964 KB Output is correct
25 Correct 168 ms 43368 KB Output is correct
26 Correct 150 ms 46836 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 418 ms 48972 KB Output is correct
32 Correct 397 ms 48972 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 5 ms 940 KB Output is correct
35 Correct 52 ms 6900 KB Output is correct
36 Correct 406 ms 48284 KB Output is correct
37 Execution timed out 1168 ms 1371140 KB Time limit exceeded
38 Halted 0 ms 0 KB -