oj.uz

답안 #720591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
720591 2023-04-08T15:04:34 Z bin9638 비스킷 담기 (IOI20_biscuits) C++17
42 / 100
 1000 ms 49920 KB 
#include <bits/stdc++.h>

#ifndef SKY
#include "biscuits.h"
#endif // SKY

using namespace std;

#define N 1010
#define ll long long
#define fs first
#define sc second
#define ii pair<int,int>
#define pb push_back

const int num_bit=60;

int n;
vector<ll>a;
unordered_map<ll,ll>mp[N];
ll m;

ll get(ll sl,int pos)
{
    if(pos==num_bit)
        return 1;
    if(mp[pos].find(sl)!=mp[pos].end())
        return mp[pos][sl];
    ll res=get((sl+a[pos])/2,pos+1);
    if(sl+a[pos]>=m)
        res+=get((sl+a[pos]-m)/2,pos+1);
    return(mp[pos][sl]=res);
}

ll count_tastiness(ll cc, vector<ll> vec)
{
    n=vec.size();
    a=vec;
    m=cc;
    while(n<60)
        a.pb(0),n++;
    for(int i=0;i<num_bit;i++)
        mp[i].clear();
    return get(0,0);
}

#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    ll x,k;
    cin>>x>>k;
    vector<ll>a(k);
    for(int i=0;i<k;i++)
    {
        cin>>a[i];
     //   a[i]=1ll*rand()*rand()%((ll)1e9/(i+1))+1;
    }
    cout<<count_tastiness(x,a);
    return 0;
}
#endif

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 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 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 14032 KB Output is correct
2 Correct 98 ms 7684 KB Output is correct
3 Correct 154 ms 12100 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 442 ms 14344 KB Output is correct
9 Correct 270 ms 10484 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 44 ms 2880 KB Output is correct
13 Correct 480 ms 14496 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 53 ms 14032 KB Output is correct
25 Correct 98 ms 7684 KB Output is correct
26 Correct 154 ms 12100 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 442 ms 14344 KB Output is correct
32 Correct 270 ms 10484 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 4 ms 596 KB Output is correct
35 Correct 44 ms 2880 KB Output is correct
36 Correct 480 ms 14496 KB Output is correct
37 Execution timed out 1080 ms 49920 KB Time limit exceeded
38 Halted 0 ms 0 KB -