답안 #303779

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303779	2020-09-20T15:59:51 Z	alex_velea	비스킷 담기 (IOI20_biscuits)	C++17	42 / 100	1000 ms	16356 KB

biscuits

#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
const int kMaxK = 127;

typedef long long int64;

#define DEBUG if(0)

long long count_tastiness(int64 x, std::vector<int64> a) {
    a.resize(kMaxK, 0);
    for (int i = 0; i + 1 < kMaxK; i += 1) {
        if (a[i] > x) {
            int64 carry = (a[i] - x) / 2;
            a[i + 1] += carry;
            a[i] -= carry * 2;
        }
    }

    DEBUG {
        for (int i = 0; i < 10; i += 1) {
            cerr << a[i] << '\t';
        }
        cerr << '\n';
    }

    unordered_map<int64, int64> old = { {0, 1} };

    int64 ans = 1;

    for (int i = 0; i < kMaxK; i += 1) {
        unordered_map<int64, int64> new_dp;
        for (auto& itr : old) {
            int64 carry = itr.first;
            int64 num = itr.second;

            if (carry + a[i] >= x) {
                DEBUG cerr << "Add + for " << i << '\n';
                ans += num;
                new_dp[(carry + a[i] - x) / 2] += num;
            }

            new_dp[(carry + a[i]) / 2] += num;
        }
        old = new_dp;
    }

	return ans;
}

Subtask #1

9.0 / 9.0

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

Subtask #2

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct

Subtask #3

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	59 ms	1168 KB	Output is correct
2	Correct	126 ms	1068 KB	Output is correct
3	Correct	197 ms	1164 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	507 ms	1316 KB	Output is correct
9	Correct	352 ms	1316 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	9 ms	384 KB	Output is correct
12	Correct	77 ms	384 KB	Output is correct
13	Correct	530 ms	1456 KB	Output is correct

Subtask #4

0 / 35.0

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

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	59 ms	1168 KB	Output is correct
25	Correct	126 ms	1068 KB	Output is correct
26	Correct	197 ms	1164 KB	Output is correct
27	Correct	1 ms	256 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	507 ms	1316 KB	Output is correct
32	Correct	352 ms	1316 KB	Output is correct
33	Correct	2 ms	256 KB	Output is correct
34	Correct	9 ms	384 KB	Output is correct
35	Correct	77 ms	384 KB	Output is correct
36	Correct	530 ms	1456 KB	Output is correct
37	Execution timed out	1051 ms	16356 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-