oj.uz

Submission #406041

# Submission time Handle Problem Language Result Execution time Memory
406041 2021-05-17T06:59:21 Z codebuster_10 Bootfall (IZhO17_bootfall) C++17
65 / 100
 1000 ms 31108 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 = now._Find_first(); i < int(now.size()); i = now._Find_next(i)){
  		int j = abs(2*i - sum);
  		can[j] = true;
  	}
  	ans &= can;
  }
  cout << int(ans.count()) << endl;
  for(int i = ans._Find_first(); i < int(ans.size()); i = ans._Find_next(i)){
  		cout << i << ' ';
  }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 1100 KB Output is correct
9 Correct 2 ms 972 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 1100 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 5 ms 2252 KB Output is correct
11 Correct 6 ms 2252 KB Output is correct
12 Correct 5 ms 2252 KB Output is correct
13 Correct 5 ms 2052 KB Output is correct
14 Correct 5 ms 2124 KB Output is correct
15 Correct 5 ms 2124 KB Output is correct
16 Correct 5 ms 2204 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 4 ms 1868 KB Output is correct
19 Correct 5 ms 1996 KB Output is correct
20 Correct 6 ms 2252 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 1100 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 5 ms 2252 KB Output is correct
11 Correct 6 ms 2252 KB Output is correct
12 Correct 5 ms 2252 KB Output is correct
13 Correct 5 ms 2052 KB Output is correct
14 Correct 5 ms 2124 KB Output is correct
15 Correct 5 ms 2124 KB Output is correct
16 Correct 5 ms 2204 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 4 ms 1868 KB Output is correct
19 Correct 5 ms 1996 KB Output is correct
20 Correct 6 ms 2252 KB Output is correct
21 Correct 16 ms 4388 KB Output is correct
22 Correct 23 ms 4996 KB Output is correct
23 Correct 11 ms 3532 KB Output is correct
24 Correct 30 ms 6228 KB Output is correct
25 Correct 31 ms 6220 KB Output is correct
26 Correct 35 ms 6476 KB Output is correct
27 Correct 32 ms 6476 KB Output is correct
28 Correct 33 ms 6596 KB Output is correct
29 Correct 33 ms 6476 KB Output is correct
30 Correct 34 ms 6544 KB Output is correct
31 Correct 36 ms 6588 KB Output is correct
32 Correct 34 ms 6580 KB Output is correct
33 Correct 29 ms 6476 KB Output is correct
34 Correct 30 ms 6476 KB Output is correct
35 Correct 32 ms 6592 KB Output is correct
36 Correct 34 ms 6584 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 1100 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 5 ms 2252 KB Output is correct
11 Correct 6 ms 2252 KB Output is correct
12 Correct 5 ms 2252 KB Output is correct
13 Correct 5 ms 2052 KB Output is correct
14 Correct 5 ms 2124 KB Output is correct
15 Correct 5 ms 2124 KB Output is correct
16 Correct 5 ms 2204 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 4 ms 1868 KB Output is correct
19 Correct 5 ms 1996 KB Output is correct
20 Correct 6 ms 2252 KB Output is correct
21 Correct 16 ms 4388 KB Output is correct
22 Correct 23 ms 4996 KB Output is correct
23 Correct 11 ms 3532 KB Output is correct
24 Correct 30 ms 6228 KB Output is correct
25 Correct 31 ms 6220 KB Output is correct
26 Correct 35 ms 6476 KB Output is correct
27 Correct 32 ms 6476 KB Output is correct
28 Correct 33 ms 6596 KB Output is correct
29 Correct 33 ms 6476 KB Output is correct
30 Correct 34 ms 6544 KB Output is correct
31 Correct 36 ms 6588 KB Output is correct
32 Correct 34 ms 6580 KB Output is correct
33 Correct 29 ms 6476 KB Output is correct
34 Correct 30 ms 6476 KB Output is correct
35 Correct 32 ms 6592 KB Output is correct
36 Correct 34 ms 6584 KB Output is correct
37 Correct 131 ms 12688 KB Output is correct
38 Correct 132 ms 12740 KB Output is correct
39 Correct 161 ms 15656 KB Output is correct
40 Correct 242 ms 17016 KB Output is correct
41 Correct 176 ms 17012 KB Output is correct
42 Correct 217 ms 15800 KB Output is correct
43 Correct 243 ms 15548 KB Output is correct
44 Correct 247 ms 15800 KB Output is correct
45 Correct 264 ms 15908 KB Output is correct
46 Correct 208 ms 17056 KB Output is correct
47 Correct 219 ms 15816 KB Output is correct
48 Correct 244 ms 15800 KB Output is correct
49 Correct 209 ms 15784 KB Output is correct
50 Correct 217 ms 15788 KB Output is correct
51 Correct 3 ms 332 KB Output is correct
52 Correct 307 ms 17092 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 1100 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 5 ms 2252 KB Output is correct
11 Correct 6 ms 2252 KB Output is correct
12 Correct 5 ms 2252 KB Output is correct
13 Correct 5 ms 2052 KB Output is correct
14 Correct 5 ms 2124 KB Output is correct
15 Correct 5 ms 2124 KB Output is correct
16 Correct 5 ms 2204 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 4 ms 1868 KB Output is correct
19 Correct 5 ms 1996 KB Output is correct
20 Correct 6 ms 2252 KB Output is correct
21 Correct 16 ms 4388 KB Output is correct
22 Correct 23 ms 4996 KB Output is correct
23 Correct 11 ms 3532 KB Output is correct
24 Correct 30 ms 6228 KB Output is correct
25 Correct 31 ms 6220 KB Output is correct
26 Correct 35 ms 6476 KB Output is correct
27 Correct 32 ms 6476 KB Output is correct
28 Correct 33 ms 6596 KB Output is correct
29 Correct 33 ms 6476 KB Output is correct
30 Correct 34 ms 6544 KB Output is correct
31 Correct 36 ms 6588 KB Output is correct
32 Correct 34 ms 6580 KB Output is correct
33 Correct 29 ms 6476 KB Output is correct
34 Correct 30 ms 6476 KB Output is correct
35 Correct 32 ms 6592 KB Output is correct
36 Correct 34 ms 6584 KB Output is correct
37 Correct 131 ms 12688 KB Output is correct
38 Correct 132 ms 12740 KB Output is correct
39 Correct 161 ms 15656 KB Output is correct
40 Correct 242 ms 17016 KB Output is correct
41 Correct 176 ms 17012 KB Output is correct
42 Correct 217 ms 15800 KB Output is correct
43 Correct 243 ms 15548 KB Output is correct
44 Correct 247 ms 15800 KB Output is correct
45 Correct 264 ms 15908 KB Output is correct
46 Correct 208 ms 17056 KB Output is correct
47 Correct 219 ms 15816 KB Output is correct
48 Correct 244 ms 15800 KB Output is correct
49 Correct 209 ms 15784 KB Output is correct
50 Correct 217 ms 15788 KB Output is correct
51 Correct 3 ms 332 KB Output is correct
52 Correct 307 ms 17092 KB Output is correct
53 Correct 319 ms 19072 KB Output is correct
54 Correct 440 ms 22072 KB Output is correct
55 Correct 572 ms 22216 KB Output is correct
56 Correct 347 ms 19356 KB Output is correct
57 Correct 572 ms 22176 KB Output is correct
58 Correct 451 ms 22084 KB Output is correct
59 Correct 489 ms 22056 KB Output is correct
60 Correct 4 ms 332 KB Output is correct
61 Correct 511 ms 22072 KB Output is correct
62 Correct 465 ms 20420 KB Output is correct
63 Correct 488 ms 20340 KB Output is correct
64 Correct 461 ms 19912 KB Output is correct
65 Correct 238 ms 19796 KB Output is correct
66 Correct 254 ms 19532 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 1100 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 5 ms 2252 KB Output is correct
11 Correct 6 ms 2252 KB Output is correct
12 Correct 5 ms 2252 KB Output is correct
13 Correct 5 ms 2052 KB Output is correct
14 Correct 5 ms 2124 KB Output is correct
15 Correct 5 ms 2124 KB Output is correct
16 Correct 5 ms 2204 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 4 ms 1868 KB Output is correct
19 Correct 5 ms 1996 KB Output is correct
20 Correct 6 ms 2252 KB Output is correct
21 Correct 16 ms 4388 KB Output is correct
22 Correct 23 ms 4996 KB Output is correct
23 Correct 11 ms 3532 KB Output is correct
24 Correct 30 ms 6228 KB Output is correct
25 Correct 31 ms 6220 KB Output is correct
26 Correct 35 ms 6476 KB Output is correct
27 Correct 32 ms 6476 KB Output is correct
28 Correct 33 ms 6596 KB Output is correct
29 Correct 33 ms 6476 KB Output is correct
30 Correct 34 ms 6544 KB Output is correct
31 Correct 36 ms 6588 KB Output is correct
32 Correct 34 ms 6580 KB Output is correct
33 Correct 29 ms 6476 KB Output is correct
34 Correct 30 ms 6476 KB Output is correct
35 Correct 32 ms 6592 KB Output is correct
36 Correct 34 ms 6584 KB Output is correct
37 Correct 131 ms 12688 KB Output is correct
38 Correct 132 ms 12740 KB Output is correct
39 Correct 161 ms 15656 KB Output is correct
40 Correct 242 ms 17016 KB Output is correct
41 Correct 176 ms 17012 KB Output is correct
42 Correct 217 ms 15800 KB Output is correct
43 Correct 243 ms 15548 KB Output is correct
44 Correct 247 ms 15800 KB Output is correct
45 Correct 264 ms 15908 KB Output is correct
46 Correct 208 ms 17056 KB Output is correct
47 Correct 219 ms 15816 KB Output is correct
48 Correct 244 ms 15800 KB Output is correct
49 Correct 209 ms 15784 KB Output is correct
50 Correct 217 ms 15788 KB Output is correct
51 Correct 3 ms 332 KB Output is correct
52 Correct 307 ms 17092 KB Output is correct
53 Correct 319 ms 19072 KB Output is correct
54 Correct 440 ms 22072 KB Output is correct
55 Correct 572 ms 22216 KB Output is correct
56 Correct 347 ms 19356 KB Output is correct
57 Correct 572 ms 22176 KB Output is correct
58 Correct 451 ms 22084 KB Output is correct
59 Correct 489 ms 22056 KB Output is correct
60 Correct 4 ms 332 KB Output is correct
61 Correct 511 ms 22072 KB Output is correct
62 Correct 465 ms 20420 KB Output is correct
63 Correct 488 ms 20340 KB Output is correct
64 Correct 461 ms 19912 KB Output is correct
65 Correct 238 ms 19796 KB Output is correct
66 Correct 254 ms 19532 KB Output is correct
67 Correct 621 ms 25128 KB Output is correct
68 Correct 5 ms 332 KB Output is correct
69 Execution timed out 1095 ms 31108 KB Time limit exceeded
70 Halted 0 ms 0 KB -