oj.uz

Submission #595048

# Submission time Handle Problem Language Result Execution time Memory
595048 2022-07-13T09:51:00 Z MadokaMagicaFan Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;

#define all(v)          v.begin(),v.end()
#define sort(v)         sort(all(v))
#define endl            '\n'
#define forn(i,n)       for(int i = 0; i < n; ++i)
#define forbe(i,b,e)    for(int i = b; i < e; ++i)
#define forr(i,n)       for(int i = n-1; i >= 0; --i)
#define sz(v)           ((int)v.size())
#define pb              push_back
#define f               first
#define s               second

ll count_tastiness(ll x, vector<ll> a){
    int k = sz(a);
    ll ans = 0;

    int mval = 100000;

    ll rem;

    int t;

    forbe(i,0, mval+4) {
        ++ans;

        rem = 0;
        t = 1;
        forn(j, 25) {
            rem = (rem/2l);
            if (j < k) rem += a[j];
//            cout << i << ' ' << j << ' ' << rem << endl;
            if ((i&(1<<j)) == 0) continue;
//            cout << i << endl;
            if (rem < x) {
                t = 0;
                --ans;
//                cout << i << endl;
                break;
            }
            rem -= x;
        }

//        if (t)
//            cout << i << endl;
    }

    return ans;
}

#ifdef ONPC
void solve() {
    int k, x;
    cin >> k >> x;

    vector<ll> a(k);

    forn(i,k)
        cin >> a[i];

    cout << count_tastiness(x,a) << endl;
}

int main() {
    freopen("in", "r", stdin);
//    ios_base::sync_with_stdio(0);cin.tie(0);
    solve();
}
#endif

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:28:9: warning: variable 't' set but not used [-Wunused-but-set-variable]
   28 |     int t;
      |         ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 212 KB Output is correct
2 Correct 5 ms 304 KB Output is correct
3 Correct 39 ms 212 KB Output is correct
4 Correct 61 ms 212 KB Output is correct
5 Correct 50 ms 212 KB Output is correct
6 Correct 63 ms 212 KB Output is correct
7 Correct 53 ms 280 KB Output is correct
8 Correct 65 ms 280 KB Output is correct
9 Correct 55 ms 280 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 10 ms 300 KB Output is correct
12 Correct 55 ms 296 KB Output is correct
13 Correct 48 ms 212 KB Output is correct
14 Correct 28 ms 212 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 212 KB Output is correct
2 Incorrect 42 ms 276 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 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 24 ms 212 KB Output is correct
2 Correct 5 ms 304 KB Output is correct
3 Correct 39 ms 212 KB Output is correct
4 Correct 61 ms 212 KB Output is correct
5 Correct 50 ms 212 KB Output is correct
6 Correct 63 ms 212 KB Output is correct
7 Correct 53 ms 280 KB Output is correct
8 Correct 65 ms 280 KB Output is correct
9 Correct 55 ms 280 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 10 ms 300 KB Output is correct
12 Correct 55 ms 296 KB Output is correct
13 Correct 48 ms 212 KB Output is correct
14 Correct 28 ms 212 KB Output is correct
15 Correct 23 ms 212 KB Output is correct
16 Incorrect 42 ms 276 KB Output isn't correct
17 Halted 0 ms 0 KB -