Submission #1104315

# Submission time Handle Problem Language Result Execution time Memory
1104315 2024-10-23T12:41:44 Z vjudge1 Bootfall (IZhO17_bootfall) C++17
100 / 100
232 ms 3528 KB
#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);
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 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 2 ms 504 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 336 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 2 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 736 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 3 ms 336 KB Output is correct
34 Correct 3 ms 336 KB Output is correct
35 Correct 2 ms 336 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 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 2 ms 504 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 336 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 2 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 736 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 3 ms 336 KB Output is correct
34 Correct 3 ms 336 KB Output is correct
35 Correct 2 ms 336 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 8 ms 592 KB Output is correct
38 Correct 8 ms 764 KB Output is correct
39 Correct 28 ms 848 KB Output is correct
40 Correct 18 ms 848 KB Output is correct
41 Correct 52 ms 848 KB Output is correct
42 Correct 16 ms 760 KB Output is correct
43 Correct 33 ms 1096 KB Output is correct
44 Correct 27 ms 1104 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 868 KB Output is correct
48 Correct 30 ms 1108 KB Output is correct
49 Correct 29 ms 976 KB Output is correct
50 Correct 17 ms 848 KB Output is correct
51 Correct 4 ms 592 KB Output is correct
52 Correct 36 ms 1268 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 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 2 ms 504 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 336 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 2 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 736 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 3 ms 336 KB Output is correct
34 Correct 3 ms 336 KB Output is correct
35 Correct 2 ms 336 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 8 ms 592 KB Output is correct
38 Correct 8 ms 764 KB Output is correct
39 Correct 28 ms 848 KB Output is correct
40 Correct 18 ms 848 KB Output is correct
41 Correct 52 ms 848 KB Output is correct
42 Correct 16 ms 760 KB Output is correct
43 Correct 33 ms 1096 KB Output is correct
44 Correct 27 ms 1104 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 868 KB Output is correct
48 Correct 30 ms 1108 KB Output is correct
49 Correct 29 ms 976 KB Output is correct
50 Correct 17 ms 848 KB Output is correct
51 Correct 4 ms 592 KB Output is correct
52 Correct 36 ms 1268 KB Output is correct
53 Correct 27 ms 1104 KB Output is correct
54 Correct 41 ms 1184 KB Output is correct
55 Correct 77 ms 1728 KB Output is correct
56 Correct 33 ms 1164 KB Output is correct
57 Correct 79 ms 1996 KB Output is correct
58 Correct 42 ms 1356 KB Output is correct
59 Correct 52 ms 1484 KB Output is correct
60 Correct 11 ms 592 KB Output is correct
61 Correct 77 ms 1524 KB Output is correct
62 Correct 63 ms 1740 KB Output is correct
63 Correct 66 ms 1740 KB Output is correct
64 Correct 62 ms 1740 KB Output is correct
65 Correct 30 ms 1016 KB Output is correct
66 Correct 33 ms 880 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 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 2 ms 504 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 336 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 2 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 736 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 3 ms 336 KB Output is correct
34 Correct 3 ms 336 KB Output is correct
35 Correct 2 ms 336 KB Output is correct
36 Correct 2 ms 336 KB Output is correct
37 Correct 8 ms 592 KB Output is correct
38 Correct 8 ms 764 KB Output is correct
39 Correct 28 ms 848 KB Output is correct
40 Correct 18 ms 848 KB Output is correct
41 Correct 52 ms 848 KB Output is correct
42 Correct 16 ms 760 KB Output is correct
43 Correct 33 ms 1096 KB Output is correct
44 Correct 27 ms 1104 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 868 KB Output is correct
48 Correct 30 ms 1108 KB Output is correct
49 Correct 29 ms 976 KB Output is correct
50 Correct 17 ms 848 KB Output is correct
51 Correct 4 ms 592 KB Output is correct
52 Correct 36 ms 1268 KB Output is correct
53 Correct 27 ms 1104 KB Output is correct
54 Correct 41 ms 1184 KB Output is correct
55 Correct 77 ms 1728 KB Output is correct
56 Correct 33 ms 1164 KB Output is correct
57 Correct 79 ms 1996 KB Output is correct
58 Correct 42 ms 1356 KB Output is correct
59 Correct 52 ms 1484 KB Output is correct
60 Correct 11 ms 592 KB Output is correct
61 Correct 77 ms 1524 KB Output is correct
62 Correct 63 ms 1740 KB Output is correct
63 Correct 66 ms 1740 KB Output is correct
64 Correct 62 ms 1740 KB Output is correct
65 Correct 30 ms 1016 KB Output is correct
66 Correct 33 ms 880 KB Output is correct
67 Correct 68 ms 1504 KB Output is correct
68 Correct 31 ms 848 KB Output is correct
69 Correct 214 ms 3272 KB Output is correct
70 Correct 124 ms 2000 KB Output is correct
71 Correct 118 ms 1996 KB Output is correct
72 Correct 121 ms 1352 KB Output is correct
73 Correct 121 ms 1608 KB Output is correct
74 Correct 213 ms 3272 KB Output is correct
75 Correct 164 ms 2768 KB Output is correct
76 Correct 232 ms 3336 KB Output is correct
77 Correct 221 ms 3528 KB Output is correct