답안 #686765

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
686765	2023-01-25T23:16:53 Z	tolbi	Bootfall (IZhO17_bootfall)	C++17	13 / 100	90 ms	6268 KB

bootfall

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
#ifdef LOCAL
	#include "23.h"
#endif
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
using namespace std;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int32_t main(){
	ios;
	int t=1;
	int tno = 0;
	if (!t) cin>>t;
	while (t-(tno++)){
		deci(n);
		vint(arr(n));
		cinarr(arr);
		vector<int> ansarr(252323,0);
		ansarr[0]=1;
		int sum = 0;
		for (int i = 0; i < n; i++){
			sum+=arr[i];
			for(int j = 250000-1; j >= arr[i]; j--){
				ansarr[j] += ansarr[j-arr[i]];
			}
		}
		if (sum%2 || ansarr[sum/2]==0){
			cout<<0<<endl;
			continue;
		}
		vector<int> kk(500001,0);
		for (int i = 0; i < n; i++){
			for (int j = 0; j < 250000; j++){
				if (ansarr[j]>0 && j*2>=sum-arr[i]) kk[j*2-sum+arr[i]]++;
				if (j<=250000-arr[i]) ansarr[j+arr[i]]-=ansarr[j];
			}
			for (int j = 250000; j >= arr[i]; j--){
				ansarr[j]+=ansarr[j-arr[i]];
			}
		}
		vector<int> hueh;
		for (int i = 1; i < kk.size(); i++){
			if (kk[i]==n) hueh.push_back(i);
		}
		cout<<hueh.size()<<endl;
		coutarr(hueh);
	}
}

Compilation message

bootfall.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
bootfall.cpp: In function 'int32_t main()':
bootfall.cpp:66:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |   for (int i = 1; i < kk.size(); i++){
      |                   ~~^~~~~~~~~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6100 KB	Output is correct
2	Correct	11 ms	6100 KB	Output is correct
3	Correct	3 ms	2260 KB	Output is correct
4	Correct	9 ms	6224 KB	Output is correct
5	Correct	18 ms	6100 KB	Output is correct
6	Correct	15 ms	6100 KB	Output is correct
7	Correct	12 ms	6112 KB	Output is correct
8	Correct	20 ms	6100 KB	Output is correct
9	Correct	15 ms	6228 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6100 KB	Output is correct
2	Correct	11 ms	6100 KB	Output is correct
3	Correct	3 ms	2260 KB	Output is correct
4	Correct	9 ms	6224 KB	Output is correct
5	Correct	18 ms	6100 KB	Output is correct
6	Correct	15 ms	6100 KB	Output is correct
7	Correct	12 ms	6112 KB	Output is correct
8	Correct	20 ms	6100 KB	Output is correct
9	Correct	15 ms	6228 KB	Output is correct
10	Correct	38 ms	6268 KB	Output is correct
11	Correct	38 ms	6208 KB	Output is correct
12	Correct	39 ms	6196 KB	Output is correct
13	Correct	36 ms	6100 KB	Output is correct
14	Correct	37 ms	6100 KB	Output is correct
15	Correct	35 ms	6192 KB	Output is correct
16	Correct	37 ms	6104 KB	Output is correct
17	Correct	24 ms	6224 KB	Output is correct
18	Correct	31 ms	6148 KB	Output is correct
19	Correct	33 ms	6204 KB	Output is correct
20	Correct	38 ms	6100 KB	Output is correct

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6100 KB	Output is correct
2	Correct	11 ms	6100 KB	Output is correct
3	Correct	3 ms	2260 KB	Output is correct
4	Correct	9 ms	6224 KB	Output is correct
5	Correct	18 ms	6100 KB	Output is correct
6	Correct	15 ms	6100 KB	Output is correct
7	Correct	12 ms	6112 KB	Output is correct
8	Correct	20 ms	6100 KB	Output is correct
9	Correct	15 ms	6228 KB	Output is correct
10	Correct	38 ms	6268 KB	Output is correct
11	Correct	38 ms	6208 KB	Output is correct
12	Correct	39 ms	6196 KB	Output is correct
13	Correct	36 ms	6100 KB	Output is correct
14	Correct	37 ms	6100 KB	Output is correct
15	Correct	35 ms	6192 KB	Output is correct
16	Correct	37 ms	6104 KB	Output is correct
17	Correct	24 ms	6224 KB	Output is correct
18	Correct	31 ms	6148 KB	Output is correct
19	Correct	33 ms	6204 KB	Output is correct
20	Correct	38 ms	6100 KB	Output is correct
21	Correct	80 ms	6208 KB	Output is correct
22	Incorrect	90 ms	6220 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6100 KB	Output is correct
2	Correct	11 ms	6100 KB	Output is correct
3	Correct	3 ms	2260 KB	Output is correct
4	Correct	9 ms	6224 KB	Output is correct
5	Correct	18 ms	6100 KB	Output is correct
6	Correct	15 ms	6100 KB	Output is correct
7	Correct	12 ms	6112 KB	Output is correct
8	Correct	20 ms	6100 KB	Output is correct
9	Correct	15 ms	6228 KB	Output is correct
10	Correct	38 ms	6268 KB	Output is correct
11	Correct	38 ms	6208 KB	Output is correct
12	Correct	39 ms	6196 KB	Output is correct
13	Correct	36 ms	6100 KB	Output is correct
14	Correct	37 ms	6100 KB	Output is correct
15	Correct	35 ms	6192 KB	Output is correct
16	Correct	37 ms	6104 KB	Output is correct
17	Correct	24 ms	6224 KB	Output is correct
18	Correct	31 ms	6148 KB	Output is correct
19	Correct	33 ms	6204 KB	Output is correct
20	Correct	38 ms	6100 KB	Output is correct
21	Correct	80 ms	6208 KB	Output is correct
22	Incorrect	90 ms	6220 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6100 KB	Output is correct
2	Correct	11 ms	6100 KB	Output is correct
3	Correct	3 ms	2260 KB	Output is correct
4	Correct	9 ms	6224 KB	Output is correct
5	Correct	18 ms	6100 KB	Output is correct
6	Correct	15 ms	6100 KB	Output is correct
7	Correct	12 ms	6112 KB	Output is correct
8	Correct	20 ms	6100 KB	Output is correct
9	Correct	15 ms	6228 KB	Output is correct
10	Correct	38 ms	6268 KB	Output is correct
11	Correct	38 ms	6208 KB	Output is correct
12	Correct	39 ms	6196 KB	Output is correct
13	Correct	36 ms	6100 KB	Output is correct
14	Correct	37 ms	6100 KB	Output is correct
15	Correct	35 ms	6192 KB	Output is correct
16	Correct	37 ms	6104 KB	Output is correct
17	Correct	24 ms	6224 KB	Output is correct
18	Correct	31 ms	6148 KB	Output is correct
19	Correct	33 ms	6204 KB	Output is correct
20	Correct	38 ms	6100 KB	Output is correct
21	Correct	80 ms	6208 KB	Output is correct
22	Incorrect	90 ms	6220 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	6100 KB	Output is correct
2	Correct	11 ms	6100 KB	Output is correct
3	Correct	3 ms	2260 KB	Output is correct
4	Correct	9 ms	6224 KB	Output is correct
5	Correct	18 ms	6100 KB	Output is correct
6	Correct	15 ms	6100 KB	Output is correct
7	Correct	12 ms	6112 KB	Output is correct
8	Correct	20 ms	6100 KB	Output is correct
9	Correct	15 ms	6228 KB	Output is correct
10	Correct	38 ms	6268 KB	Output is correct
11	Correct	38 ms	6208 KB	Output is correct
12	Correct	39 ms	6196 KB	Output is correct
13	Correct	36 ms	6100 KB	Output is correct
14	Correct	37 ms	6100 KB	Output is correct
15	Correct	35 ms	6192 KB	Output is correct
16	Correct	37 ms	6104 KB	Output is correct
17	Correct	24 ms	6224 KB	Output is correct
18	Correct	31 ms	6148 KB	Output is correct
19	Correct	33 ms	6204 KB	Output is correct
20	Correct	38 ms	6100 KB	Output is correct
21	Correct	80 ms	6208 KB	Output is correct
22	Incorrect	90 ms	6220 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

답안 #686765

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