oj.uz

Submission #1104300

# Submission time Handle Problem Language Result Execution time Memory
1104300 2024-10-23T12:23:54 Z Whisper Bootfall (IZhO17_bootfall) C++17
13 / 100
 2 ms 2652 KB 
#include <bits/stdc++.h>

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
#define off_set                 25000
int nArr, sum = 0;

int dp[MAX * MAX], A[MAX];
int total = 0;
void add(int x){
    for (int s = total; s >= x; --s){
        dp[s] += dp[s - x];
    }
}
void sub(int x){
    for (int s = x; s <= total; ++s){
        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(dp[sum / 2] == 0) return void(cout << 0);

    for (int i = 1; i <= nArr; ++i){
        sub(A[i]);
        sum -= A[i];
        memset(vis, 0, sizeof vis);
        for (int s = 1; s < total; ++s){
            if(dp[s] > 0){
                int dif = abs(sum - 2 * s);
                if(!vis[dif]){
                    vis[dif] = 1;
                    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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 1 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct
14 Correct 1 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 1 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 1 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct
14 Correct 1 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 1 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 2 ms 2640 KB Output is correct
22 Incorrect 2 ms 2640 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 1 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct
14 Correct 1 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 1 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 2 ms 2640 KB Output is correct
22 Incorrect 2 ms 2640 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 1 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct
14 Correct 1 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 1 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 2 ms 2640 KB Output is correct
22 Incorrect 2 ms 2640 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 1 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 2640 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 1 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct
14 Correct 1 ms 2640 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2640 KB Output is correct
18 Correct 1 ms 2640 KB Output is correct
19 Correct 1 ms 2640 KB Output is correct
20 Correct 1 ms 2640 KB Output is correct
21 Correct 2 ms 2640 KB Output is correct
22 Incorrect 2 ms 2640 KB Output isn't correct
23 Halted 0 ms 0 KB -