제출 #700113

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
700113		messiuuuuu	Bootfall (IZhO17_bootfall)	C++17	65 / 100	1045 ms	3208 KiB

bootfall

///
#include<bits/stdc++.h>
#define task "C"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 5e2 + 5;
const ll INF = 1e18 + 5;
const int MOD = 1e9 + 22071997;

int n;
int a[MAXN], sum = 0;

void Input()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        sum += a[i];
    }
}

int dp[MAXN * MAXN], chk[MAXN * MAXN];

void add(int& a, int b)
{
    a += b;
    if (a >= MOD)
        a -= MOD;
    if (a < 0)
        a += MOD;
}

void Solve()
{
    if (sum % 2)
    {
        cout << 0;
        return;
    }
    dp[0] = 1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = sum; j >= a[i]; j--)
        {
            add(dp[j], dp[j - a[i]]);
        }
    }
    if (!dp[sum / 2])
    {
        cout << 0;
        return;
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = a[i]; j <= sum; j++)
        {
            add(dp[j], -dp[j - a[i]]);
        }
        for (int j = 0; j <= (sum - a[i]) / 2; j++)
        {
            chk[sum - j - a[i] - j] += dp[j] > 0;
        }
        for (int j = sum; j >= a[i]; j--)
        {
            add(dp[j], dp[j - a[i]]);
        }
    }

    vector<int> res;
    for (int i = 0; i <= sum; i++)
        if (chk[i] == n)
            res.pb(i);

    cout << res.size() << '\n';
    for (int id : res)
        cout << id << ' ';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(task".INP","r"))
    {
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    Input();
    Solve();
}

컴파일 시 표준 에러 (stderr) 메시지

bootfall.cpp: In function 'int main()':
bootfall.cpp:91:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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