oj.uz

답안 #724913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
724913 2023-04-16T08:54:05 Z MohamedAliSaidane 비스킷 담기 (IOI20_biscuits) C++14
42 / 100
 1000 ms 43432 KB 
#include<bits/stdc++.h>
#include "biscuits.h"
#include<ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef vector<pii> vpi;

#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()

const ll MOD = 1e9 + 7, INF = 1e18;
ll mod(ll x, ll m = MOD) {return (x + m) % m;}

int n;
ll x, tot = 0ll;
vll A;
bool check(ll s)
{
    vll B = A;
    for(int i =0; i < x; i++)
    {
        ll cur = s;
        for(int j = n - 1; j >= 0; j--)
        {
            ll q = min(B[j], cur/(1 << j));
            cur -= q * (1 << j);
            B[j] -= q;
        }
        if(cur > 0)
            return false;
    }
    return true;
}
ll sub1()
{
    int ans = 0;
    for(int i =0; i <= tot/x; i++)
    {
        if(i == 0 || check(i))
            ans++;
    }
    return ans;
}
unordered_map<ll,ll> dp[61];

ll f(int i, ll sum)
{
    if(i == 60)
        return 1ll;
    if(dp[i].find(sum) != dp[i].end())
        return dp[i][sum];
    if(sum >= x)
        return dp[i][sum] = f(i + 1, sum/2ll + A[i + 1]) + f(i + 1, (sum - x)/2ll + A[i + 1]);
    else
        return dp[i][sum] = f(i + 1, sum/2ll + A[i + 1]);
}
ll count_tastiness(ll X, vll a)
{
    x = X;
    A = a;
    n = (int)(a.size());
    while(n < 60)
    {
        A.pb(0ll);
        n++;
    }
    for(int i =0 ; i < n; i++)
        dp[i].clear();
    return f(0, a[0]);


}
/*
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cout << count_tastiness(1, {2, 1, 2});
}
*/

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 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 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 13968 KB Output is correct
2 Correct 122 ms 7560 KB Output is correct
3 Correct 162 ms 12056 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 430 ms 14476 KB Output is correct
9 Correct 249 ms 10360 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 71 ms 2828 KB Output is correct
13 Correct 425 ms 14280 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1069 ms 43432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 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 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 54 ms 13968 KB Output is correct
25 Correct 122 ms 7560 KB Output is correct
26 Correct 162 ms 12056 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 430 ms 14476 KB Output is correct
32 Correct 249 ms 10360 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 7 ms 596 KB Output is correct
35 Correct 71 ms 2828 KB Output is correct
36 Correct 425 ms 14280 KB Output is correct
37 Execution timed out 1069 ms 43432 KB Time limit exceeded
38 Halted 0 ms 0 KB -