oj.uz

Submission #505875

# Submission time Handle Problem Language Result Execution time Memory
505875 2022-01-11T09:14:48 Z vonatlus Bootfall (IZhO17_bootfall) C++17
0 / 100
 2 ms 404 KB 
/// adil sultanov | vonat1us 

#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")

#include<bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
 
using namespace std;

using ll = long long;
using pii = pair<int, int>;                                   

const int MOD = 1e9 + 7; 
const int INF = 1e9 + 1e2;
  
void fin() {
#ifdef AM
    freopen(".in", "r", stdin);
#endif        
}                   

const bool flag = 0;

const int N = 1e5+10;

void ma1n() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int& x : a) cin >> x;
    int sum = accumulate(all(a), 0);
    bitset<500*501> dp;
    dp.reset();
    vector<int> ans;
    dp.set(0, 1);
    for (int j = 0; j < n; ++j) {
        dp |= dp<<a[j];       
    }
    if (sum&1 || !dp[sum/2]) cout << 0, exit(0);
    dp.reset();
    dp.set(0, 1);
    for (int i = 1; i < n; ++i) {
        dp |= dp<<a[i];
    }
    for (int j = 0; j <= sum/2; ++j) {
        if (dp[j] && j*2 != sum-a[0]) {
            ans.pb(abs(j - (sum-a[0]-j)));
        }
    }
    sort(all(ans));
    ans.erase(unique(all(ans)), ans.end());
    for (int i = 1; i < n; ++i) {
        dp.reset();
        dp.set(0, 1);
        for (int j = 0; j < n; ++j) {
            if (i != j) {
                dp |= dp<<a[j];
            }
        }
        for (int j = 0; j < sz(ans); ++j) {
            int s1 = (sum-a[i]-ans[j])/2;
            int s2 = sum-a[i]-s1;
            if (s1+s2 != sum-a[i] || min(s1, s2) < 0 || s1+ans[j] != s2 || !dp[s1] || !dp[s2]) {
                swap(ans[j], ans.back());
                ans.pop_back();
                j--;
            }
        }
    }
    cout << sz(ans) << "\n";
    for (int x : ans) cout << x << " ";
} 

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr), fin();
    int ts = 1;
    if (flag) {
        cin >> ts;
    }
    while (ts--) {
        ma1n(); 
    }
    return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 2 ms 396 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 2 ms 396 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 2 ms 396 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 2 ms 396 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 2 ms 396 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 2 ms 396 KB Output isn't correct
6 Halted 0 ms 0 KB -