oj.uz

답안 #392911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
392911 2021-04-22T09:34:08 Z SoGood Bootfall (IZhO17_bootfall) C++17
28 / 100
 1000 ms 728 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];
bitset <500005> dp, ans;
main() {
  file("paint");
  ios;
  cin >> n;
  fo(i, 1, n, 1) cin >> a[i];
  fo(i, 0, 500000, 1) ans.set(i);
  fo(i, 1, n + 1, 1) {
    dp.reset();
    bool t = 0;
    fo(j, 1, n, 1) {
      if (i != j) {
        if (!t) {
          dp[250000+a[j]] = dp[250000-a[j]] = 1;
          t = 1;
          continue;
        }
        dp = ((dp << a[j]) | (dp >> a[j]));
      }
    }
    if (i == n + 1) {
      if (!dp.test(250000)) return !(cout << "0");
      break;
    }
    ans &= dp;
//    cerr << "CH " << ans.any() << "\n";
  }
  cout << ans.count() / 2 << "\n";
  fo(i, 250000, 500000, 1) if (ans.test(i)) cout << i - 250000 << " ";
  return 0;
}
/**
500000
250000

4
1 3 1 5

6
3 5 7 11 9 13

3
2 2 2
*/

Compilation message

bootfall.cpp:63:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | 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:64:3: note: in expansion of macro 'file'
   64 |   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:64:3: note: in expansion of macro 'file'
   64 |   file("paint");
      |   ^~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 7 ms 588 KB Output is correct
9 Correct 6 ms 588 KB Output is correct
10 Correct 37 ms 588 KB Output is correct
11 Correct 46 ms 604 KB Output is correct
12 Correct 36 ms 588 KB Output is correct
13 Correct 29 ms 588 KB Output is correct
14 Correct 32 ms 588 KB Output is correct
15 Correct 32 ms 588 KB Output is correct
16 Correct 36 ms 588 KB Output is correct
17 Correct 15 ms 588 KB Output is correct
18 Correct 24 ms 624 KB Output is correct
19 Correct 28 ms 604 KB Output is correct
20 Correct 36 ms 588 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 7 ms 588 KB Output is correct
9 Correct 6 ms 588 KB Output is correct
10 Correct 37 ms 588 KB Output is correct
11 Correct 46 ms 604 KB Output is correct
12 Correct 36 ms 588 KB Output is correct
13 Correct 29 ms 588 KB Output is correct
14 Correct 32 ms 588 KB Output is correct
15 Correct 32 ms 588 KB Output is correct
16 Correct 36 ms 588 KB Output is correct
17 Correct 15 ms 588 KB Output is correct
18 Correct 24 ms 624 KB Output is correct
19 Correct 28 ms 604 KB Output is correct
20 Correct 36 ms 588 KB Output is correct
21 Correct 159 ms 608 KB Output is correct
22 Correct 211 ms 608 KB Output is correct
23 Correct 98 ms 608 KB Output is correct
24 Correct 344 ms 608 KB Output is correct
25 Correct 347 ms 624 KB Output is correct
26 Correct 389 ms 620 KB Output is correct
27 Correct 387 ms 708 KB Output is correct
28 Correct 392 ms 728 KB Output is correct
29 Correct 392 ms 588 KB Output is correct
30 Correct 386 ms 616 KB Output is correct
31 Correct 385 ms 588 KB Output is correct
32 Correct 389 ms 608 KB Output is correct
33 Correct 384 ms 588 KB Output is correct
34 Correct 394 ms 608 KB Output is correct
35 Correct 394 ms 620 KB Output is correct
36 Correct 389 ms 588 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 7 ms 588 KB Output is correct
9 Correct 6 ms 588 KB Output is correct
10 Correct 37 ms 588 KB Output is correct
11 Correct 46 ms 604 KB Output is correct
12 Correct 36 ms 588 KB Output is correct
13 Correct 29 ms 588 KB Output is correct
14 Correct 32 ms 588 KB Output is correct
15 Correct 32 ms 588 KB Output is correct
16 Correct 36 ms 588 KB Output is correct
17 Correct 15 ms 588 KB Output is correct
18 Correct 24 ms 624 KB Output is correct
19 Correct 28 ms 604 KB Output is correct
20 Correct 36 ms 588 KB Output is correct
21 Correct 159 ms 608 KB Output is correct
22 Correct 211 ms 608 KB Output is correct
23 Correct 98 ms 608 KB Output is correct
24 Correct 344 ms 608 KB Output is correct
25 Correct 347 ms 624 KB Output is correct
26 Correct 389 ms 620 KB Output is correct
27 Correct 387 ms 708 KB Output is correct
28 Correct 392 ms 728 KB Output is correct
29 Correct 392 ms 588 KB Output is correct
30 Correct 386 ms 616 KB Output is correct
31 Correct 385 ms 588 KB Output is correct
32 Correct 389 ms 608 KB Output is correct
33 Correct 384 ms 588 KB Output is correct
34 Correct 394 ms 608 KB Output is correct
35 Correct 394 ms 620 KB Output is correct
36 Correct 389 ms 588 KB Output is correct
37 Execution timed out 1080 ms 592 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 7 ms 588 KB Output is correct
9 Correct 6 ms 588 KB Output is correct
10 Correct 37 ms 588 KB Output is correct
11 Correct 46 ms 604 KB Output is correct
12 Correct 36 ms 588 KB Output is correct
13 Correct 29 ms 588 KB Output is correct
14 Correct 32 ms 588 KB Output is correct
15 Correct 32 ms 588 KB Output is correct
16 Correct 36 ms 588 KB Output is correct
17 Correct 15 ms 588 KB Output is correct
18 Correct 24 ms 624 KB Output is correct
19 Correct 28 ms 604 KB Output is correct
20 Correct 36 ms 588 KB Output is correct
21 Correct 159 ms 608 KB Output is correct
22 Correct 211 ms 608 KB Output is correct
23 Correct 98 ms 608 KB Output is correct
24 Correct 344 ms 608 KB Output is correct
25 Correct 347 ms 624 KB Output is correct
26 Correct 389 ms 620 KB Output is correct
27 Correct 387 ms 708 KB Output is correct
28 Correct 392 ms 728 KB Output is correct
29 Correct 392 ms 588 KB Output is correct
30 Correct 386 ms 616 KB Output is correct
31 Correct 385 ms 588 KB Output is correct
32 Correct 389 ms 608 KB Output is correct
33 Correct 384 ms 588 KB Output is correct
34 Correct 394 ms 608 KB Output is correct
35 Correct 394 ms 620 KB Output is correct
36 Correct 389 ms 588 KB Output is correct
37 Execution timed out 1080 ms 592 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Correct 4 ms 588 KB Output is correct
8 Correct 7 ms 588 KB Output is correct
9 Correct 6 ms 588 KB Output is correct
10 Correct 37 ms 588 KB Output is correct
11 Correct 46 ms 604 KB Output is correct
12 Correct 36 ms 588 KB Output is correct
13 Correct 29 ms 588 KB Output is correct
14 Correct 32 ms 588 KB Output is correct
15 Correct 32 ms 588 KB Output is correct
16 Correct 36 ms 588 KB Output is correct
17 Correct 15 ms 588 KB Output is correct
18 Correct 24 ms 624 KB Output is correct
19 Correct 28 ms 604 KB Output is correct
20 Correct 36 ms 588 KB Output is correct
21 Correct 159 ms 608 KB Output is correct
22 Correct 211 ms 608 KB Output is correct
23 Correct 98 ms 608 KB Output is correct
24 Correct 344 ms 608 KB Output is correct
25 Correct 347 ms 624 KB Output is correct
26 Correct 389 ms 620 KB Output is correct
27 Correct 387 ms 708 KB Output is correct
28 Correct 392 ms 728 KB Output is correct
29 Correct 392 ms 588 KB Output is correct
30 Correct 386 ms 616 KB Output is correct
31 Correct 385 ms 588 KB Output is correct
32 Correct 389 ms 608 KB Output is correct
33 Correct 384 ms 588 KB Output is correct
34 Correct 394 ms 608 KB Output is correct
35 Correct 394 ms 620 KB Output is correct
36 Correct 389 ms 588 KB Output is correct
37 Execution timed out 1080 ms 592 KB Time limit exceeded
38 Halted 0 ms 0 KB -