답안 #602246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602246 2022-07-22T18:53:02 Z PiejanVDC 비스킷 담기 (IOI20_biscuits) C++17
42 / 100
1000 ms 49828 KB
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

long long X;

vector<long long>v;

unordered_map<long long, long long>mp[61];

long long dp(int i, long long cnt) {
    if(i == 61)
        return 1;
    if(mp[i].count(cnt))
        return mp[i][cnt];
    long long ret = 0;
    if(cnt + v[i] >= X)
        ret = dp(i+1, (cnt + v[i] - X)/2);
    ret += dp(i+1, (cnt+v[i])/2);
    return mp[i][cnt] = ret;
}

long long count_tastiness(long long x, vector<long long>a) {
    X = x;
    v = a;
    for(int i = a.size() ; i < 61 ; i++)
        v.push_back(0);
    for(int i = 0 ; i < 61 ; i++)
        mp[i].clear();
    return dp(0, 0);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 13896 KB Output is correct
2 Correct 102 ms 7536 KB Output is correct
3 Correct 177 ms 11988 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 468 ms 14344 KB Output is correct
9 Correct 269 ms 10312 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 5 ms 596 KB Output is correct
12 Correct 46 ms 2772 KB Output is correct
13 Correct 474 ms 14380 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1101 ms 49828 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 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 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 66 ms 13896 KB Output is correct
25 Correct 102 ms 7536 KB Output is correct
26 Correct 177 ms 11988 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 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 468 ms 14344 KB Output is correct
32 Correct 269 ms 10312 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 5 ms 596 KB Output is correct
35 Correct 46 ms 2772 KB Output is correct
36 Correct 474 ms 14380 KB Output is correct
37 Execution timed out 1101 ms 49828 KB Time limit exceeded
38 Halted 0 ms 0 KB -