제출 #1008683

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1008683		m5588ohammed	Bootfall (IZhO17_bootfall)	C++14	100 / 100	542 ms	4948 KiB

bootfall

/******************************************************************************
 
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.
 
*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define mod 10000000000037
const int S=500*500+1;
int sum[S+2],fre[S+2],t,New[S+1];
void inc(int x){
    for(int j=S;j>=x;j--){
        sum[j]+=sum[j-x];
        sum[j]%=mod;
    }
    return;
}
void dec(int x){
    for(int j=0;j<=S-x;j++){
        sum[j+x]-=sum[j];
        sum[j+x]+=mod;
        sum[j+x]%=mod;
    }
    return;
}
signed main()
{
    int n;
    cin>>n;
    int arr[n];
    sum[0]=1;
    for(int i=0;i<n;i++){
        cin>>arr[i];
        inc(arr[i]);
        t+=arr[i];
    }
    if(sum[t/2]==0){cout<<0<<endl;return 0;}
    for(int i=0;i<n;i++){
        dec(arr[i]);
        t-=arr[i];
        for(int j=0;j<=t-1;j++) {
            if((t-j)-j>0&&sum[j]>0&&sum[(t-j)]>0) fre[(t-j)-j]++;
        }
        t+=arr[i];
        inc(arr[i]);
    }
    int siz=0;
    for(int j=1;j<=S;j++){
        if(fre[j]==n) siz++;
    }
    cout<<siz<<endl;
    for(int j=1;j<=S;j++){
        if(fre[j]==n) cout<<j<<" ";
    }
    return 0;
}

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