oj.uz

답안 #393422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
393422 2021-04-23T12:03:35 Z SoGood Bootfall (IZhO17_bootfall) C++17
100 / 100
 535 ms 2916 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define pb push_back
#define F first
#define S second
#define ins insert
#define mp make_pair
#define fo(i, n1, n, x) for(int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for(int i = n; i >= n1; i -= x)
#define bit __builtin_popcount
#define md (l + ((r - l) / 2))
#define all(x) x.begin(),x.end()
#define eb emplace_back
#define ub upper_bound
#define lb lower_bound
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)

using namespace std;
//using namespace __gnu_pbds;
//using namespace __gnu_cxx;


using ll = long long;

//#define int ll

using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;



const int N = 2e5 + 11, mod = 1e9 + 7, mod2 = 998244353;
const int MAX = 1e5 + 11;
const int INF1 = 2e9 + 11;
const ll INF2 = 6e18 + 11;
const double INF3 = 1e8 + 11;
const int base = 500;
const int P = 31;
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
const double EPS = 1e-4;
const double PI = acos(-1.0);


//template<typename T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r) { return uniform_int_distribution<int> (l, r)(rng); }

int n, a[555], pref[555], sum[555], cnt[500005], dp[500005], ans;
main() {
  file("paint");
  ios;
  cin >> n;
  fo(i, 1, n, 1) cin >> a[i], pref[i] = pref[i - 1] + a[i];
  fo(i, 1, n, 1) sum[i] = pref[i - 1] + pref[n] - pref[i];
  dp[0] = 1;
  fo(i, 1, n, 1) {
    foo(j, pref[n], a[i], 1) {
      dp[j] += dp[j - a[i]];
    }
  }
  if (pref[n] % 2 || !dp[pref[n]/2]) return !(cout << 0);
  fo(i, 1, n, 1) {
    fo(j, a[i], pref[n], 1) dp[j] -= dp[j - a[i]];
    fo(j, 0, pref[n], 1) {
      if (dp[j]) {
        int left = sum[i] - j;
        if (left >= j)
        ++cnt[left-j];
        if (cnt[left-j] == n) ++ans;
      }
    }
    foo(j, pref[n], a[i], 1) dp[j] += dp[j - a[i]];
  }
  cout << ans << "\n";
  fo(i, 0, pref[n], 1) if (cnt[i] == n) cout << i << " ";
  return 0;
}
/**
500000
250000

4
1 3 1 5

6
3 5 7 11 9 13

3
2 2 2
*/

Compilation message

bootfall.cpp:62:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   62 | main() {
      |      ^
bootfall.cpp: In function 'int main()':
bootfall.cpp:23:48: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   23 | #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
      |                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
bootfall.cpp:63:3: note: in expansion of macro 'file'
   63 |   file("paint");
      |   ^~~~
bootfall.cpp:23:77: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   23 | #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
      |                                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:63:3: note: in expansion of macro 'file'
   63 |   file("paint");
      |   ^~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 4 ms 332 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 3 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 4 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 332 KB Output is correct
34 Correct 3 ms 332 KB Output is correct
35 Correct 4 ms 332 KB Output is correct
36 Correct 3 ms 332 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 4 ms 332 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 3 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 4 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 332 KB Output is correct
34 Correct 3 ms 332 KB Output is correct
35 Correct 4 ms 332 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 19 ms 496 KB Output is correct
38 Correct 20 ms 496 KB Output is correct
39 Correct 35 ms 716 KB Output is correct
40 Correct 43 ms 588 KB Output is correct
41 Correct 44 ms 896 KB Output is correct
42 Correct 39 ms 564 KB Output is correct
43 Correct 68 ms 804 KB Output is correct
44 Correct 65 ms 904 KB Output is correct
45 Correct 66 ms 904 KB Output is correct
46 Correct 28 ms 600 KB Output is correct
47 Correct 40 ms 716 KB Output is correct
48 Correct 67 ms 836 KB Output is correct
49 Correct 51 ms 836 KB Output is correct
50 Correct 39 ms 588 KB Output is correct
51 Correct 5 ms 332 KB Output is correct
52 Correct 82 ms 1012 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 4 ms 332 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 3 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 4 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 332 KB Output is correct
34 Correct 3 ms 332 KB Output is correct
35 Correct 4 ms 332 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 19 ms 496 KB Output is correct
38 Correct 20 ms 496 KB Output is correct
39 Correct 35 ms 716 KB Output is correct
40 Correct 43 ms 588 KB Output is correct
41 Correct 44 ms 896 KB Output is correct
42 Correct 39 ms 564 KB Output is correct
43 Correct 68 ms 804 KB Output is correct
44 Correct 65 ms 904 KB Output is correct
45 Correct 66 ms 904 KB Output is correct
46 Correct 28 ms 600 KB Output is correct
47 Correct 40 ms 716 KB Output is correct
48 Correct 67 ms 836 KB Output is correct
49 Correct 51 ms 836 KB Output is correct
50 Correct 39 ms 588 KB Output is correct
51 Correct 5 ms 332 KB Output is correct
52 Correct 82 ms 1012 KB Output is correct
53 Correct 64 ms 808 KB Output is correct
54 Correct 90 ms 836 KB Output is correct
55 Correct 174 ms 1444 KB Output is correct
56 Correct 82 ms 964 KB Output is correct
57 Correct 198 ms 1504 KB Output is correct
58 Correct 101 ms 944 KB Output is correct
59 Correct 123 ms 1056 KB Output is correct
60 Correct 13 ms 460 KB Output is correct
61 Correct 145 ms 1220 KB Output is correct
62 Correct 142 ms 1348 KB Output is correct
63 Correct 152 ms 1400 KB Output is correct
64 Correct 150 ms 1380 KB Output is correct
65 Correct 35 ms 716 KB Output is correct
66 Correct 42 ms 672 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 4 ms 332 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 3 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 4 ms 332 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 3 ms 332 KB Output is correct
34 Correct 3 ms 332 KB Output is correct
35 Correct 4 ms 332 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 19 ms 496 KB Output is correct
38 Correct 20 ms 496 KB Output is correct
39 Correct 35 ms 716 KB Output is correct
40 Correct 43 ms 588 KB Output is correct
41 Correct 44 ms 896 KB Output is correct
42 Correct 39 ms 564 KB Output is correct
43 Correct 68 ms 804 KB Output is correct
44 Correct 65 ms 904 KB Output is correct
45 Correct 66 ms 904 KB Output is correct
46 Correct 28 ms 600 KB Output is correct
47 Correct 40 ms 716 KB Output is correct
48 Correct 67 ms 836 KB Output is correct
49 Correct 51 ms 836 KB Output is correct
50 Correct 39 ms 588 KB Output is correct
51 Correct 5 ms 332 KB Output is correct
52 Correct 82 ms 1012 KB Output is correct
53 Correct 64 ms 808 KB Output is correct
54 Correct 90 ms 836 KB Output is correct
55 Correct 174 ms 1444 KB Output is correct
56 Correct 82 ms 964 KB Output is correct
57 Correct 198 ms 1504 KB Output is correct
58 Correct 101 ms 944 KB Output is correct
59 Correct 123 ms 1056 KB Output is correct
60 Correct 13 ms 460 KB Output is correct
61 Correct 145 ms 1220 KB Output is correct
62 Correct 142 ms 1348 KB Output is correct
63 Correct 152 ms 1400 KB Output is correct
64 Correct 150 ms 1380 KB Output is correct
65 Correct 35 ms 716 KB Output is correct
66 Correct 42 ms 672 KB Output is correct
67 Correct 149 ms 1080 KB Output is correct
68 Correct 37 ms 716 KB Output is correct
69 Correct 483 ms 2628 KB Output is correct
70 Correct 313 ms 1684 KB Output is correct
71 Correct 287 ms 1596 KB Output is correct
72 Correct 282 ms 1216 KB Output is correct
73 Correct 283 ms 1308 KB Output is correct
74 Correct 510 ms 2760 KB Output is correct
75 Correct 399 ms 2120 KB Output is correct
76 Correct 530 ms 2884 KB Output is correct
77 Correct 535 ms 2916 KB Output is correct