Submission #86411

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
86411	2018-11-26T09:24:49 Z	Scayre	Bootfall (IZhO17_bootfall)	C++17	28 / 100	1000 ms	3528 KB

bootfall

///////////////////////////
//         INFO          //
//                       //
//    Handle -> Scayre   //
//                       //
//   Template vers. 1.1  //
//                       //
//   It'll be accepted   //
//                       //
///////////////////////////

//████╗████████╗██╗███████╗══███╗═══███╗████████╗════//
//═██╔╝═══██╔══╝╚█║██╔════╝══████╗═████║██╔═════╝═══//
//═██║════██║════╚╝███████╗══██╔████╔██║█████╗══════//
//═██║════██║══════╚════██║══██║╚██╔╝██║██╔══╝══════//
//████╗═══██║══════███████║══██║═╚═╝═██║███████╗═════//


#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <complex>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>

#define ll long long
#define ld long double
#define ull unsigned ll
#define ioi exit(0);

#define f first
#define s second

#define inf (int)1e9 + 7

#define NFS ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define mp(x,y) make_pair(x,y)

#define lb(x) lower_bound(x)
#define ub(x) upper_bound(x)

#define pb push_back
#define ppb pop_back

#define bitcoin __builtin_popcount

#define endl "\n"

#define in(x) insert(x)

#define sz(x) (int)x.size()

#define all(x) x.begin(),x.end()

#define pw2(x) (1<<x) //2^x

#define forit(it,v) for (typeof(v.begin()) it = v.begin(); it != v.end(); ++it)

#define sqr(x) ((x) * 1ll * (x))

#define UpdateRandom srand (time(NULL));

using namespace std;

const int N = (int)5e5 + 7, MOD = (int)1e9 + 7;

int n,sum;

int cnt[N];

bool u[N];

int a[N];

int dp[N];

vector<int> v,b;

int main(){

	#ifdef IOI2019
		freopen ("in.txt", "r", stdin);
	#endif

	NFS

	cin >> n;

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

	if(sum%2==1){
		cout << 0 << endl;
		ioi
	}

	memset(dp,-1,sizeof(dp));

	dp[0]=0;

	for(int i=1;i<=n;i++){
		for(int j=sum/2;j>=a[i];j--){
			if(dp[j-a[i]]!=-1 && dp[j]==-1){
				dp[j]=i;
			}
		}
	}

	if(dp[sum/2]==-1){
		cout << 0 << endl;
		ioi
	}

	for(int k=1;k<=n;k++){
		int x=a[k];
		a[k]=0;
		memset(u,0,sizeof(u));
		memset(dp,-1,sizeof(dp));
		dp[0]=0;
		sum-=x;
		for(int i=1;i<=n;i++){
			for(int j=sum;j>=a[i];j--){
				if(dp[j-a[i]]!=-1 && dp[j]==-1){
					dp[j]=i;
				}
			}
		}
		//cout << k << endl;
		for(int j=sum;j>=0;j--){
			if(dp[j]!=-1){
				if(u[abs(j-(sum-j))]!=1){
					cnt[abs(j-(sum-j))]++;
				}
				u[abs(j-(sum-j))]=1;
			}
		}
		//cout << endl;
		a[k]=x;
		sum+=x;
	}

	for(int i=1;i<=sum;i++){
		if(cnt[i]==n){
			v.pb(i);
		}
	}

	cout << sz(v) << endl;

	for(int i=0;i<sz(v);i++){
		cout << v[i] << ' ';
	}

	#ifdef IOI2019
		cout << "\nTime Elapsed : " << clock () * 1.0 / CLOCKS_PER_SEC << endl;
	#endif

	ioi
}

Subtask #1
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2808 KB	Output is correct
2	Correct	5 ms	2808 KB	Output is correct
3	Correct	4 ms	2808 KB	Output is correct
4	Correct	4 ms	2892 KB	Output is correct
5	Correct	6 ms	2916 KB	Output is correct
6	Correct	5 ms	3124 KB	Output is correct
7	Correct	5 ms	3124 KB	Output is correct
8	Correct	7 ms	3124 KB	Output is correct
9	Correct	6 ms	3124 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2808 KB	Output is correct
2	Correct	5 ms	2808 KB	Output is correct
3	Correct	4 ms	2808 KB	Output is correct
4	Correct	4 ms	2892 KB	Output is correct
5	Correct	6 ms	2916 KB	Output is correct
6	Correct	5 ms	3124 KB	Output is correct
7	Correct	5 ms	3124 KB	Output is correct
8	Correct	7 ms	3124 KB	Output is correct
9	Correct	6 ms	3124 KB	Output is correct
10	Correct	10 ms	3124 KB	Output is correct
11	Correct	9 ms	3124 KB	Output is correct
12	Correct	9 ms	3124 KB	Output is correct
13	Correct	8 ms	3124 KB	Output is correct
14	Correct	8 ms	3156 KB	Output is correct
15	Correct	9 ms	3156 KB	Output is correct
16	Correct	8 ms	3156 KB	Output is correct
17	Correct	8 ms	3156 KB	Output is correct
18	Correct	8 ms	3156 KB	Output is correct
19	Correct	8 ms	3156 KB	Output is correct
20	Correct	9 ms	3224 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2808 KB	Output is correct
2	Correct	5 ms	2808 KB	Output is correct
3	Correct	4 ms	2808 KB	Output is correct
4	Correct	4 ms	2892 KB	Output is correct
5	Correct	6 ms	2916 KB	Output is correct
6	Correct	5 ms	3124 KB	Output is correct
7	Correct	5 ms	3124 KB	Output is correct
8	Correct	7 ms	3124 KB	Output is correct
9	Correct	6 ms	3124 KB	Output is correct
10	Correct	10 ms	3124 KB	Output is correct
11	Correct	9 ms	3124 KB	Output is correct
12	Correct	9 ms	3124 KB	Output is correct
13	Correct	8 ms	3124 KB	Output is correct
14	Correct	8 ms	3156 KB	Output is correct
15	Correct	9 ms	3156 KB	Output is correct
16	Correct	8 ms	3156 KB	Output is correct
17	Correct	8 ms	3156 KB	Output is correct
18	Correct	8 ms	3156 KB	Output is correct
19	Correct	8 ms	3156 KB	Output is correct
20	Correct	9 ms	3224 KB	Output is correct
21	Correct	26 ms	3224 KB	Output is correct
22	Correct	33 ms	3224 KB	Output is correct
23	Correct	20 ms	3224 KB	Output is correct
24	Correct	63 ms	3292 KB	Output is correct
25	Correct	196 ms	3312 KB	Output is correct
26	Correct	213 ms	3324 KB	Output is correct
27	Correct	277 ms	3324 KB	Output is correct
28	Correct	269 ms	3336 KB	Output is correct
29	Correct	246 ms	3356 KB	Output is correct
30	Correct	77 ms	3356 KB	Output is correct
31	Correct	104 ms	3356 KB	Output is correct
32	Correct	62 ms	3356 KB	Output is correct
33	Correct	123 ms	3412 KB	Output is correct
34	Correct	115 ms	3412 KB	Output is correct
35	Correct	242 ms	3412 KB	Output is correct
36	Correct	72 ms	3412 KB	Output is correct

Subtask #4
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2808 KB	Output is correct
2	Correct	5 ms	2808 KB	Output is correct
3	Correct	4 ms	2808 KB	Output is correct
4	Correct	4 ms	2892 KB	Output is correct
5	Correct	6 ms	2916 KB	Output is correct
6	Correct	5 ms	3124 KB	Output is correct
7	Correct	5 ms	3124 KB	Output is correct
8	Correct	7 ms	3124 KB	Output is correct
9	Correct	6 ms	3124 KB	Output is correct
10	Correct	10 ms	3124 KB	Output is correct
11	Correct	9 ms	3124 KB	Output is correct
12	Correct	9 ms	3124 KB	Output is correct
13	Correct	8 ms	3124 KB	Output is correct
14	Correct	8 ms	3156 KB	Output is correct
15	Correct	9 ms	3156 KB	Output is correct
16	Correct	8 ms	3156 KB	Output is correct
17	Correct	8 ms	3156 KB	Output is correct
18	Correct	8 ms	3156 KB	Output is correct
19	Correct	8 ms	3156 KB	Output is correct
20	Correct	9 ms	3224 KB	Output is correct
21	Correct	26 ms	3224 KB	Output is correct
22	Correct	33 ms	3224 KB	Output is correct
23	Correct	20 ms	3224 KB	Output is correct
24	Correct	63 ms	3292 KB	Output is correct
25	Correct	196 ms	3312 KB	Output is correct
26	Correct	213 ms	3324 KB	Output is correct
27	Correct	277 ms	3324 KB	Output is correct
28	Correct	269 ms	3336 KB	Output is correct
29	Correct	246 ms	3356 KB	Output is correct
30	Correct	77 ms	3356 KB	Output is correct
31	Correct	104 ms	3356 KB	Output is correct
32	Correct	62 ms	3356 KB	Output is correct
33	Correct	123 ms	3412 KB	Output is correct
34	Correct	115 ms	3412 KB	Output is correct
35	Correct	242 ms	3412 KB	Output is correct
36	Correct	72 ms	3412 KB	Output is correct
37	Correct	778 ms	3508 KB	Output is correct
38	Correct	843 ms	3528 KB	Output is correct
39	Execution timed out	1081 ms	3528 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2808 KB	Output is correct
2	Correct	5 ms	2808 KB	Output is correct
3	Correct	4 ms	2808 KB	Output is correct
4	Correct	4 ms	2892 KB	Output is correct
5	Correct	6 ms	2916 KB	Output is correct
6	Correct	5 ms	3124 KB	Output is correct
7	Correct	5 ms	3124 KB	Output is correct
8	Correct	7 ms	3124 KB	Output is correct
9	Correct	6 ms	3124 KB	Output is correct
10	Correct	10 ms	3124 KB	Output is correct
11	Correct	9 ms	3124 KB	Output is correct
12	Correct	9 ms	3124 KB	Output is correct
13	Correct	8 ms	3124 KB	Output is correct
14	Correct	8 ms	3156 KB	Output is correct
15	Correct	9 ms	3156 KB	Output is correct
16	Correct	8 ms	3156 KB	Output is correct
17	Correct	8 ms	3156 KB	Output is correct
18	Correct	8 ms	3156 KB	Output is correct
19	Correct	8 ms	3156 KB	Output is correct
20	Correct	9 ms	3224 KB	Output is correct
21	Correct	26 ms	3224 KB	Output is correct
22	Correct	33 ms	3224 KB	Output is correct
23	Correct	20 ms	3224 KB	Output is correct
24	Correct	63 ms	3292 KB	Output is correct
25	Correct	196 ms	3312 KB	Output is correct
26	Correct	213 ms	3324 KB	Output is correct
27	Correct	277 ms	3324 KB	Output is correct
28	Correct	269 ms	3336 KB	Output is correct
29	Correct	246 ms	3356 KB	Output is correct
30	Correct	77 ms	3356 KB	Output is correct
31	Correct	104 ms	3356 KB	Output is correct
32	Correct	62 ms	3356 KB	Output is correct
33	Correct	123 ms	3412 KB	Output is correct
34	Correct	115 ms	3412 KB	Output is correct
35	Correct	242 ms	3412 KB	Output is correct
36	Correct	72 ms	3412 KB	Output is correct
37	Correct	778 ms	3508 KB	Output is correct
38	Correct	843 ms	3528 KB	Output is correct
39	Execution timed out	1081 ms	3528 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2808 KB	Output is correct
2	Correct	5 ms	2808 KB	Output is correct
3	Correct	4 ms	2808 KB	Output is correct
4	Correct	4 ms	2892 KB	Output is correct
5	Correct	6 ms	2916 KB	Output is correct
6	Correct	5 ms	3124 KB	Output is correct
7	Correct	5 ms	3124 KB	Output is correct
8	Correct	7 ms	3124 KB	Output is correct
9	Correct	6 ms	3124 KB	Output is correct
10	Correct	10 ms	3124 KB	Output is correct
11	Correct	9 ms	3124 KB	Output is correct
12	Correct	9 ms	3124 KB	Output is correct
13	Correct	8 ms	3124 KB	Output is correct
14	Correct	8 ms	3156 KB	Output is correct
15	Correct	9 ms	3156 KB	Output is correct
16	Correct	8 ms	3156 KB	Output is correct
17	Correct	8 ms	3156 KB	Output is correct
18	Correct	8 ms	3156 KB	Output is correct
19	Correct	8 ms	3156 KB	Output is correct
20	Correct	9 ms	3224 KB	Output is correct
21	Correct	26 ms	3224 KB	Output is correct
22	Correct	33 ms	3224 KB	Output is correct
23	Correct	20 ms	3224 KB	Output is correct
24	Correct	63 ms	3292 KB	Output is correct
25	Correct	196 ms	3312 KB	Output is correct
26	Correct	213 ms	3324 KB	Output is correct
27	Correct	277 ms	3324 KB	Output is correct
28	Correct	269 ms	3336 KB	Output is correct
29	Correct	246 ms	3356 KB	Output is correct
30	Correct	77 ms	3356 KB	Output is correct
31	Correct	104 ms	3356 KB	Output is correct
32	Correct	62 ms	3356 KB	Output is correct
33	Correct	123 ms	3412 KB	Output is correct
34	Correct	115 ms	3412 KB	Output is correct
35	Correct	242 ms	3412 KB	Output is correct
36	Correct	72 ms	3412 KB	Output is correct
37	Correct	778 ms	3508 KB	Output is correct
38	Correct	843 ms	3528 KB	Output is correct
39	Execution timed out	1081 ms	3528 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

Submission #86411

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 15.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
15.0 / 15.0

Subtask #4
0 / 16.0

Subtask #5
0 / 21.0

Subtask #6
0 / 35.0