oj.uz

Submission #882876

# Submission time Handle Problem Language Result Execution time Memory
882876 2023-12-04T00:06:39 Z OAleksa Bali Sculptures (APIO15_sculpture) C++14
9 / 100
 354 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int maxn = 2010;
const int inf = 1e15;
int a[maxn], l, r, n, p[maxn];
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
   	cin >> n >> l >> r;
   	for (int i = 1;i <= n;i++)
   		cin >> a[i];
		for (int i = 1;i <= n;i++)
			p[i] = p[i - 1] + a[i];
   	int ans = (1ll << 41) - 1;
   	auto check = [&](int x) {
   		vector<int> dp[n + 1];
   		//dp[i][0] <= dp[i][1]
   		dp[0].push_back(0);
   		for (int i = 1;i <= n;i++) {
   			for (int j = i;j >= 1;j--) {
   				int sm = p[i] - p[j - 1];
   				if ((x & sm) == sm) {
   					for (auto u : dp[j - 1]) {
   						dp[i].push_back(u + 1);
   					}
   				}
   			}
   		}
   		int ok = 0;
   		for (auto u : dp[n])
   			ok |= (u >= l && u <= r);
   		return ok;
   	};
   	for (int i = 40;i >= 0;i--) {
   		if (check(ans - (1ll << i))) 
   			ans -= (1ll << i);
   	}
   	cout << ans;
	}
	return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:17:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   17 |     for (int i = 1;i <= n;i++)
      |     ^~~
sculpture.cpp:19:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   19 |   for (int i = 1;i <= n;i++)
      |   ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 840 KB Output is correct
7 Correct 20 ms 2056 KB Output is correct
8 Correct 172 ms 13316 KB Output is correct
9 Correct 168 ms 12788 KB Output is correct
10 Correct 160 ms 12816 KB Output is correct
11 Correct 158 ms 12960 KB Output is correct
12 Correct 163 ms 12844 KB Output is correct
13 Correct 151 ms 12848 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 18 ms 2056 KB Output is correct
21 Correct 182 ms 12840 KB Output is correct
22 Correct 180 ms 12804 KB Output is correct
23 Correct 145 ms 12840 KB Output is correct
24 Correct 145 ms 12844 KB Output is correct
25 Correct 161 ms 12860 KB Output is correct
26 Correct 158 ms 12848 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 19 ms 6648 KB Output is correct
31 Correct 37 ms 12860 KB Output is correct
32 Correct 37 ms 13100 KB Output is correct
33 Correct 62 ms 12800 KB Output is correct
34 Correct 53 ms 12836 KB Output is correct
35 Correct 102 ms 12848 KB Output is correct
36 Correct 88 ms 12872 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 952 KB Output is correct
7 Correct 16 ms 2056 KB Output is correct
8 Correct 148 ms 12792 KB Output is correct
9 Correct 162 ms 12880 KB Output is correct
10 Correct 168 ms 12804 KB Output is correct
11 Correct 155 ms 12856 KB Output is correct
12 Correct 169 ms 12820 KB Output is correct
13 Correct 177 ms 12828 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 4 ms 836 KB Output is correct
20 Correct 22 ms 2056 KB Output is correct
21 Correct 161 ms 12848 KB Output is correct
22 Correct 167 ms 12832 KB Output is correct
23 Correct 170 ms 12868 KB Output is correct
24 Correct 155 ms 13112 KB Output is correct
25 Correct 173 ms 12844 KB Output is correct
26 Correct 177 ms 12868 KB Output is correct
27 Correct 314 ms 27264 KB Output is correct
28 Runtime error 156 ms 262144 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 836 KB Output is correct
7 Correct 21 ms 2104 KB Output is correct
8 Correct 152 ms 12828 KB Output is correct
9 Correct 167 ms 12812 KB Output is correct
10 Correct 152 ms 12820 KB Output is correct
11 Correct 173 ms 13092 KB Output is correct
12 Correct 190 ms 12848 KB Output is correct
13 Correct 169 ms 12828 KB Output is correct
14 Correct 349 ms 25208 KB Output is correct
15 Runtime error 133 ms 262144 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 840 KB Output is correct
7 Correct 17 ms 2020 KB Output is correct
8 Correct 169 ms 12812 KB Output is correct
9 Correct 147 ms 12836 KB Output is correct
10 Correct 144 ms 12844 KB Output is correct
11 Correct 141 ms 12808 KB Output is correct
12 Correct 176 ms 12848 KB Output is correct
13 Correct 171 ms 12792 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 6 ms 1000 KB Output is correct
20 Correct 19 ms 2008 KB Output is correct
21 Correct 164 ms 12820 KB Output is correct
22 Correct 137 ms 12900 KB Output is correct
23 Correct 143 ms 12852 KB Output is correct
24 Correct 164 ms 12836 KB Output is correct
25 Correct 190 ms 12840 KB Output is correct
26 Correct 152 ms 12864 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 20 ms 6648 KB Output is correct
31 Correct 40 ms 12844 KB Output is correct
32 Correct 40 ms 12720 KB Output is correct
33 Correct 72 ms 12848 KB Output is correct
34 Correct 52 ms 12796 KB Output is correct
35 Correct 99 ms 12844 KB Output is correct
36 Correct 95 ms 12812 KB Output is correct
37 Correct 327 ms 27136 KB Output is correct
38 Runtime error 137 ms 262144 KB Execution killed with signal 9
39 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 984 KB Output is correct
7 Correct 17 ms 1800 KB Output is correct
8 Correct 164 ms 12844 KB Output is correct
9 Correct 188 ms 12980 KB Output is correct
10 Correct 174 ms 12860 KB Output is correct
11 Correct 164 ms 12916 KB Output is correct
12 Correct 170 ms 12908 KB Output is correct
13 Correct 171 ms 12796 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 24 ms 6672 KB Output is correct
18 Correct 41 ms 12828 KB Output is correct
19 Correct 41 ms 12824 KB Output is correct
20 Correct 57 ms 12772 KB Output is correct
21 Correct 61 ms 12884 KB Output is correct
22 Correct 102 ms 12836 KB Output is correct
23 Correct 107 ms 12840 KB Output is correct
24 Correct 354 ms 25324 KB Output is correct
25 Runtime error 130 ms 262144 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -