oj.uz

답안 #246432

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246432 2020-07-09T09:44:14 Z acm Bootfall (IZhO17_bootfall) C++14
65 / 100
 1000 ms 13452 KB 
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/rope>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
 #include <string>
#include <bits/functexcept.h>
#include <iosfwd>
#include <bits/cxxabi_forced.h>
#include <bits/functional_hash.h>

#pragma push_macro("__SIZEOF_LONG__")
#pragma push_macro("__cplusplus")
#define __SIZEOF_LONG__ __SIZEOF_LONG_LONG__
#define unsigned unsigned long
#define __cplusplus 201102L

#define __builtin_popcountl __builtin_popcountll
#define __builtin_ctzl __builtin_ctzll

#include <bitset>

#pragma pop_macro("__cplusplus")
#pragma pop_macro("__SIZEOF_LONG__")
#undef unsigned
#undef __builtin_popcountl
#undef __builtin_ctzl


#define file ""
 
#define all(x) x.begin(), x.end()
 
#define sc second
#define fr first
 
#define pb push_back
#define mp make_pair
 
#define pss pair<line*, line*>
 
using namespace std;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
                                 
const ll inf = 1e18;
const int MOD = 1e9 + 7;
 
const int dx[] = {-1, +1, -2, +2, -2, +2, -1, +1};
const int dy[] = {-2, -2, -1, -1, +1, +1, +2, +2};
 
int const N = 250001;
int const M = 2e6;
 
bitset<N> dp[505];
 
signed main() {                 
#ifdef Mask                                                         
  freopen(".in", 	"r", stdin);
  freopen(".out", "w", stdout);  
#endif
	ios_base :: sync_with_stdio(false);               
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n;
  cin >> n;
  int sum = 0;
  int a[n + 1];
  for (int i = 1; i <= n; i++)
  	cin >> a[i], sum += a[i];
 
  for (int del = 0; del <= n; del++) {
   	dp[del][0] = 1;
   	for (int i = 0; i < n; i++) {
   		if (i + 1 == del) 
   			continue;
   		dp[del] |= (dp[del] << a[i + 1]);
   	}                   
  }
  vector<int> ans;
  for (int k = 1; k <= 250000; k++)  {
  	bool ok = true;
  	for (int del = 0; del <= n; del++) {
  		int all = sum + k;
  		if (del == 0) all -= k;
  		else all -= a[del];
 
  		if (all % 2 == 1) {
  			ok = false;
  			break;
  		}
  		int need = all / 2;
  		if (need > N) {
  		 	ok = false;
  		 	break;
  		}
  			
  		if (dp[del][need] == 0) {
  			ok = false;
  			break;
  		}
  	}
  	if (ok == true)
  		ans.pb(k);
  }
 	cout << ans.size() << endl;
 	for (int to : ans)
 		cout << to << " ";      
	return 0;
 
}

Compilation message

bootfall.cpp:16:0: warning: "__SIZEOF_LONG__" redefined
 #define __SIZEOF_LONG__ __SIZEOF_LONG_LONG__
 
<built-in>: note: this is the location of the previous definition
bootfall.cpp:18:0: warning: "__cplusplus" redefined
 #define __cplusplus 201102L
 
<built-in>: note: this is the location of the previous definition

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 8 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 9 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 8 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 9 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 13 ms 1280 KB Output is correct
11 Correct 12 ms 1280 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 15 ms 1280 KB Output is correct
16 Correct 14 ms 1408 KB Output is correct
17 Correct 8 ms 1024 KB Output is correct
18 Correct 10 ms 1152 KB Output is correct
19 Correct 10 ms 1152 KB Output is correct
20 Correct 12 ms 1280 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 8 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 9 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 13 ms 1280 KB Output is correct
11 Correct 12 ms 1280 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 15 ms 1280 KB Output is correct
16 Correct 14 ms 1408 KB Output is correct
17 Correct 8 ms 1024 KB Output is correct
18 Correct 10 ms 1152 KB Output is correct
19 Correct 10 ms 1152 KB Output is correct
20 Correct 12 ms 1280 KB Output is correct
21 Correct 33 ms 2456 KB Output is correct
22 Correct 43 ms 2680 KB Output is correct
23 Correct 24 ms 2048 KB Output is correct
24 Correct 64 ms 3320 KB Output is correct
25 Correct 68 ms 3320 KB Output is correct
26 Correct 75 ms 3576 KB Output is correct
27 Correct 91 ms 3552 KB Output is correct
28 Correct 73 ms 3448 KB Output is correct
29 Correct 70 ms 3488 KB Output is correct
30 Correct 74 ms 3448 KB Output is correct
31 Correct 73 ms 3576 KB Output is correct
32 Correct 79 ms 3576 KB Output is correct
33 Correct 79 ms 3448 KB Output is correct
34 Correct 76 ms 3448 KB Output is correct
35 Correct 75 ms 3448 KB Output is correct
36 Correct 75 ms 3576 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 8 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 9 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 13 ms 1280 KB Output is correct
11 Correct 12 ms 1280 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 15 ms 1280 KB Output is correct
16 Correct 14 ms 1408 KB Output is correct
17 Correct 8 ms 1024 KB Output is correct
18 Correct 10 ms 1152 KB Output is correct
19 Correct 10 ms 1152 KB Output is correct
20 Correct 12 ms 1280 KB Output is correct
21 Correct 33 ms 2456 KB Output is correct
22 Correct 43 ms 2680 KB Output is correct
23 Correct 24 ms 2048 KB Output is correct
24 Correct 64 ms 3320 KB Output is correct
25 Correct 68 ms 3320 KB Output is correct
26 Correct 75 ms 3576 KB Output is correct
27 Correct 91 ms 3552 KB Output is correct
28 Correct 73 ms 3448 KB Output is correct
29 Correct 70 ms 3488 KB Output is correct
30 Correct 74 ms 3448 KB Output is correct
31 Correct 73 ms 3576 KB Output is correct
32 Correct 79 ms 3576 KB Output is correct
33 Correct 79 ms 3448 KB Output is correct
34 Correct 76 ms 3448 KB Output is correct
35 Correct 75 ms 3448 KB Output is correct
36 Correct 75 ms 3576 KB Output is correct
37 Correct 270 ms 6780 KB Output is correct
38 Correct 265 ms 6672 KB Output is correct
39 Correct 410 ms 8056 KB Output is correct
40 Correct 481 ms 8952 KB Output is correct
41 Correct 480 ms 8892 KB Output is correct
42 Correct 431 ms 8260 KB Output is correct
43 Correct 453 ms 8436 KB Output is correct
44 Correct 440 ms 8440 KB Output is correct
45 Correct 427 ms 8576 KB Output is correct
46 Correct 485 ms 8696 KB Output is correct
47 Correct 424 ms 8328 KB Output is correct
48 Correct 444 ms 8440 KB Output is correct
49 Correct 407 ms 8096 KB Output is correct
50 Correct 432 ms 8440 KB Output is correct
51 Correct 410 ms 8056 KB Output is correct
52 Correct 524 ms 9200 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 8 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 9 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 13 ms 1280 KB Output is correct
11 Correct 12 ms 1280 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 15 ms 1280 KB Output is correct
16 Correct 14 ms 1408 KB Output is correct
17 Correct 8 ms 1024 KB Output is correct
18 Correct 10 ms 1152 KB Output is correct
19 Correct 10 ms 1152 KB Output is correct
20 Correct 12 ms 1280 KB Output is correct
21 Correct 33 ms 2456 KB Output is correct
22 Correct 43 ms 2680 KB Output is correct
23 Correct 24 ms 2048 KB Output is correct
24 Correct 64 ms 3320 KB Output is correct
25 Correct 68 ms 3320 KB Output is correct
26 Correct 75 ms 3576 KB Output is correct
27 Correct 91 ms 3552 KB Output is correct
28 Correct 73 ms 3448 KB Output is correct
29 Correct 70 ms 3488 KB Output is correct
30 Correct 74 ms 3448 KB Output is correct
31 Correct 73 ms 3576 KB Output is correct
32 Correct 79 ms 3576 KB Output is correct
33 Correct 79 ms 3448 KB Output is correct
34 Correct 76 ms 3448 KB Output is correct
35 Correct 75 ms 3448 KB Output is correct
36 Correct 75 ms 3576 KB Output is correct
37 Correct 270 ms 6780 KB Output is correct
38 Correct 265 ms 6672 KB Output is correct
39 Correct 410 ms 8056 KB Output is correct
40 Correct 481 ms 8952 KB Output is correct
41 Correct 480 ms 8892 KB Output is correct
42 Correct 431 ms 8260 KB Output is correct
43 Correct 453 ms 8436 KB Output is correct
44 Correct 440 ms 8440 KB Output is correct
45 Correct 427 ms 8576 KB Output is correct
46 Correct 485 ms 8696 KB Output is correct
47 Correct 424 ms 8328 KB Output is correct
48 Correct 444 ms 8440 KB Output is correct
49 Correct 407 ms 8096 KB Output is correct
50 Correct 432 ms 8440 KB Output is correct
51 Correct 410 ms 8056 KB Output is correct
52 Correct 524 ms 9200 KB Output is correct
53 Correct 631 ms 10044 KB Output is correct
54 Correct 858 ms 11640 KB Output is correct
55 Correct 861 ms 11856 KB Output is correct
56 Correct 677 ms 10232 KB Output is correct
57 Correct 860 ms 11744 KB Output is correct
58 Correct 851 ms 11640 KB Output is correct
59 Correct 847 ms 11784 KB Output is correct
60 Correct 788 ms 11180 KB Output is correct
61 Correct 904 ms 11756 KB Output is correct
62 Correct 714 ms 10904 KB Output is correct
63 Correct 718 ms 11060 KB Output is correct
64 Correct 734 ms 10740 KB Output is correct
65 Correct 672 ms 10316 KB Output is correct
66 Correct 652 ms 10192 KB Output is correct

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 8 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 9 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 13 ms 1280 KB Output is correct
11 Correct 12 ms 1280 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 15 ms 1280 KB Output is correct
16 Correct 14 ms 1408 KB Output is correct
17 Correct 8 ms 1024 KB Output is correct
18 Correct 10 ms 1152 KB Output is correct
19 Correct 10 ms 1152 KB Output is correct
20 Correct 12 ms 1280 KB Output is correct
21 Correct 33 ms 2456 KB Output is correct
22 Correct 43 ms 2680 KB Output is correct
23 Correct 24 ms 2048 KB Output is correct
24 Correct 64 ms 3320 KB Output is correct
25 Correct 68 ms 3320 KB Output is correct
26 Correct 75 ms 3576 KB Output is correct
27 Correct 91 ms 3552 KB Output is correct
28 Correct 73 ms 3448 KB Output is correct
29 Correct 70 ms 3488 KB Output is correct
30 Correct 74 ms 3448 KB Output is correct
31 Correct 73 ms 3576 KB Output is correct
32 Correct 79 ms 3576 KB Output is correct
33 Correct 79 ms 3448 KB Output is correct
34 Correct 76 ms 3448 KB Output is correct
35 Correct 75 ms 3448 KB Output is correct
36 Correct 75 ms 3576 KB Output is correct
37 Correct 270 ms 6780 KB Output is correct
38 Correct 265 ms 6672 KB Output is correct
39 Correct 410 ms 8056 KB Output is correct
40 Correct 481 ms 8952 KB Output is correct
41 Correct 480 ms 8892 KB Output is correct
42 Correct 431 ms 8260 KB Output is correct
43 Correct 453 ms 8436 KB Output is correct
44 Correct 440 ms 8440 KB Output is correct
45 Correct 427 ms 8576 KB Output is correct
46 Correct 485 ms 8696 KB Output is correct
47 Correct 424 ms 8328 KB Output is correct
48 Correct 444 ms 8440 KB Output is correct
49 Correct 407 ms 8096 KB Output is correct
50 Correct 432 ms 8440 KB Output is correct
51 Correct 410 ms 8056 KB Output is correct
52 Correct 524 ms 9200 KB Output is correct
53 Correct 631 ms 10044 KB Output is correct
54 Correct 858 ms 11640 KB Output is correct
55 Correct 861 ms 11856 KB Output is correct
56 Correct 677 ms 10232 KB Output is correct
57 Correct 860 ms 11744 KB Output is correct
58 Correct 851 ms 11640 KB Output is correct
59 Correct 847 ms 11784 KB Output is correct
60 Correct 788 ms 11180 KB Output is correct
61 Correct 904 ms 11756 KB Output is correct
62 Correct 714 ms 10904 KB Output is correct
63 Correct 718 ms 11060 KB Output is correct
64 Correct 734 ms 10740 KB Output is correct
65 Correct 672 ms 10316 KB Output is correct
66 Correct 652 ms 10192 KB Output is correct
67 Execution timed out 1085 ms 13452 KB Time limit exceeded
68 Halted 0 ms 0 KB -