oj.uz

Submission #236476

# Submission time Handle Problem Language Result Execution time Memory
236476 2020-06-02T11:17:24 Z maskoff Bootfall (IZhO17_bootfall) C++14
13 / 100
 149 ms 10744 KB 
#include <bits/stdc++.h>
#include <ext/rope>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
 
#define file ""
 
#define all(x) x.begin(), x.end()
 
#define sc second
#define fr first
 
#define pb push_back
#define mp make_pair
 
#define pss pair<line*, line*>
 
using namespace std;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
                                 
const ll inf = 1e18;
const int MOD = 1e9 + 7;
 
const int dx[] = {-1, +1, -2, +2, -2, +2, -1, +1};
const int dy[] = {-2, -2, -1, -1, +1, +1, +2, +2};
 
int const N = 5e3 + 5;
int const M = 2e6;

int main() {                 
#ifdef Mask                                                         
  freopen(".in", 	"r", stdin);
  freopen(".out", "w", stdout);  
#endif
	ios_base :: sync_with_stdio(false);               
  cin.tie(nullptr);
  int n;
  cin >> n;
  int sum = 0;
  int a[n + 1];
  for (int i = 1; i <= n; i++)
  	cin >> a[i], sum += a[i];
  int d[n + 1][sum + 10001];
  for (int i = 1; i <= n; i++)
  	for (int j = 0; j <= sum + 10000; j++)
  		d[i][j] = 0;

  for (int del = 0; del <= n; del++) {
  	int dp[n + 1][sum + 1];
  	
  	for (int i = 0; i <= n; i++)
  		for (int w = 0; w <= sum; w++)
  			dp[i][w] = 0;

  	dp[0][0] = 1;
   	
   	for (int i = 0; i < n; i++) {
   	 	for (int w = 0; w <= sum; w++) 
   	 		dp[i + 1][w] |= dp[i][w];

   	 	if (i + 1 == del)
   	 		continue;

   	 	for (int w = 0; w <= sum; w++) 
   	 		if (a[i + 1] + w <= sum)
   	 			dp[i + 1][w + a[i + 1]] |= dp[i][w];
   	}
   	for (int w = 0; w <= sum; w++)
   		if (dp[n][w] == 1)
   			d[del][w] = 1;	
  }

  vector<int> ans;
  for (int k = 1; k <= 5000; k++)  {
  	int ok = true;
  	for (int del = 0; del <= n; del++) {
  		int all = sum + k;
  		if (del == 0) all -= k;
  		else all -= a[del];
  		if (all % 2 == 1) {
  			ok = false;
  			break;
  		}
  		int need = all / 2;
  		if (d[del][need] == 0) {
  			ok = false;
  			break;
  		}
  	}
  	if (ok == true)
  		ans.pb(k);
  }
 	cout << ans.size() << endl;
 	for (int to : ans)
 		cout << to << " ";      
	return 0;
 
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 896 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 896 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 7 ms 1664 KB Output is correct
11 Correct 6 ms 1536 KB Output is correct
12 Correct 6 ms 1664 KB Output is correct
13 Correct 5 ms 1408 KB Output is correct
14 Correct 6 ms 1536 KB Output is correct
15 Correct 5 ms 1408 KB Output is correct
16 Correct 6 ms 1536 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1280 KB Output is correct
19 Correct 5 ms 1408 KB Output is correct
20 Correct 6 ms 1664 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 896 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 7 ms 1664 KB Output is correct
11 Correct 6 ms 1536 KB Output is correct
12 Correct 6 ms 1664 KB Output is correct
13 Correct 5 ms 1408 KB Output is correct
14 Correct 6 ms 1536 KB Output is correct
15 Correct 5 ms 1408 KB Output is correct
16 Correct 6 ms 1536 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1280 KB Output is correct
19 Correct 5 ms 1408 KB Output is correct
20 Correct 6 ms 1664 KB Output is correct
21 Correct 33 ms 4480 KB Output is correct
22 Correct 40 ms 5248 KB Output is correct
23 Correct 18 ms 3200 KB Output is correct
24 Correct 84 ms 7544 KB Output is correct
25 Incorrect 149 ms 10744 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 896 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 7 ms 1664 KB Output is correct
11 Correct 6 ms 1536 KB Output is correct
12 Correct 6 ms 1664 KB Output is correct
13 Correct 5 ms 1408 KB Output is correct
14 Correct 6 ms 1536 KB Output is correct
15 Correct 5 ms 1408 KB Output is correct
16 Correct 6 ms 1536 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1280 KB Output is correct
19 Correct 5 ms 1408 KB Output is correct
20 Correct 6 ms 1664 KB Output is correct
21 Correct 33 ms 4480 KB Output is correct
22 Correct 40 ms 5248 KB Output is correct
23 Correct 18 ms 3200 KB Output is correct
24 Correct 84 ms 7544 KB Output is correct
25 Incorrect 149 ms 10744 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 896 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 7 ms 1664 KB Output is correct
11 Correct 6 ms 1536 KB Output is correct
12 Correct 6 ms 1664 KB Output is correct
13 Correct 5 ms 1408 KB Output is correct
14 Correct 6 ms 1536 KB Output is correct
15 Correct 5 ms 1408 KB Output is correct
16 Correct 6 ms 1536 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1280 KB Output is correct
19 Correct 5 ms 1408 KB Output is correct
20 Correct 6 ms 1664 KB Output is correct
21 Correct 33 ms 4480 KB Output is correct
22 Correct 40 ms 5248 KB Output is correct
23 Correct 18 ms 3200 KB Output is correct
24 Correct 84 ms 7544 KB Output is correct
25 Incorrect 149 ms 10744 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 896 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 7 ms 1664 KB Output is correct
11 Correct 6 ms 1536 KB Output is correct
12 Correct 6 ms 1664 KB Output is correct
13 Correct 5 ms 1408 KB Output is correct
14 Correct 6 ms 1536 KB Output is correct
15 Correct 5 ms 1408 KB Output is correct
16 Correct 6 ms 1536 KB Output is correct
17 Correct 5 ms 1152 KB Output is correct
18 Correct 5 ms 1280 KB Output is correct
19 Correct 5 ms 1408 KB Output is correct
20 Correct 6 ms 1664 KB Output is correct
21 Correct 33 ms 4480 KB Output is correct
22 Correct 40 ms 5248 KB Output is correct
23 Correct 18 ms 3200 KB Output is correct
24 Correct 84 ms 7544 KB Output is correct
25 Incorrect 149 ms 10744 KB Output isn't correct
26 Halted 0 ms 0 KB -