답안 #86870 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
86870	2018-11-28T05:53:54 Z	Scayre	Bootfall (IZhO17_bootfall)	C++14	28 / 100	1000 ms	3116 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
	}
 
	memset(dp,-1,sizeof(dp));
 
	for(int k=1;k<=n;k++){
		int x=a[k];
		a[k]=0;
		//memset(u,0,sizeof(u));
		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;
				dp[j]=-1;
			}
		}
		//cout << endl;
		a[k]=x;
		sum+=x;
	}
 
	for(int i=1;i<=sum;i++){
		if(cnt[i]==n*2){
			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

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2296 KB	Output is correct
2	Correct	4 ms	2428 KB	Output is correct
3	Correct	4 ms	2428 KB	Output is correct
4	Correct	4 ms	2428 KB	Output is correct
5	Correct	4 ms	2428 KB	Output is correct
6	Correct	4 ms	2428 KB	Output is correct
7	Correct	4 ms	2428 KB	Output is correct
8	Correct	4 ms	2464 KB	Output is correct
9	Correct	4 ms	2468 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2296 KB	Output is correct
2	Correct	4 ms	2428 KB	Output is correct
3	Correct	4 ms	2428 KB	Output is correct
4	Correct	4 ms	2428 KB	Output is correct
5	Correct	4 ms	2428 KB	Output is correct
6	Correct	4 ms	2428 KB	Output is correct
7	Correct	4 ms	2428 KB	Output is correct
8	Correct	4 ms	2464 KB	Output is correct
9	Correct	4 ms	2468 KB	Output is correct
10	Correct	4 ms	2472 KB	Output is correct
11	Correct	4 ms	2476 KB	Output is correct
12	Correct	4 ms	2476 KB	Output is correct
13	Correct	4 ms	2668 KB	Output is correct
14	Correct	4 ms	2668 KB	Output is correct
15	Correct	4 ms	2668 KB	Output is correct
16	Correct	4 ms	2668 KB	Output is correct
17	Correct	4 ms	2668 KB	Output is correct
18	Correct	4 ms	2668 KB	Output is correct
19	Correct	4 ms	2668 KB	Output is correct
20	Correct	5 ms	2668 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2296 KB	Output is correct
2	Correct	4 ms	2428 KB	Output is correct
3	Correct	4 ms	2428 KB	Output is correct
4	Correct	4 ms	2428 KB	Output is correct
5	Correct	4 ms	2428 KB	Output is correct
6	Correct	4 ms	2428 KB	Output is correct
7	Correct	4 ms	2428 KB	Output is correct
8	Correct	4 ms	2464 KB	Output is correct
9	Correct	4 ms	2468 KB	Output is correct
10	Correct	4 ms	2472 KB	Output is correct
11	Correct	4 ms	2476 KB	Output is correct
12	Correct	4 ms	2476 KB	Output is correct
13	Correct	4 ms	2668 KB	Output is correct
14	Correct	4 ms	2668 KB	Output is correct
15	Correct	4 ms	2668 KB	Output is correct
16	Correct	4 ms	2668 KB	Output is correct
17	Correct	4 ms	2668 KB	Output is correct
18	Correct	4 ms	2668 KB	Output is correct
19	Correct	4 ms	2668 KB	Output is correct
20	Correct	5 ms	2668 KB	Output is correct
21	Correct	17 ms	2668 KB	Output is correct
22	Correct	24 ms	2668 KB	Output is correct
23	Correct	10 ms	2668 KB	Output is correct
24	Correct	68 ms	2760 KB	Output is correct
25	Correct	101 ms	2776 KB	Output is correct
26	Correct	119 ms	2880 KB	Output is correct
27	Correct	112 ms	2880 KB	Output is correct
28	Correct	115 ms	2880 KB	Output is correct
29	Correct	122 ms	2880 KB	Output is correct
30	Correct	56 ms	2880 KB	Output is correct
31	Correct	82 ms	2880 KB	Output is correct
32	Correct	48 ms	2880 KB	Output is correct
33	Correct	116 ms	2880 KB	Output is correct
34	Correct	131 ms	2880 KB	Output is correct
35	Correct	119 ms	2880 KB	Output is correct
36	Correct	51 ms	2880 KB	Output is correct

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2296 KB	Output is correct
2	Correct	4 ms	2428 KB	Output is correct
3	Correct	4 ms	2428 KB	Output is correct
4	Correct	4 ms	2428 KB	Output is correct
5	Correct	4 ms	2428 KB	Output is correct
6	Correct	4 ms	2428 KB	Output is correct
7	Correct	4 ms	2428 KB	Output is correct
8	Correct	4 ms	2464 KB	Output is correct
9	Correct	4 ms	2468 KB	Output is correct
10	Correct	4 ms	2472 KB	Output is correct
11	Correct	4 ms	2476 KB	Output is correct
12	Correct	4 ms	2476 KB	Output is correct
13	Correct	4 ms	2668 KB	Output is correct
14	Correct	4 ms	2668 KB	Output is correct
15	Correct	4 ms	2668 KB	Output is correct
16	Correct	4 ms	2668 KB	Output is correct
17	Correct	4 ms	2668 KB	Output is correct
18	Correct	4 ms	2668 KB	Output is correct
19	Correct	4 ms	2668 KB	Output is correct
20	Correct	5 ms	2668 KB	Output is correct
21	Correct	17 ms	2668 KB	Output is correct
22	Correct	24 ms	2668 KB	Output is correct
23	Correct	10 ms	2668 KB	Output is correct
24	Correct	68 ms	2760 KB	Output is correct
25	Correct	101 ms	2776 KB	Output is correct
26	Correct	119 ms	2880 KB	Output is correct
27	Correct	112 ms	2880 KB	Output is correct
28	Correct	115 ms	2880 KB	Output is correct
29	Correct	122 ms	2880 KB	Output is correct
30	Correct	56 ms	2880 KB	Output is correct
31	Correct	82 ms	2880 KB	Output is correct
32	Correct	48 ms	2880 KB	Output is correct
33	Correct	116 ms	2880 KB	Output is correct
34	Correct	131 ms	2880 KB	Output is correct
35	Correct	119 ms	2880 KB	Output is correct
36	Correct	51 ms	2880 KB	Output is correct
37	Correct	810 ms	3000 KB	Output is correct
38	Correct	927 ms	3116 KB	Output is correct
39	Execution timed out	1082 ms	3116 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2296 KB	Output is correct
2	Correct	4 ms	2428 KB	Output is correct
3	Correct	4 ms	2428 KB	Output is correct
4	Correct	4 ms	2428 KB	Output is correct
5	Correct	4 ms	2428 KB	Output is correct
6	Correct	4 ms	2428 KB	Output is correct
7	Correct	4 ms	2428 KB	Output is correct
8	Correct	4 ms	2464 KB	Output is correct
9	Correct	4 ms	2468 KB	Output is correct
10	Correct	4 ms	2472 KB	Output is correct
11	Correct	4 ms	2476 KB	Output is correct
12	Correct	4 ms	2476 KB	Output is correct
13	Correct	4 ms	2668 KB	Output is correct
14	Correct	4 ms	2668 KB	Output is correct
15	Correct	4 ms	2668 KB	Output is correct
16	Correct	4 ms	2668 KB	Output is correct
17	Correct	4 ms	2668 KB	Output is correct
18	Correct	4 ms	2668 KB	Output is correct
19	Correct	4 ms	2668 KB	Output is correct
20	Correct	5 ms	2668 KB	Output is correct
21	Correct	17 ms	2668 KB	Output is correct
22	Correct	24 ms	2668 KB	Output is correct
23	Correct	10 ms	2668 KB	Output is correct
24	Correct	68 ms	2760 KB	Output is correct
25	Correct	101 ms	2776 KB	Output is correct
26	Correct	119 ms	2880 KB	Output is correct
27	Correct	112 ms	2880 KB	Output is correct
28	Correct	115 ms	2880 KB	Output is correct
29	Correct	122 ms	2880 KB	Output is correct
30	Correct	56 ms	2880 KB	Output is correct
31	Correct	82 ms	2880 KB	Output is correct
32	Correct	48 ms	2880 KB	Output is correct
33	Correct	116 ms	2880 KB	Output is correct
34	Correct	131 ms	2880 KB	Output is correct
35	Correct	119 ms	2880 KB	Output is correct
36	Correct	51 ms	2880 KB	Output is correct
37	Correct	810 ms	3000 KB	Output is correct
38	Correct	927 ms	3116 KB	Output is correct
39	Execution timed out	1082 ms	3116 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2296 KB	Output is correct
2	Correct	4 ms	2428 KB	Output is correct
3	Correct	4 ms	2428 KB	Output is correct
4	Correct	4 ms	2428 KB	Output is correct
5	Correct	4 ms	2428 KB	Output is correct
6	Correct	4 ms	2428 KB	Output is correct
7	Correct	4 ms	2428 KB	Output is correct
8	Correct	4 ms	2464 KB	Output is correct
9	Correct	4 ms	2468 KB	Output is correct
10	Correct	4 ms	2472 KB	Output is correct
11	Correct	4 ms	2476 KB	Output is correct
12	Correct	4 ms	2476 KB	Output is correct
13	Correct	4 ms	2668 KB	Output is correct
14	Correct	4 ms	2668 KB	Output is correct
15	Correct	4 ms	2668 KB	Output is correct
16	Correct	4 ms	2668 KB	Output is correct
17	Correct	4 ms	2668 KB	Output is correct
18	Correct	4 ms	2668 KB	Output is correct
19	Correct	4 ms	2668 KB	Output is correct
20	Correct	5 ms	2668 KB	Output is correct
21	Correct	17 ms	2668 KB	Output is correct
22	Correct	24 ms	2668 KB	Output is correct
23	Correct	10 ms	2668 KB	Output is correct
24	Correct	68 ms	2760 KB	Output is correct
25	Correct	101 ms	2776 KB	Output is correct
26	Correct	119 ms	2880 KB	Output is correct
27	Correct	112 ms	2880 KB	Output is correct
28	Correct	115 ms	2880 KB	Output is correct
29	Correct	122 ms	2880 KB	Output is correct
30	Correct	56 ms	2880 KB	Output is correct
31	Correct	82 ms	2880 KB	Output is correct
32	Correct	48 ms	2880 KB	Output is correct
33	Correct	116 ms	2880 KB	Output is correct
34	Correct	131 ms	2880 KB	Output is correct
35	Correct	119 ms	2880 KB	Output is correct
36	Correct	51 ms	2880 KB	Output is correct
37	Correct	810 ms	3000 KB	Output is correct
38	Correct	927 ms	3116 KB	Output is correct
39	Execution timed out	1082 ms	3116 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

답안 #86870

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