oj.uz

Submission #720385

# Submission time Handle Problem Language Result Execution time Memory
720385 2023-04-08T06:12:31 Z baojiaopisu Packing Biscuits (IOI20_biscuits) C++14
21 / 100
 1000 ms 340 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

ll dp[105][105];

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

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

        int n = a.size();
        for(int i = 0; i <= n; i++) {
            for(int j = 0; j <= 1; j++) dp[i][j] = 0;
        }

        dp[n][0] = 1;
        for(int i = n; i >= 1; i--) {
            for(int j = 0; j <= 1; j++) {
                if(dp[i][j] == 0) continue;
                dp[i - 1][1] += dp[i][j] * a[i - 1];
                if(a[i - 1] == 0) dp[i - 1][0] += dp[i][j];
                if(a[i - 1] == 1) dp[i - 1][j] += dp[i][j];
                if(a[i - 1] >= 2 && !j) dp[i - 1][0] += dp[i][j];
            }
        }

        // for(int i = 0; i <= n; i++) {
        //     for(int j = 0; j <= n; j++) {
        //         if(dp[i][j] > 0) cout << i << " " << j << " " << dp[i][j] << '\n';
        //     }
        // }
        ll ans = 0;
        for(int i = 0; i <= n; i++) ans += dp[0][i];
        return ans;
    }

    ll ans = 1;
    for(int i = 1; i * x <= sum; i++) {
        vector<ll> b = a;
        bool ok = true;
        for(int j = 1; j <= x; j++) {
            int t = i;
            for(int k = b.size() - 1; k >= 0; k--) {
                int p = min(b[k], 1ll * t / (1 << k));
                b[k] -= p;
                t -= (1 << k) * p;
            }
            if(t != 0) ok = false;
        }
        if(ok)  ++ans;
    }

    return ans;
}

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:76:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for(int i = 0; i < a.size(); i++) {
      |                    ~~^~~~~~~~~~
biscuits.cpp:81:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for(int i = 0; i + 1 < a.size(); i++) {
      |                        ~~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 224 KB Output is correct
4 Correct 9 ms 316 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 42 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 37 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 73 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 213 ms 312 KB Output is correct
13 Correct 193 ms 300 KB Output is correct
14 Correct 206 ms 296 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 340 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 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 224 KB Output is correct
4 Correct 9 ms 316 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 42 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 37 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 73 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 213 ms 312 KB Output is correct
13 Correct 193 ms 300 KB Output is correct
14 Correct 206 ms 296 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Execution timed out 1080 ms 212 KB Time limit exceeded
25 Halted 0 ms 0 KB -