답안 #1104309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104309	2024-10-23T12:37:19 Z	Whisper	Bootfall (IZhO17_bootfall)	C++17	65 / 100	1000 ms	3592 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;
    while(x < 0) x += Mod;
}
int dp[MAX * MAX], A[MAX];
int total = 0;
void add(int x){
    for (int s = total / 2; s >= x; --s){
        add(dp[s], dp[s - x]);
    }
}
void sub(int x){
    for (int s = x; s <= total / 2; ++s){
        add(dp[s], -dp[s - x]);
    }
}
 
int cnt[MAX * MAX];
bool vis[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];
        vector<int> rback;
        for (int s = 0; s <= total / 2; ++s){
            if(dp[s] > 0){
                int dif = abs(sum - 2 * s);
                if(!vis[dif]){
                    vis[dif] = 1;
                    cnt[dif]++;
                    rback.emplace_back(dif);
                }
            }
        }
        for (int&v : rback) vis[v] = 0;
        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	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2524 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2524 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	1 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	1 ms	2384 KB	Output is correct
17	Correct	1 ms	2384 KB	Output is correct
18	Correct	1 ms	2384 KB	Output is correct
19	Correct	1 ms	2384 KB	Output is correct
20	Correct	1 ms	2384 KB	Output is correct
21	Correct	2 ms	2384 KB	Output is correct
22	Correct	2 ms	2384 KB	Output is correct
23	Correct	1 ms	2384 KB	Output is correct
24	Correct	4 ms	2384 KB	Output is correct
25	Correct	5 ms	2384 KB	Output is correct
26	Correct	5 ms	2384 KB	Output is correct
27	Correct	4 ms	2384 KB	Output is correct
28	Correct	3 ms	2556 KB	Output is correct
29	Correct	4 ms	2556 KB	Output is correct
30	Correct	5 ms	2384 KB	Output is correct
31	Correct	6 ms	2384 KB	Output is correct
32	Correct	5 ms	2384 KB	Output is correct
33	Correct	2 ms	2384 KB	Output is correct
34	Correct	2 ms	2384 KB	Output is correct
35	Correct	4 ms	2384 KB	Output is correct
36	Correct	4 ms	2384 KB	Output is correct
37	Correct	32 ms	2640 KB	Output is correct
38	Correct	33 ms	2640 KB	Output is correct
39	Correct	22 ms	2580 KB	Output is correct
40	Correct	70 ms	2512 KB	Output is correct
41	Correct	27 ms	2384 KB	Output is correct
42	Correct	61 ms	2640 KB	Output is correct
43	Correct	123 ms	2956 KB	Output is correct
44	Correct	125 ms	2816 KB	Output is correct
45	Correct	130 ms	2820 KB	Output is correct
46	Correct	41 ms	2384 KB	Output is correct
47	Correct	66 ms	2640 KB	Output is correct
48	Correct	117 ms	2900 KB	Output is correct
49	Correct	74 ms	2640 KB	Output is correct
50	Correct	68 ms	2640 KB	Output is correct
51	Correct	14 ms	2384 KB	Output is correct
52	Correct	163 ms	3004 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2524 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	1 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	1 ms	2384 KB	Output is correct
17	Correct	1 ms	2384 KB	Output is correct
18	Correct	1 ms	2384 KB	Output is correct
19	Correct	1 ms	2384 KB	Output is correct
20	Correct	1 ms	2384 KB	Output is correct
21	Correct	2 ms	2384 KB	Output is correct
22	Correct	2 ms	2384 KB	Output is correct
23	Correct	1 ms	2384 KB	Output is correct
24	Correct	4 ms	2384 KB	Output is correct
25	Correct	5 ms	2384 KB	Output is correct
26	Correct	5 ms	2384 KB	Output is correct
27	Correct	4 ms	2384 KB	Output is correct
28	Correct	3 ms	2556 KB	Output is correct
29	Correct	4 ms	2556 KB	Output is correct
30	Correct	5 ms	2384 KB	Output is correct
31	Correct	6 ms	2384 KB	Output is correct
32	Correct	5 ms	2384 KB	Output is correct
33	Correct	2 ms	2384 KB	Output is correct
34	Correct	2 ms	2384 KB	Output is correct
35	Correct	4 ms	2384 KB	Output is correct
36	Correct	4 ms	2384 KB	Output is correct
37	Correct	32 ms	2640 KB	Output is correct
38	Correct	33 ms	2640 KB	Output is correct
39	Correct	22 ms	2580 KB	Output is correct
40	Correct	70 ms	2512 KB	Output is correct
41	Correct	27 ms	2384 KB	Output is correct
42	Correct	61 ms	2640 KB	Output is correct
43	Correct	123 ms	2956 KB	Output is correct
44	Correct	125 ms	2816 KB	Output is correct
45	Correct	130 ms	2820 KB	Output is correct
46	Correct	41 ms	2384 KB	Output is correct
47	Correct	66 ms	2640 KB	Output is correct
48	Correct	117 ms	2900 KB	Output is correct
49	Correct	74 ms	2640 KB	Output is correct
50	Correct	68 ms	2640 KB	Output is correct
51	Correct	14 ms	2384 KB	Output is correct
52	Correct	163 ms	3004 KB	Output is correct
53	Correct	137 ms	2852 KB	Output is correct
54	Correct	198 ms	2976 KB	Output is correct
55	Correct	366 ms	3292 KB	Output is correct
56	Correct	179 ms	2812 KB	Output is correct
57	Correct	406 ms	3464 KB	Output is correct
58	Correct	207 ms	2872 KB	Output is correct
59	Correct	299 ms	3056 KB	Output is correct
60	Correct	37 ms	2384 KB	Output is correct
61	Correct	323 ms	3244 KB	Output is correct
62	Correct	314 ms	3148 KB	Output is correct
63	Correct	330 ms	3288 KB	Output is correct
64	Correct	333 ms	3160 KB	Output is correct
65	Correct	33 ms	2632 KB	Output is correct
66	Correct	46 ms	2632 KB	Output is correct

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2524 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	1 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	1 ms	2384 KB	Output is correct
17	Correct	1 ms	2384 KB	Output is correct
18	Correct	1 ms	2384 KB	Output is correct
19	Correct	1 ms	2384 KB	Output is correct
20	Correct	1 ms	2384 KB	Output is correct
21	Correct	2 ms	2384 KB	Output is correct
22	Correct	2 ms	2384 KB	Output is correct
23	Correct	1 ms	2384 KB	Output is correct
24	Correct	4 ms	2384 KB	Output is correct
25	Correct	5 ms	2384 KB	Output is correct
26	Correct	5 ms	2384 KB	Output is correct
27	Correct	4 ms	2384 KB	Output is correct
28	Correct	3 ms	2556 KB	Output is correct
29	Correct	4 ms	2556 KB	Output is correct
30	Correct	5 ms	2384 KB	Output is correct
31	Correct	6 ms	2384 KB	Output is correct
32	Correct	5 ms	2384 KB	Output is correct
33	Correct	2 ms	2384 KB	Output is correct
34	Correct	2 ms	2384 KB	Output is correct
35	Correct	4 ms	2384 KB	Output is correct
36	Correct	4 ms	2384 KB	Output is correct
37	Correct	32 ms	2640 KB	Output is correct
38	Correct	33 ms	2640 KB	Output is correct
39	Correct	22 ms	2580 KB	Output is correct
40	Correct	70 ms	2512 KB	Output is correct
41	Correct	27 ms	2384 KB	Output is correct
42	Correct	61 ms	2640 KB	Output is correct
43	Correct	123 ms	2956 KB	Output is correct
44	Correct	125 ms	2816 KB	Output is correct
45	Correct	130 ms	2820 KB	Output is correct
46	Correct	41 ms	2384 KB	Output is correct
47	Correct	66 ms	2640 KB	Output is correct
48	Correct	117 ms	2900 KB	Output is correct
49	Correct	74 ms	2640 KB	Output is correct
50	Correct	68 ms	2640 KB	Output is correct
51	Correct	14 ms	2384 KB	Output is correct
52	Correct	163 ms	3004 KB	Output is correct
53	Correct	137 ms	2852 KB	Output is correct
54	Correct	198 ms	2976 KB	Output is correct
55	Correct	366 ms	3292 KB	Output is correct
56	Correct	179 ms	2812 KB	Output is correct
57	Correct	406 ms	3464 KB	Output is correct
58	Correct	207 ms	2872 KB	Output is correct
59	Correct	299 ms	3056 KB	Output is correct
60	Correct	37 ms	2384 KB	Output is correct
61	Correct	323 ms	3244 KB	Output is correct
62	Correct	314 ms	3148 KB	Output is correct
63	Correct	330 ms	3288 KB	Output is correct
64	Correct	333 ms	3160 KB	Output is correct
65	Correct	33 ms	2632 KB	Output is correct
66	Correct	46 ms	2632 KB	Output is correct
67	Correct	343 ms	3368 KB	Output is correct
68	Correct	65 ms	2384 KB	Output is correct
69	Execution timed out	1070 ms	3592 KB	Time limit exceeded
70	Halted	0 ms	0 KB	-

답안 #1104309

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 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
0 / 35.0