oj.uz

Submission #319180

# Submission time Handle Problem Language Result Execution time Memory
319180 2020-11-04T11:42:37 Z neki Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 1260 KB 
#include <bits/stdc++.h>
#include "biscuits.h"
#define loop(i, a, b) for(long long i=a;i<b;i++)
#define pool(i, a, b) for(long long i=a-1;i>=b;i--)
#define fore(i, a) for(auto&& i:a)
#define fi first
#define se second
#define ps(a) push_back(a)
#define pb(a) pop_back(a)
#define sc scanf
#define vc vector
#define pa pair<ll, ll>
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define llmax LLONG_MAX/2
#define llmin -LLONG_MAX/2
using namespace std;
#define mn 1010
#define pa pair<ll, ll>
#define ld long double
ll n, a[100];
ll solve(ll x, ll ind){
    if(ind==n-1) return a[ind]/x + 1;
    a[ind+1]+=a[ind]/2;
    ll ret=solve(x, ind+1);
    a[ind+1]-=a[ind]/2;
    if(a[ind]>=x){
        a[ind+1]+=(a[ind]-x)/2;
        ret+=solve(x, ind+1);
        a[ind+1]-=(a[ind]-x)/2;
    }
    return ret;
}
ll count_tastiness(ll x, vc<ll> ar){
    n=ar.size();
    loop(i, 0, n) a[i]=ar[i];
    return solve(x, 0);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 268 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 268 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 34 ms 364 KB Output is correct
13 Correct 16 ms 364 KB Output is correct
14 Correct 2 ms 492 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Execution timed out 1056 ms 364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 102 ms 364 KB Output is correct
5 Correct 80 ms 364 KB Output is correct
6 Execution timed out 1089 ms 364 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 612 KB Output is correct
2 Execution timed out 1054 ms 1260 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 268 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 268 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 34 ms 364 KB Output is correct
13 Correct 16 ms 364 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Execution timed out 1056 ms 364 KB Time limit exceeded
17 Halted 0 ms 0 KB -