Submission #38454

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
38454	2018-01-04T08:34:29 Z	MrPlany	Bootfall (IZhO17_bootfall)	C++14	13 / 100	89 ms	5112 KB

bootfall

//Bismillahi-rahmani-rahim

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;

typedef long long  ll;
typedef map <int, int> mii;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
const int inf=1e9;

#define azdar priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
#define Lebap ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mp make_pair
#define pb push_back
#define pf push_front
#define pk pop_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
//#include <conio.h>
#include <climits>
const int N = 250000;

int n, a[509], dp[N+509], dp1[N+509], cnt[N+509];


int main(){
	Lebap;
	
	cin>>n;
	int sum=0;

	for(int i=1;i<=n;i++) cin>>a[i];
	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( dp1, 0, sizeof(dp1) );
	
		for(int j=0;j<=N;j++){
			dp1[j]+=dp[j];
			dp1[j+a[i]]-=dp1[j];
		}
	
		for(int j=0;j<=N;j++){
			if(sum-a[i]-j>=0 && (sum-a[i]+j)%2==0 && dp1[(sum-a[i]-j)/2]!=0) cnt[j]++;
		}
	
	}
	
	vector <int> ans;
	ans.clear();
	for(int i=1;i<=N;i++) if( cnt[i] == n ) ans.pb(i);
	cout << ans.size() << endl;
	for(int i=0;i<ans.size();i++) cout << ans[i] << " ";
}

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:65:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<ans.size();i++) cout << ans[i] << " ";
               ^

Subtask #1
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	5112 KB	Output is correct
2	Correct	6 ms	5112 KB	Output is correct
3	Correct	0 ms	5112 KB	Output is correct
4	Correct	6 ms	5112 KB	Output is correct
5	Correct	19 ms	5112 KB	Output is correct
6	Correct	6 ms	5112 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	13 ms	5112 KB	Output is correct
9	Correct	6 ms	5112 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	5112 KB	Output is correct
2	Correct	6 ms	5112 KB	Output is correct
3	Correct	0 ms	5112 KB	Output is correct
4	Correct	6 ms	5112 KB	Output is correct
5	Correct	19 ms	5112 KB	Output is correct
6	Correct	6 ms	5112 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	13 ms	5112 KB	Output is correct
9	Correct	6 ms	5112 KB	Output is correct
10	Correct	26 ms	5112 KB	Output is correct
11	Correct	33 ms	5112 KB	Output is correct
12	Correct	29 ms	5112 KB	Output is correct
13	Correct	23 ms	5112 KB	Output is correct
14	Correct	36 ms	5112 KB	Output is correct
15	Correct	29 ms	5112 KB	Output is correct
16	Correct	29 ms	5112 KB	Output is correct
17	Correct	19 ms	5112 KB	Output is correct
18	Correct	29 ms	5112 KB	Output is correct
19	Correct	26 ms	5112 KB	Output is correct
20	Correct	29 ms	5112 KB	Output is correct

Subtask #3
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	5112 KB	Output is correct
2	Correct	6 ms	5112 KB	Output is correct
3	Correct	0 ms	5112 KB	Output is correct
4	Correct	6 ms	5112 KB	Output is correct
5	Correct	19 ms	5112 KB	Output is correct
6	Correct	6 ms	5112 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	13 ms	5112 KB	Output is correct
9	Correct	6 ms	5112 KB	Output is correct
10	Correct	26 ms	5112 KB	Output is correct
11	Correct	33 ms	5112 KB	Output is correct
12	Correct	29 ms	5112 KB	Output is correct
13	Correct	23 ms	5112 KB	Output is correct
14	Correct	36 ms	5112 KB	Output is correct
15	Correct	29 ms	5112 KB	Output is correct
16	Correct	29 ms	5112 KB	Output is correct
17	Correct	19 ms	5112 KB	Output is correct
18	Correct	29 ms	5112 KB	Output is correct
19	Correct	26 ms	5112 KB	Output is correct
20	Correct	29 ms	5112 KB	Output is correct
21	Correct	56 ms	5112 KB	Output is correct
22	Correct	66 ms	5112 KB	Output is correct
23	Correct	46 ms	5112 KB	Output is correct
24	Runtime error	89 ms	5112 KB	Execution killed because of forbidden syscall writev (20)
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	5112 KB	Output is correct
2	Correct	6 ms	5112 KB	Output is correct
3	Correct	0 ms	5112 KB	Output is correct
4	Correct	6 ms	5112 KB	Output is correct
5	Correct	19 ms	5112 KB	Output is correct
6	Correct	6 ms	5112 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	13 ms	5112 KB	Output is correct
9	Correct	6 ms	5112 KB	Output is correct
10	Correct	26 ms	5112 KB	Output is correct
11	Correct	33 ms	5112 KB	Output is correct
12	Correct	29 ms	5112 KB	Output is correct
13	Correct	23 ms	5112 KB	Output is correct
14	Correct	36 ms	5112 KB	Output is correct
15	Correct	29 ms	5112 KB	Output is correct
16	Correct	29 ms	5112 KB	Output is correct
17	Correct	19 ms	5112 KB	Output is correct
18	Correct	29 ms	5112 KB	Output is correct
19	Correct	26 ms	5112 KB	Output is correct
20	Correct	29 ms	5112 KB	Output is correct
21	Correct	56 ms	5112 KB	Output is correct
22	Correct	66 ms	5112 KB	Output is correct
23	Correct	46 ms	5112 KB	Output is correct
24	Runtime error	89 ms	5112 KB	Execution killed because of forbidden syscall writev (20)
25	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	5112 KB	Output is correct
2	Correct	6 ms	5112 KB	Output is correct
3	Correct	0 ms	5112 KB	Output is correct
4	Correct	6 ms	5112 KB	Output is correct
5	Correct	19 ms	5112 KB	Output is correct
6	Correct	6 ms	5112 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	13 ms	5112 KB	Output is correct
9	Correct	6 ms	5112 KB	Output is correct
10	Correct	26 ms	5112 KB	Output is correct
11	Correct	33 ms	5112 KB	Output is correct
12	Correct	29 ms	5112 KB	Output is correct
13	Correct	23 ms	5112 KB	Output is correct
14	Correct	36 ms	5112 KB	Output is correct
15	Correct	29 ms	5112 KB	Output is correct
16	Correct	29 ms	5112 KB	Output is correct
17	Correct	19 ms	5112 KB	Output is correct
18	Correct	29 ms	5112 KB	Output is correct
19	Correct	26 ms	5112 KB	Output is correct
20	Correct	29 ms	5112 KB	Output is correct
21	Correct	56 ms	5112 KB	Output is correct
22	Correct	66 ms	5112 KB	Output is correct
23	Correct	46 ms	5112 KB	Output is correct
24	Runtime error	89 ms	5112 KB	Execution killed because of forbidden syscall writev (20)
25	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	5112 KB	Output is correct
2	Correct	6 ms	5112 KB	Output is correct
3	Correct	0 ms	5112 KB	Output is correct
4	Correct	6 ms	5112 KB	Output is correct
5	Correct	19 ms	5112 KB	Output is correct
6	Correct	6 ms	5112 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	13 ms	5112 KB	Output is correct
9	Correct	6 ms	5112 KB	Output is correct
10	Correct	26 ms	5112 KB	Output is correct
11	Correct	33 ms	5112 KB	Output is correct
12	Correct	29 ms	5112 KB	Output is correct
13	Correct	23 ms	5112 KB	Output is correct
14	Correct	36 ms	5112 KB	Output is correct
15	Correct	29 ms	5112 KB	Output is correct
16	Correct	29 ms	5112 KB	Output is correct
17	Correct	19 ms	5112 KB	Output is correct
18	Correct	29 ms	5112 KB	Output is correct
19	Correct	26 ms	5112 KB	Output is correct
20	Correct	29 ms	5112 KB	Output is correct
21	Correct	56 ms	5112 KB	Output is correct
22	Correct	66 ms	5112 KB	Output is correct
23	Correct	46 ms	5112 KB	Output is correct
24	Runtime error	89 ms	5112 KB	Execution killed because of forbidden syscall writev (20)
25	Halted	0 ms	0 KB	-

Submission #38454

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 15.0

Subtask #4 0 / 16.0

Subtask #5 0 / 21.0

Subtask #6 0 / 35.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 15.0

Subtask #4
0 / 16.0

Subtask #5
0 / 21.0

Subtask #6
0 / 35.0