oj.uz

Submission #405970

# Submission time Handle Problem Language Result Execution time Memory
405970 2021-05-17T05:56:00 Z codebuster_10 Bootfall (IZhO17_bootfall) C++17
65 / 100
 1000 ms 836 KB 
#include <bits/stdc++.h>

using namespace std ;

#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)

#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue

#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}

void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #define __f(...) 0
  #endif
}
const int N = 500 + 1;
bitset<N*N> ans, EMPTY, now, is, can, check;
signed main(){
  setIO() ;
  int n; rd(n);
  vt<int> a(n);
  for(auto& i : a) cin >> i;
  int total = accumulate(all(a),0);
  
  {
  	check[0] = true;
  	for(auto i : a){
  		check |= check << i;
  	}
  	if(total%2 == 1 || !check[total/2]){
  		cout << 0; exit(0);
  	}
  }
  
  for(int i = 0; i < N*N; ++i){
  	ans[i] = true;	
  }
  
  is[0] = true;
  for(int i = 0; i < n; ++i){
  	now = is;
  	for(int j = i+1; j < n; ++j){
  		now |= now << a[j];
  	}	
  	int sum = total - a[i];
  	can = EMPTY;
  	for(int i = now._Find_first(); i < int(now.size()); i = now._Find_next(i)){
  		int j = abs(2*i - sum);
  		can[j] = true;
  	}
  	ans &= can;
  	is |= is << a[i];
  }
  cout << int(ans.count()) << endl;
  for(int i = 0; i < N*N; ++i){
  	if(ans[i]) cout << i << ' ' ;	
  }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 500 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 500 KB Output is correct
10 Correct 8 ms 460 KB Output is correct
11 Correct 8 ms 536 KB Output is correct
12 Correct 8 ms 532 KB Output is correct
13 Correct 6 ms 532 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 6 ms 520 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 5 ms 460 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 6 ms 504 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 500 KB Output is correct
10 Correct 8 ms 460 KB Output is correct
11 Correct 8 ms 536 KB Output is correct
12 Correct 8 ms 532 KB Output is correct
13 Correct 6 ms 532 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 6 ms 520 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 5 ms 460 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 29 ms 508 KB Output is correct
22 Correct 39 ms 524 KB Output is correct
23 Correct 19 ms 532 KB Output is correct
24 Correct 58 ms 524 KB Output is correct
25 Correct 46 ms 524 KB Output is correct
26 Correct 51 ms 528 KB Output is correct
27 Correct 51 ms 516 KB Output is correct
28 Correct 48 ms 460 KB Output is correct
29 Correct 50 ms 512 KB Output is correct
30 Correct 51 ms 612 KB Output is correct
31 Correct 53 ms 512 KB Output is correct
32 Correct 51 ms 508 KB Output is correct
33 Correct 63 ms 512 KB Output is correct
34 Correct 45 ms 460 KB Output is correct
35 Correct 48 ms 516 KB Output is correct
36 Correct 50 ms 524 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 500 KB Output is correct
10 Correct 8 ms 460 KB Output is correct
11 Correct 8 ms 536 KB Output is correct
12 Correct 8 ms 532 KB Output is correct
13 Correct 6 ms 532 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 6 ms 520 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 5 ms 460 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 29 ms 508 KB Output is correct
22 Correct 39 ms 524 KB Output is correct
23 Correct 19 ms 532 KB Output is correct
24 Correct 58 ms 524 KB Output is correct
25 Correct 46 ms 524 KB Output is correct
26 Correct 51 ms 528 KB Output is correct
27 Correct 51 ms 516 KB Output is correct
28 Correct 48 ms 460 KB Output is correct
29 Correct 50 ms 512 KB Output is correct
30 Correct 51 ms 612 KB Output is correct
31 Correct 53 ms 512 KB Output is correct
32 Correct 51 ms 508 KB Output is correct
33 Correct 63 ms 512 KB Output is correct
34 Correct 45 ms 460 KB Output is correct
35 Correct 48 ms 516 KB Output is correct
36 Correct 50 ms 524 KB Output is correct
37 Correct 220 ms 516 KB Output is correct
38 Correct 202 ms 512 KB Output is correct
39 Correct 304 ms 480 KB Output is correct
40 Correct 409 ms 516 KB Output is correct
41 Correct 350 ms 544 KB Output is correct
42 Correct 378 ms 512 KB Output is correct
43 Correct 395 ms 640 KB Output is correct
44 Correct 390 ms 652 KB Output is correct
45 Correct 380 ms 640 KB Output is correct
46 Correct 353 ms 516 KB Output is correct
47 Correct 334 ms 512 KB Output is correct
48 Correct 362 ms 516 KB Output is correct
49 Correct 323 ms 528 KB Output is correct
50 Correct 339 ms 512 KB Output is correct
51 Correct 4 ms 332 KB Output is correct
52 Correct 447 ms 644 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 500 KB Output is correct
10 Correct 8 ms 460 KB Output is correct
11 Correct 8 ms 536 KB Output is correct
12 Correct 8 ms 532 KB Output is correct
13 Correct 6 ms 532 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 6 ms 520 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 5 ms 460 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 29 ms 508 KB Output is correct
22 Correct 39 ms 524 KB Output is correct
23 Correct 19 ms 532 KB Output is correct
24 Correct 58 ms 524 KB Output is correct
25 Correct 46 ms 524 KB Output is correct
26 Correct 51 ms 528 KB Output is correct
27 Correct 51 ms 516 KB Output is correct
28 Correct 48 ms 460 KB Output is correct
29 Correct 50 ms 512 KB Output is correct
30 Correct 51 ms 612 KB Output is correct
31 Correct 53 ms 512 KB Output is correct
32 Correct 51 ms 508 KB Output is correct
33 Correct 63 ms 512 KB Output is correct
34 Correct 45 ms 460 KB Output is correct
35 Correct 48 ms 516 KB Output is correct
36 Correct 50 ms 524 KB Output is correct
37 Correct 220 ms 516 KB Output is correct
38 Correct 202 ms 512 KB Output is correct
39 Correct 304 ms 480 KB Output is correct
40 Correct 409 ms 516 KB Output is correct
41 Correct 350 ms 544 KB Output is correct
42 Correct 378 ms 512 KB Output is correct
43 Correct 395 ms 640 KB Output is correct
44 Correct 390 ms 652 KB Output is correct
45 Correct 380 ms 640 KB Output is correct
46 Correct 353 ms 516 KB Output is correct
47 Correct 334 ms 512 KB Output is correct
48 Correct 362 ms 516 KB Output is correct
49 Correct 323 ms 528 KB Output is correct
50 Correct 339 ms 512 KB Output is correct
51 Correct 4 ms 332 KB Output is correct
52 Correct 447 ms 644 KB Output is correct
53 Correct 498 ms 644 KB Output is correct
54 Correct 684 ms 648 KB Output is correct
55 Correct 826 ms 772 KB Output is correct
56 Correct 573 ms 640 KB Output is correct
57 Correct 850 ms 776 KB Output is correct
58 Correct 687 ms 644 KB Output is correct
59 Correct 803 ms 708 KB Output is correct
60 Correct 5 ms 332 KB Output is correct
61 Correct 741 ms 640 KB Output is correct
62 Correct 670 ms 708 KB Output is correct
63 Correct 668 ms 836 KB Output is correct
64 Correct 645 ms 788 KB Output is correct
65 Correct 434 ms 460 KB Output is correct
66 Correct 434 ms 516 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 500 KB Output is correct
10 Correct 8 ms 460 KB Output is correct
11 Correct 8 ms 536 KB Output is correct
12 Correct 8 ms 532 KB Output is correct
13 Correct 6 ms 532 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 6 ms 520 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 5 ms 460 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 29 ms 508 KB Output is correct
22 Correct 39 ms 524 KB Output is correct
23 Correct 19 ms 532 KB Output is correct
24 Correct 58 ms 524 KB Output is correct
25 Correct 46 ms 524 KB Output is correct
26 Correct 51 ms 528 KB Output is correct
27 Correct 51 ms 516 KB Output is correct
28 Correct 48 ms 460 KB Output is correct
29 Correct 50 ms 512 KB Output is correct
30 Correct 51 ms 612 KB Output is correct
31 Correct 53 ms 512 KB Output is correct
32 Correct 51 ms 508 KB Output is correct
33 Correct 63 ms 512 KB Output is correct
34 Correct 45 ms 460 KB Output is correct
35 Correct 48 ms 516 KB Output is correct
36 Correct 50 ms 524 KB Output is correct
37 Correct 220 ms 516 KB Output is correct
38 Correct 202 ms 512 KB Output is correct
39 Correct 304 ms 480 KB Output is correct
40 Correct 409 ms 516 KB Output is correct
41 Correct 350 ms 544 KB Output is correct
42 Correct 378 ms 512 KB Output is correct
43 Correct 395 ms 640 KB Output is correct
44 Correct 390 ms 652 KB Output is correct
45 Correct 380 ms 640 KB Output is correct
46 Correct 353 ms 516 KB Output is correct
47 Correct 334 ms 512 KB Output is correct
48 Correct 362 ms 516 KB Output is correct
49 Correct 323 ms 528 KB Output is correct
50 Correct 339 ms 512 KB Output is correct
51 Correct 4 ms 332 KB Output is correct
52 Correct 447 ms 644 KB Output is correct
53 Correct 498 ms 644 KB Output is correct
54 Correct 684 ms 648 KB Output is correct
55 Correct 826 ms 772 KB Output is correct
56 Correct 573 ms 640 KB Output is correct
57 Correct 850 ms 776 KB Output is correct
58 Correct 687 ms 644 KB Output is correct
59 Correct 803 ms 708 KB Output is correct
60 Correct 5 ms 332 KB Output is correct
61 Correct 741 ms 640 KB Output is correct
62 Correct 670 ms 708 KB Output is correct
63 Correct 668 ms 836 KB Output is correct
64 Correct 645 ms 788 KB Output is correct
65 Correct 434 ms 460 KB Output is correct
66 Correct 434 ms 516 KB Output is correct
67 Correct 914 ms 652 KB Output is correct
68 Correct 6 ms 332 KB Output is correct
69 Execution timed out 1081 ms 480 KB Time limit exceeded
70 Halted 0 ms 0 KB -