oj.uz

답안 #406011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
406011 2021-05-17T06:29:58 Z codebuster_10 Bootfall (IZhO17_bootfall) C++17
100 / 100
 921 ms 31776 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, can, check, L[N], R[N];;
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;	
  }
  
  L[0][0] = 1;
  for(int i = 1; i < n; ++i){
  	L[i] = L[i-1] | (L[i-1] << a[i-1]);
  }
  
  R[n-1][0] = 1;
  for(int i = n-2; i >= 0; --i){
  	R[i] = R[i+1] | (R[i+1] << a[i+1]);
  }
  
  // optimization for to get runtime/2 
  for(int i = 0; i < n; ++i){
  	if(i < n/2){
  		now = R[i]; 
  		for(int j = 0; j < i; ++j){
  			now |= now << a[j];
  		}	
  	}else{
  		now = L[i];
  		for(int j = i+1; j < n; ++j){
  			now |= now << a[j];
  		}	
  	}
  	
  	int sum = total - a[i];
  	can = EMPTY;
  	for(int i = 0; i < N*N; ++i){
  		if(now[i]){
  			int j = abs(2*i - sum);
  			can[j] = true;
  		}
  	}
  	ans &= can;
  }
  cout << int(ans.count()) << endl;
  for(int i = 0; i < N*N; ++i){
  	if(ans[i]) cout << i << ' ' ;	
  }
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 5 ms 716 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 15 ms 2292 KB Output is correct
11 Correct 16 ms 2252 KB Output is correct
12 Correct 15 ms 2252 KB Output is correct
13 Correct 13 ms 1928 KB Output is correct
14 Correct 13 ms 2124 KB Output is correct
15 Correct 14 ms 2172 KB Output is correct
16 Correct 14 ms 2296 KB Output is correct
17 Correct 9 ms 1484 KB Output is correct
18 Correct 11 ms 1868 KB Output is correct
19 Correct 12 ms 2048 KB Output is correct
20 Correct 15 ms 2252 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 5 ms 716 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 15 ms 2292 KB Output is correct
11 Correct 16 ms 2252 KB Output is correct
12 Correct 15 ms 2252 KB Output is correct
13 Correct 13 ms 1928 KB Output is correct
14 Correct 13 ms 2124 KB Output is correct
15 Correct 14 ms 2172 KB Output is correct
16 Correct 14 ms 2296 KB Output is correct
17 Correct 9 ms 1484 KB Output is correct
18 Correct 11 ms 1868 KB Output is correct
19 Correct 12 ms 2048 KB Output is correct
20 Correct 15 ms 2252 KB Output is correct
21 Correct 34 ms 4376 KB Output is correct
22 Correct 42 ms 4992 KB Output is correct
23 Correct 25 ms 3532 KB Output is correct
24 Correct 70 ms 6200 KB Output is correct
25 Correct 59 ms 6220 KB Output is correct
26 Correct 60 ms 6584 KB Output is correct
27 Correct 63 ms 6576 KB Output is correct
28 Correct 59 ms 6588 KB Output is correct
29 Correct 61 ms 6588 KB Output is correct
30 Correct 70 ms 6576 KB Output is correct
31 Correct 60 ms 6576 KB Output is correct
32 Correct 60 ms 6572 KB Output is correct
33 Correct 59 ms 6476 KB Output is correct
34 Correct 59 ms 6576 KB Output is correct
35 Correct 59 ms 6572 KB Output is correct
36 Correct 74 ms 6576 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 5 ms 716 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 15 ms 2292 KB Output is correct
11 Correct 16 ms 2252 KB Output is correct
12 Correct 15 ms 2252 KB Output is correct
13 Correct 13 ms 1928 KB Output is correct
14 Correct 13 ms 2124 KB Output is correct
15 Correct 14 ms 2172 KB Output is correct
16 Correct 14 ms 2296 KB Output is correct
17 Correct 9 ms 1484 KB Output is correct
18 Correct 11 ms 1868 KB Output is correct
19 Correct 12 ms 2048 KB Output is correct
20 Correct 15 ms 2252 KB Output is correct
21 Correct 34 ms 4376 KB Output is correct
22 Correct 42 ms 4992 KB Output is correct
23 Correct 25 ms 3532 KB Output is correct
24 Correct 70 ms 6200 KB Output is correct
25 Correct 59 ms 6220 KB Output is correct
26 Correct 60 ms 6584 KB Output is correct
27 Correct 63 ms 6576 KB Output is correct
28 Correct 59 ms 6588 KB Output is correct
29 Correct 61 ms 6588 KB Output is correct
30 Correct 70 ms 6576 KB Output is correct
31 Correct 60 ms 6576 KB Output is correct
32 Correct 60 ms 6572 KB Output is correct
33 Correct 59 ms 6476 KB Output is correct
34 Correct 59 ms 6576 KB Output is correct
35 Correct 59 ms 6572 KB Output is correct
36 Correct 74 ms 6576 KB Output is correct
37 Correct 168 ms 12724 KB Output is correct
38 Correct 168 ms 12740 KB Output is correct
39 Correct 242 ms 15672 KB Output is correct
40 Correct 271 ms 17092 KB Output is correct
41 Correct 257 ms 17004 KB Output is correct
42 Correct 235 ms 15780 KB Output is correct
43 Correct 237 ms 15552 KB Output is correct
44 Correct 256 ms 15792 KB Output is correct
45 Correct 276 ms 15924 KB Output is correct
46 Correct 269 ms 17012 KB Output is correct
47 Correct 254 ms 15780 KB Output is correct
48 Correct 260 ms 15784 KB Output is correct
49 Correct 238 ms 15816 KB Output is correct
50 Correct 241 ms 15784 KB Output is correct
51 Correct 4 ms 332 KB Output is correct
52 Correct 296 ms 17140 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 5 ms 716 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 15 ms 2292 KB Output is correct
11 Correct 16 ms 2252 KB Output is correct
12 Correct 15 ms 2252 KB Output is correct
13 Correct 13 ms 1928 KB Output is correct
14 Correct 13 ms 2124 KB Output is correct
15 Correct 14 ms 2172 KB Output is correct
16 Correct 14 ms 2296 KB Output is correct
17 Correct 9 ms 1484 KB Output is correct
18 Correct 11 ms 1868 KB Output is correct
19 Correct 12 ms 2048 KB Output is correct
20 Correct 15 ms 2252 KB Output is correct
21 Correct 34 ms 4376 KB Output is correct
22 Correct 42 ms 4992 KB Output is correct
23 Correct 25 ms 3532 KB Output is correct
24 Correct 70 ms 6200 KB Output is correct
25 Correct 59 ms 6220 KB Output is correct
26 Correct 60 ms 6584 KB Output is correct
27 Correct 63 ms 6576 KB Output is correct
28 Correct 59 ms 6588 KB Output is correct
29 Correct 61 ms 6588 KB Output is correct
30 Correct 70 ms 6576 KB Output is correct
31 Correct 60 ms 6576 KB Output is correct
32 Correct 60 ms 6572 KB Output is correct
33 Correct 59 ms 6476 KB Output is correct
34 Correct 59 ms 6576 KB Output is correct
35 Correct 59 ms 6572 KB Output is correct
36 Correct 74 ms 6576 KB Output is correct
37 Correct 168 ms 12724 KB Output is correct
38 Correct 168 ms 12740 KB Output is correct
39 Correct 242 ms 15672 KB Output is correct
40 Correct 271 ms 17092 KB Output is correct
41 Correct 257 ms 17004 KB Output is correct
42 Correct 235 ms 15780 KB Output is correct
43 Correct 237 ms 15552 KB Output is correct
44 Correct 256 ms 15792 KB Output is correct
45 Correct 276 ms 15924 KB Output is correct
46 Correct 269 ms 17012 KB Output is correct
47 Correct 254 ms 15780 KB Output is correct
48 Correct 260 ms 15784 KB Output is correct
49 Correct 238 ms 15816 KB Output is correct
50 Correct 241 ms 15784 KB Output is correct
51 Correct 4 ms 332 KB Output is correct
52 Correct 296 ms 17140 KB Output is correct
53 Correct 324 ms 18980 KB Output is correct
54 Correct 422 ms 22056 KB Output is correct
55 Correct 457 ms 22184 KB Output is correct
56 Correct 344 ms 19396 KB Output is correct
57 Correct 457 ms 22188 KB Output is correct
58 Correct 435 ms 22056 KB Output is correct
59 Correct 441 ms 22132 KB Output is correct
60 Correct 5 ms 412 KB Output is correct
61 Correct 446 ms 22168 KB Output is correct
62 Correct 391 ms 20340 KB Output is correct
63 Correct 416 ms 20380 KB Output is correct
64 Correct 377 ms 19908 KB Output is correct
65 Correct 334 ms 19852 KB Output is correct
66 Correct 326 ms 19472 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 5 ms 716 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 15 ms 2292 KB Output is correct
11 Correct 16 ms 2252 KB Output is correct
12 Correct 15 ms 2252 KB Output is correct
13 Correct 13 ms 1928 KB Output is correct
14 Correct 13 ms 2124 KB Output is correct
15 Correct 14 ms 2172 KB Output is correct
16 Correct 14 ms 2296 KB Output is correct
17 Correct 9 ms 1484 KB Output is correct
18 Correct 11 ms 1868 KB Output is correct
19 Correct 12 ms 2048 KB Output is correct
20 Correct 15 ms 2252 KB Output is correct
21 Correct 34 ms 4376 KB Output is correct
22 Correct 42 ms 4992 KB Output is correct
23 Correct 25 ms 3532 KB Output is correct
24 Correct 70 ms 6200 KB Output is correct
25 Correct 59 ms 6220 KB Output is correct
26 Correct 60 ms 6584 KB Output is correct
27 Correct 63 ms 6576 KB Output is correct
28 Correct 59 ms 6588 KB Output is correct
29 Correct 61 ms 6588 KB Output is correct
30 Correct 70 ms 6576 KB Output is correct
31 Correct 60 ms 6576 KB Output is correct
32 Correct 60 ms 6572 KB Output is correct
33 Correct 59 ms 6476 KB Output is correct
34 Correct 59 ms 6576 KB Output is correct
35 Correct 59 ms 6572 KB Output is correct
36 Correct 74 ms 6576 KB Output is correct
37 Correct 168 ms 12724 KB Output is correct
38 Correct 168 ms 12740 KB Output is correct
39 Correct 242 ms 15672 KB Output is correct
40 Correct 271 ms 17092 KB Output is correct
41 Correct 257 ms 17004 KB Output is correct
42 Correct 235 ms 15780 KB Output is correct
43 Correct 237 ms 15552 KB Output is correct
44 Correct 256 ms 15792 KB Output is correct
45 Correct 276 ms 15924 KB Output is correct
46 Correct 269 ms 17012 KB Output is correct
47 Correct 254 ms 15780 KB Output is correct
48 Correct 260 ms 15784 KB Output is correct
49 Correct 238 ms 15816 KB Output is correct
50 Correct 241 ms 15784 KB Output is correct
51 Correct 4 ms 332 KB Output is correct
52 Correct 296 ms 17140 KB Output is correct
53 Correct 324 ms 18980 KB Output is correct
54 Correct 422 ms 22056 KB Output is correct
55 Correct 457 ms 22184 KB Output is correct
56 Correct 344 ms 19396 KB Output is correct
57 Correct 457 ms 22188 KB Output is correct
58 Correct 435 ms 22056 KB Output is correct
59 Correct 441 ms 22132 KB Output is correct
60 Correct 5 ms 412 KB Output is correct
61 Correct 446 ms 22168 KB Output is correct
62 Correct 391 ms 20340 KB Output is correct
63 Correct 416 ms 20380 KB Output is correct
64 Correct 377 ms 19908 KB Output is correct
65 Correct 334 ms 19852 KB Output is correct
66 Correct 326 ms 19472 KB Output is correct
67 Correct 541 ms 25124 KB Output is correct
68 Correct 6 ms 332 KB Output is correct
69 Correct 871 ms 31776 KB Output is correct
70 Correct 821 ms 31568 KB Output is correct
71 Correct 820 ms 31524 KB Output is correct
72 Correct 826 ms 31252 KB Output is correct
73 Correct 850 ms 31076 KB Output is correct
74 Correct 909 ms 31648 KB Output is correct
75 Correct 888 ms 31476 KB Output is correct
76 Correct 899 ms 31776 KB Output is correct
77 Correct 921 ms 31776 KB Output is correct