oj.uz

Submission #685233

# Submission time Handle Problem Language Result Execution time Memory
685233 2023-01-23T17:44:39 Z tolbi Bootfall (IZhO17_bootfall) C++17
28 / 100
 128 ms 8148 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
#define author tolbi
#include<bits/stdc++.h>
#define endl '\n'
#define int short
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define vint(x) vector<int> 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 revarr(x) reverse(x.begin(), x.end())
#define tol(bi) (1LL<<((int)(bi)))
#define INF LONG_LONG_MAX
using namespace std;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
const int MOD = 1e9+7;
int32_t main(){
	int T=1;
	int tno=0;
	if (!T) cin>>T;
	while (T-(tno++)){
		deci(n);
		vint(arr(n));
		cinarr(arr);
		int somma = 0; for (int i = 0; i < n; i++) somma+=arr[i];
		vector<vector<vector<bitset<350>>>> dp(2,vector<vector<bitset<350>>>(somma+1,vector<bitset<350>>(2)));
		for (int i = 0; i < n; ++i)
		{
			dp[0][0][1][i]=true;
		}
		bitset<350> bos;
		for (int node = 1; node <= n; node++){
			for (int crr = 0; crr <= somma; crr++){
				for (int flag = 0; flag < 2; flag++){
					dp[1][crr][flag]&=bos;
					if (!flag){
						dp[1][crr][flag][node-1]=true;
						dp[1][crr][flag]&=dp[0][crr][1];
					}
					if (abs(crr-arr[node-1])<=somma) dp[1][crr][flag]|=dp[0][abs(crr-arr[node-1])][flag];
					if (abs(crr+arr[node-1])<=somma) dp[1][crr][flag]|=dp[0][abs(crr+arr[node-1])][flag];
				}
			}
			swap(dp[0],dp[1]);
		}
		if (dp[0][0][1].count()==0){
			cout<<0<<endl;
			continue;
		}
		vector<int> say;
		for (int i = 1; i < somma; i++){
			if (dp[0][i][0].count()==n){
				say.push_back(i);
			}
		}
		cout<<say.size()<<endl;
		coutarr(say);
	}
}

Compilation message

bootfall.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
bootfall.cpp:27:20: warning: overflow in conversion from 'double' to 'short int' changes value from '1.000000007e+9' to '32767' [-Woverflow]
   27 | const int MOD = 1e9+7;
      |                 ~~~^~
bootfall.cpp: In function 'int32_t main()':
bootfall.cpp:63:27: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'short int' [-Wsign-compare]
   63 |    if (dp[0][i][0].count()==n){
      |        ~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 468 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 7 ms 1556 KB Output is correct
22 Correct 9 ms 1664 KB Output is correct
23 Correct 5 ms 1236 KB Output is correct
24 Correct 16 ms 2136 KB Output is correct
25 Correct 29 ms 3796 KB Output is correct
26 Correct 32 ms 4052 KB Output is correct
27 Correct 31 ms 3796 KB Output is correct
28 Correct 32 ms 4052 KB Output is correct
29 Correct 33 ms 4180 KB Output is correct
30 Correct 18 ms 2388 KB Output is correct
31 Correct 26 ms 3284 KB Output is correct
32 Correct 18 ms 2188 KB Output is correct
33 Correct 34 ms 4180 KB Output is correct
34 Correct 34 ms 4180 KB Output is correct
35 Correct 36 ms 4180 KB Output is correct
36 Correct 16 ms 2160 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 7 ms 1556 KB Output is correct
22 Correct 9 ms 1664 KB Output is correct
23 Correct 5 ms 1236 KB Output is correct
24 Correct 16 ms 2136 KB Output is correct
25 Correct 29 ms 3796 KB Output is correct
26 Correct 32 ms 4052 KB Output is correct
27 Correct 31 ms 3796 KB Output is correct
28 Correct 32 ms 4052 KB Output is correct
29 Correct 33 ms 4180 KB Output is correct
30 Correct 18 ms 2388 KB Output is correct
31 Correct 26 ms 3284 KB Output is correct
32 Correct 18 ms 2188 KB Output is correct
33 Correct 34 ms 4180 KB Output is correct
34 Correct 34 ms 4180 KB Output is correct
35 Correct 36 ms 4180 KB Output is correct
36 Correct 16 ms 2160 KB Output is correct
37 Correct 127 ms 8020 KB Output is correct
38 Correct 128 ms 8148 KB Output is correct
39 Runtime error 2 ms 468 KB Execution killed with signal 6
40 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 7 ms 1556 KB Output is correct
22 Correct 9 ms 1664 KB Output is correct
23 Correct 5 ms 1236 KB Output is correct
24 Correct 16 ms 2136 KB Output is correct
25 Correct 29 ms 3796 KB Output is correct
26 Correct 32 ms 4052 KB Output is correct
27 Correct 31 ms 3796 KB Output is correct
28 Correct 32 ms 4052 KB Output is correct
29 Correct 33 ms 4180 KB Output is correct
30 Correct 18 ms 2388 KB Output is correct
31 Correct 26 ms 3284 KB Output is correct
32 Correct 18 ms 2188 KB Output is correct
33 Correct 34 ms 4180 KB Output is correct
34 Correct 34 ms 4180 KB Output is correct
35 Correct 36 ms 4180 KB Output is correct
36 Correct 16 ms 2160 KB Output is correct
37 Correct 127 ms 8020 KB Output is correct
38 Correct 128 ms 8148 KB Output is correct
39 Runtime error 2 ms 468 KB Execution killed with signal 6
40 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 7 ms 1556 KB Output is correct
22 Correct 9 ms 1664 KB Output is correct
23 Correct 5 ms 1236 KB Output is correct
24 Correct 16 ms 2136 KB Output is correct
25 Correct 29 ms 3796 KB Output is correct
26 Correct 32 ms 4052 KB Output is correct
27 Correct 31 ms 3796 KB Output is correct
28 Correct 32 ms 4052 KB Output is correct
29 Correct 33 ms 4180 KB Output is correct
30 Correct 18 ms 2388 KB Output is correct
31 Correct 26 ms 3284 KB Output is correct
32 Correct 18 ms 2188 KB Output is correct
33 Correct 34 ms 4180 KB Output is correct
34 Correct 34 ms 4180 KB Output is correct
35 Correct 36 ms 4180 KB Output is correct
36 Correct 16 ms 2160 KB Output is correct
37 Correct 127 ms 8020 KB Output is correct
38 Correct 128 ms 8148 KB Output is correct
39 Runtime error 2 ms 468 KB Execution killed with signal 6
40 Halted 0 ms 0 KB -