답안 #1104312

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104312	2024-10-23T12:39:52 Z	Whisper	Bootfall (IZhO17_bootfall)	C++17	100 / 100	241 ms	3528 KB

bootfall

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;

//#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                     505
int nArr, sum = 0;

void add(int &x, int y){
    x += y;
    if(x >= Mod) x -= Mod;
    if(x < 0) x += Mod;
}
int dp[MAX * MAX], A[MAX];
int total = 0;
void add(int x){
    for (int s = total; s >= x; --s){
        add(dp[s], dp[s - x]);
    }
}
void sub(int x){
    for (int s = x; s <= total; ++s){
        add(dp[s], -dp[s - x]);
    }
}

int cnt[MAX * MAX];
void process(void){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) cin >> A[i], sum += A[i];
    total = sum;
    dp[0] = 1;
    for (int i = 1; i <= nArr; ++i) add(A[i]);

    if(sum % 2 != 0 or dp[sum / 2] == 0) return void(cout << 0);

    for (int i = 1; i <= nArr; ++i){
        sub(A[i]);
        sum -= A[i];
        for (int s = 0; s <= sum / 2; ++s){
            if(dp[s] > 0){
                int dif = abs(sum - 2 * s);
                cnt[dif]++;
            }
        }
        add(A[i]);
        sum += A[i];
    }
    vector<int> ans;
    for (int s = 1; s < total; ++s){
        if(cnt[s] == nArr){
            ans.emplace_back(s);
        }
    }
    cout << (int)ans.size() << '\n';
    for(int&v : ans) cout << v << " ";
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	2 ms	508 KB	Output is correct
25	Correct	3 ms	336 KB	Output is correct
26	Correct	3 ms	592 KB	Output is correct
27	Correct	2 ms	336 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	3 ms	336 KB	Output is correct
30	Correct	2 ms	336 KB	Output is correct
31	Correct	2 ms	336 KB	Output is correct
32	Correct	2 ms	336 KB	Output is correct
33	Correct	2 ms	336 KB	Output is correct
34	Correct	3 ms	336 KB	Output is correct
35	Correct	3 ms	388 KB	Output is correct
36	Correct	2 ms	336 KB	Output is correct

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	2 ms	508 KB	Output is correct
25	Correct	3 ms	336 KB	Output is correct
26	Correct	3 ms	592 KB	Output is correct
27	Correct	2 ms	336 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	3 ms	336 KB	Output is correct
30	Correct	2 ms	336 KB	Output is correct
31	Correct	2 ms	336 KB	Output is correct
32	Correct	2 ms	336 KB	Output is correct
33	Correct	2 ms	336 KB	Output is correct
34	Correct	3 ms	336 KB	Output is correct
35	Correct	3 ms	388 KB	Output is correct
36	Correct	2 ms	336 KB	Output is correct
37	Correct	10 ms	592 KB	Output is correct
38	Correct	8 ms	592 KB	Output is correct
39	Correct	29 ms	848 KB	Output is correct
40	Correct	18 ms	848 KB	Output is correct
41	Correct	36 ms	848 KB	Output is correct
42	Correct	16 ms	848 KB	Output is correct
43	Correct	27 ms	1120 KB	Output is correct
44	Correct	28 ms	1160 KB	Output is correct
45	Correct	28 ms	1104 KB	Output is correct
46	Correct	16 ms	592 KB	Output is correct
47	Correct	17 ms	856 KB	Output is correct
48	Correct	30 ms	1104 KB	Output is correct
49	Correct	32 ms	848 KB	Output is correct
50	Correct	17 ms	848 KB	Output is correct
51	Correct	4 ms	592 KB	Output is correct
52	Correct	39 ms	1352 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	2 ms	508 KB	Output is correct
25	Correct	3 ms	336 KB	Output is correct
26	Correct	3 ms	592 KB	Output is correct
27	Correct	2 ms	336 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	3 ms	336 KB	Output is correct
30	Correct	2 ms	336 KB	Output is correct
31	Correct	2 ms	336 KB	Output is correct
32	Correct	2 ms	336 KB	Output is correct
33	Correct	2 ms	336 KB	Output is correct
34	Correct	3 ms	336 KB	Output is correct
35	Correct	3 ms	388 KB	Output is correct
36	Correct	2 ms	336 KB	Output is correct
37	Correct	10 ms	592 KB	Output is correct
38	Correct	8 ms	592 KB	Output is correct
39	Correct	29 ms	848 KB	Output is correct
40	Correct	18 ms	848 KB	Output is correct
41	Correct	36 ms	848 KB	Output is correct
42	Correct	16 ms	848 KB	Output is correct
43	Correct	27 ms	1120 KB	Output is correct
44	Correct	28 ms	1160 KB	Output is correct
45	Correct	28 ms	1104 KB	Output is correct
46	Correct	16 ms	592 KB	Output is correct
47	Correct	17 ms	856 KB	Output is correct
48	Correct	30 ms	1104 KB	Output is correct
49	Correct	32 ms	848 KB	Output is correct
50	Correct	17 ms	848 KB	Output is correct
51	Correct	4 ms	592 KB	Output is correct
52	Correct	39 ms	1352 KB	Output is correct
53	Correct	27 ms	1128 KB	Output is correct
54	Correct	38 ms	1096 KB	Output is correct
55	Correct	75 ms	1728 KB	Output is correct
56	Correct	33 ms	1160 KB	Output is correct
57	Correct	77 ms	2000 KB	Output is correct
58	Correct	42 ms	1360 KB	Output is correct
59	Correct	51 ms	1484 KB	Output is correct
60	Correct	11 ms	592 KB	Output is correct
61	Correct	58 ms	1520 KB	Output is correct
62	Correct	73 ms	1740 KB	Output is correct
63	Correct	66 ms	1740 KB	Output is correct
64	Correct	65 ms	1740 KB	Output is correct
65	Correct	29 ms	1016 KB	Output is correct
66	Correct	32 ms	1016 KB	Output is correct

Subtask #6
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	2 ms	508 KB	Output is correct
25	Correct	3 ms	336 KB	Output is correct
26	Correct	3 ms	592 KB	Output is correct
27	Correct	2 ms	336 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	3 ms	336 KB	Output is correct
30	Correct	2 ms	336 KB	Output is correct
31	Correct	2 ms	336 KB	Output is correct
32	Correct	2 ms	336 KB	Output is correct
33	Correct	2 ms	336 KB	Output is correct
34	Correct	3 ms	336 KB	Output is correct
35	Correct	3 ms	388 KB	Output is correct
36	Correct	2 ms	336 KB	Output is correct
37	Correct	10 ms	592 KB	Output is correct
38	Correct	8 ms	592 KB	Output is correct
39	Correct	29 ms	848 KB	Output is correct
40	Correct	18 ms	848 KB	Output is correct
41	Correct	36 ms	848 KB	Output is correct
42	Correct	16 ms	848 KB	Output is correct
43	Correct	27 ms	1120 KB	Output is correct
44	Correct	28 ms	1160 KB	Output is correct
45	Correct	28 ms	1104 KB	Output is correct
46	Correct	16 ms	592 KB	Output is correct
47	Correct	17 ms	856 KB	Output is correct
48	Correct	30 ms	1104 KB	Output is correct
49	Correct	32 ms	848 KB	Output is correct
50	Correct	17 ms	848 KB	Output is correct
51	Correct	4 ms	592 KB	Output is correct
52	Correct	39 ms	1352 KB	Output is correct
53	Correct	27 ms	1128 KB	Output is correct
54	Correct	38 ms	1096 KB	Output is correct
55	Correct	75 ms	1728 KB	Output is correct
56	Correct	33 ms	1160 KB	Output is correct
57	Correct	77 ms	2000 KB	Output is correct
58	Correct	42 ms	1360 KB	Output is correct
59	Correct	51 ms	1484 KB	Output is correct
60	Correct	11 ms	592 KB	Output is correct
61	Correct	58 ms	1520 KB	Output is correct
62	Correct	73 ms	1740 KB	Output is correct
63	Correct	66 ms	1740 KB	Output is correct
64	Correct	65 ms	1740 KB	Output is correct
65	Correct	29 ms	1016 KB	Output is correct
66	Correct	32 ms	1016 KB	Output is correct
67	Correct	71 ms	1492 KB	Output is correct
68	Correct	32 ms	848 KB	Output is correct
69	Correct	208 ms	3272 KB	Output is correct
70	Correct	124 ms	2252 KB	Output is correct
71	Correct	123 ms	1996 KB	Output is correct
72	Correct	118 ms	1224 KB	Output is correct
73	Correct	127 ms	1356 KB	Output is correct
74	Correct	214 ms	3272 KB	Output is correct
75	Correct	165 ms	2760 KB	Output is correct
76	Correct	241 ms	3528 KB	Output is correct
77	Correct	235 ms	3528 KB	Output is correct

답안 #1104312

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 15.0 / 15.0

Subtask #4 16.0 / 16.0

Subtask #5 21.0 / 21.0

Subtask #6 35.0 / 35.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
15.0 / 15.0

Subtask #4
16.0 / 16.0

Subtask #5
21.0 / 21.0

Subtask #6
35.0 / 35.0