oj.uz

Submission #609397

# Submission time Handle Problem Language Result Execution time Memory
609397 2022-07-27T14:55:00 Z inventiontime Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 1000 ms 340 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

#define int ll
#define endl '\n' //comment for interactive

#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define re resize
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < n; i++)
#define loop1(i, n) for(int i = 1; i <= n; i++)
#define print(x) cout << #x << ": " << x << endl << flush

typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
typedef array<int, 3> ti;
typedef vector<ii> vii;
typedef vector<ti> vti;
typedef priority_queue<int> pq;

template<class T> bool ckmin(T&a, T b) { bool B = a > b; a = min(a, b); return B; }
template<class T> bool ckmax(T&a, T b) { bool B = a < b; a = max(a, b); return B; }

const int inf = 1e17;
//const int maxn = ;

ll count_tastiness(ll x, vector<ll> a) {

    int res = 1;
    int k = a.size();

    loop(_, 20-k) a.pb(0);

    int sum = 0;
    loop(i, k) 
        sum += a[i] * (1 << i);
    loop1(val, sum/x) {
        bitset<20> v(val);
        int tot = 0;
        bool possible = true;
        loop(i, 20) {
            tot += a[i] * (1 << i);
            tot -= x * v[i] * (1 << i);
            if(tot < 0) possible = false;
        }
        if(possible) res++;
    }

	return res;

}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 6 ms 296 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 17 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 15 ms 296 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 300 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 296 KB Output is correct
2 Execution timed out 1090 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 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 1093 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 6 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 6 ms 296 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 17 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 15 ms 296 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 300 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 6 ms 296 KB Output is correct
16 Execution timed out 1090 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -