Submission #38465

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
38465	2018-01-04 09:08:07	MrPlany	Bootfall (IZhO17_bootfall)	C++14	100 / 100	639 ms	5804 KiB

bootfall

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
//Bismillahi-rahmani-rahim
#include <bits/stdc++.h>
using namespace std;
const int N = 250000;
int n;
int a[505], cnt[N+505];
int dp[N+505], d[N+505];
vector<int> ans;
int main() {
  //Lebap;
  cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    int sum = 0;
    for(int i=1;i<=n;i++) sum += a[i];
    dp[0] = 1;
    for(int i=1;i<=n;i++) {
        for(int j=N;j>=0;j--) dp[j+a[i]] += dp[j];
    }
    if(sum%2!=0 || dp[sum/2]==0) return cout << "0", 0;
    for(int i=1;i<=n;i++) {
        memset(d,0,sizeof(d));
        for(int j=0;j<=N;j++) {
            d[j] += dp[j];
            d[j+a[i]] -= d[j];
        }
        for(int j=0;j<=N;j++) {
            if((sum-a[i]+j)%2==0 && sum-a[i]-j>=0 && d[(sum-a[i]-j)/2]!=0) cnt[j]++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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