제출 #677753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
677753		Tigryonochekk	Bootfall (IZhO17_bootfall)	C++17	0 / 100	1 ms	212 KiB

bootfall

#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair

const int N = 502;

int n;
int a[N];
bool dp[N][N * N];

int main() {
    cin >> n;
    int sum = 0;
    bool isev = 0, isod = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum += a[i];
        if (a[i] % 2 == 0)
            isev = 1;
        else
            isod = 1;
    }
    if ((isev && isod) || (sum % 2 == 1)) {
        cout << 0 << endl;
        return 0;
    }

    dp[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < a[i]; j++) {
            dp[i][j] = dp[i - 1][j];
        }
        for (int j = a[i]; j <= sum; j++) {
            dp[i][j] = dp[i - 1][j] || dp[i - 1][j - a[i]];
        }
    }
    if (dp[n][sum / 2] == 0) {
        cout << 0 << endl;
        return 0;
    }

    return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 21
• Subtask 6: 0 / 35