Submission #498133

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
498133	2021-12-24T12:14:47 Z	tmn2005	Bootfall (IZhO17_bootfall)	C++17	13 / 100	1000 ms	472 KB

bootfall

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

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],dp[N],b,c;
set<int>s;
map<int,int>mp;

main(){
	NeedForSpeed
    cin>>n;	
    for(int i=1; i<=n; i++){
    	cin>>a[i];
    	x += a[i];
	}
	if(n % 2){
		cout<<0;
		ret 0;
	}
	for(int j=0; j<=x; j++){
		for(int i=1; i<=n; i++){
			int tm = a[i];
				int f = x - (a[i] - j);
				a[i] = j;
				dp[0] = 1;
				
				for(int k=1; k<=n; k++){
					for(int l=f-a[k]; l>=0; l--){
						if(dp[l]){
							dp[l+a[k]] = 1;
						}
					}
				}
				if(dp[f/2] && f % 2 == 0){
					s.ins(j);
					mp[j]++;
					if(mp[j] >= n)res++;
				}
				for(int k=0; k<=f; k++)dp[k] = 0;
			a[i] = tm;
		}
	}
	cout<<res<<endl;
	for(int i : s)if(mp[i] >= n)cout<<i<<" ";




	return 0;
}

Compilation message

bootfall.cpp:36:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main(){
      | ^~~~

Subtask #1
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	12 ms	336 KB	Output is correct
5	Correct	213 ms	360 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	5 ms	332 KB	Output is correct
8	Correct	575 ms	472 KB	Output is correct
9	Correct	50 ms	356 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	12 ms	336 KB	Output is correct
5	Correct	213 ms	360 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	5 ms	332 KB	Output is correct
8	Correct	575 ms	472 KB	Output is correct
9	Correct	50 ms	356 KB	Output is correct
10	Correct	383 ms	316 KB	Output is correct
11	Correct	76 ms	332 KB	Output is correct
12	Correct	178 ms	448 KB	Output is correct
13	Correct	53 ms	340 KB	Output is correct
14	Correct	87 ms	332 KB	Output is correct
15	Correct	50 ms	340 KB	Output is correct
16	Correct	93 ms	340 KB	Output is correct
17	Correct	21 ms	340 KB	Output is correct
18	Correct	47 ms	344 KB	Output is correct
19	Correct	40 ms	332 KB	Output is correct
20	Correct	406 ms	332 KB	Output is correct

Subtask #3
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	12 ms	336 KB	Output is correct
5	Correct	213 ms	360 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	5 ms	332 KB	Output is correct
8	Correct	575 ms	472 KB	Output is correct
9	Correct	50 ms	356 KB	Output is correct
10	Correct	383 ms	316 KB	Output is correct
11	Correct	76 ms	332 KB	Output is correct
12	Correct	178 ms	448 KB	Output is correct
13	Correct	53 ms	340 KB	Output is correct
14	Correct	87 ms	332 KB	Output is correct
15	Correct	50 ms	340 KB	Output is correct
16	Correct	93 ms	340 KB	Output is correct
17	Correct	21 ms	340 KB	Output is correct
18	Correct	47 ms	344 KB	Output is correct
19	Correct	40 ms	332 KB	Output is correct
20	Correct	406 ms	332 KB	Output is correct
21	Execution timed out	1083 ms	332 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #4
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	12 ms	336 KB	Output is correct
5	Correct	213 ms	360 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	5 ms	332 KB	Output is correct
8	Correct	575 ms	472 KB	Output is correct
9	Correct	50 ms	356 KB	Output is correct
10	Correct	383 ms	316 KB	Output is correct
11	Correct	76 ms	332 KB	Output is correct
12	Correct	178 ms	448 KB	Output is correct
13	Correct	53 ms	340 KB	Output is correct
14	Correct	87 ms	332 KB	Output is correct
15	Correct	50 ms	340 KB	Output is correct
16	Correct	93 ms	340 KB	Output is correct
17	Correct	21 ms	340 KB	Output is correct
18	Correct	47 ms	344 KB	Output is correct
19	Correct	40 ms	332 KB	Output is correct
20	Correct	406 ms	332 KB	Output is correct
21	Execution timed out	1083 ms	332 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	12 ms	336 KB	Output is correct
5	Correct	213 ms	360 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	5 ms	332 KB	Output is correct
8	Correct	575 ms	472 KB	Output is correct
9	Correct	50 ms	356 KB	Output is correct
10	Correct	383 ms	316 KB	Output is correct
11	Correct	76 ms	332 KB	Output is correct
12	Correct	178 ms	448 KB	Output is correct
13	Correct	53 ms	340 KB	Output is correct
14	Correct	87 ms	332 KB	Output is correct
15	Correct	50 ms	340 KB	Output is correct
16	Correct	93 ms	340 KB	Output is correct
17	Correct	21 ms	340 KB	Output is correct
18	Correct	47 ms	344 KB	Output is correct
19	Correct	40 ms	332 KB	Output is correct
20	Correct	406 ms	332 KB	Output is correct
21	Execution timed out	1083 ms	332 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	12 ms	336 KB	Output is correct
5	Correct	213 ms	360 KB	Output is correct
6	Correct	4 ms	332 KB	Output is correct
7	Correct	5 ms	332 KB	Output is correct
8	Correct	575 ms	472 KB	Output is correct
9	Correct	50 ms	356 KB	Output is correct
10	Correct	383 ms	316 KB	Output is correct
11	Correct	76 ms	332 KB	Output is correct
12	Correct	178 ms	448 KB	Output is correct
13	Correct	53 ms	340 KB	Output is correct
14	Correct	87 ms	332 KB	Output is correct
15	Correct	50 ms	340 KB	Output is correct
16	Correct	93 ms	340 KB	Output is correct
17	Correct	21 ms	340 KB	Output is correct
18	Correct	47 ms	344 KB	Output is correct
19	Correct	40 ms	332 KB	Output is correct
20	Correct	406 ms	332 KB	Output is correct
21	Execution timed out	1083 ms	332 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Submission #498133

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