oj.uz

Submission #54072

# Submission time Handle Problem Language Result Execution time Memory
54072 2018-07-02T09:40:21 Z Mahmoud_Adel Bali Sculptures (APIO15_sculpture) C++14
21 / 100
 55 ms 992 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update


#define f first
#define s second
#define pb push_back
#define mp make_pair
#define clr(dp,i) memset(dp,i,sizeof(dp))
#define opt     ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update> oset;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const long long mod = 1e9+7;
const ld pi = 3.14159265358979323846264338327950288;
//========================================
ll n, l, r, mx, sum[101], a[2001], dp[101][101], ans;
ll h = (1LL << 50) - 1;
bool sol(ll T)
{
	clr(dp, 0);
	dp[0][0] = 1;
	for(int j=1; j<=r; j++)
 	{
		for(int i=1; i<=n; i++)
		{
			ll tmp = 0;
			for(int k=0; k<=i; k++)
   			{
				ll enc = sum[i] - tmp;
				enc ^= h;
				bitset<6> b(enc&T);
				bitset<6> c(T);
				//cout << sum[i] << " " << tmp << " " << b << " " << c << endl;
				//cout << sum << " " << tmp << endl;
				if(dp[k][j-1] && (enc & T) == T)
				dp[i][j] = 1;
				tmp += a[k];
			}
		}
	}
	for(int j=l; j<=r; j++)
	{
		if(dp[n][j])
		return 1;
	}
	return 0;
}
int main()
{
	opt;
	cin >> n >> l >> r;
	for(int i=0; i<n; i++)
	cin >> a[i], sum[i+1] = sum[i] + a[i];
	for(int i=50; i>=0; i--)
	{
		if(sol((ans | (1LL << i))))
		ans |= (1LL << i);
	}
	cout << (ans^h) << endl;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 3 ms 568 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 3 ms 580 KB Output is correct
9 Correct 3 ms 580 KB Output is correct
10 Correct 3 ms 580 KB Output is correct
11 Correct 2 ms 580 KB Output is correct
12 Correct 2 ms 580 KB Output is correct
13 Correct 3 ms 580 KB Output is correct
14 Correct 2 ms 580 KB Output is correct
15 Incorrect 3 ms 580 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 608 KB Output is correct
2 Correct 2 ms 772 KB Output is correct
3 Correct 2 ms 772 KB Output is correct
4 Correct 2 ms 772 KB Output is correct
5 Correct 3 ms 772 KB Output is correct
6 Correct 2 ms 772 KB Output is correct
7 Correct 2 ms 772 KB Output is correct
8 Correct 3 ms 772 KB Output is correct
9 Correct 2 ms 772 KB Output is correct
10 Correct 2 ms 772 KB Output is correct
11 Correct 2 ms 772 KB Output is correct
12 Correct 2 ms 772 KB Output is correct
13 Correct 4 ms 772 KB Output is correct
14 Correct 3 ms 772 KB Output is correct
15 Incorrect 3 ms 804 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 808 KB Output is correct
2 Correct 2 ms 808 KB Output is correct
3 Correct 2 ms 808 KB Output is correct
4 Correct 3 ms 808 KB Output is correct
5 Correct 2 ms 808 KB Output is correct
6 Correct 2 ms 808 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 2 ms 808 KB Output is correct
9 Correct 3 ms 808 KB Output is correct
10 Correct 2 ms 808 KB Output is correct
11 Correct 2 ms 808 KB Output is correct
12 Correct 2 ms 808 KB Output is correct
13 Correct 3 ms 808 KB Output is correct
14 Correct 3 ms 808 KB Output is correct
15 Correct 3 ms 808 KB Output is correct
16 Correct 2 ms 808 KB Output is correct
17 Correct 4 ms 808 KB Output is correct
18 Correct 5 ms 808 KB Output is correct
19 Correct 5 ms 808 KB Output is correct
20 Correct 2 ms 808 KB Output is correct
21 Correct 6 ms 808 KB Output is correct
22 Correct 5 ms 808 KB Output is correct
23 Correct 4 ms 808 KB Output is correct
24 Correct 6 ms 808 KB Output is correct
25 Correct 5 ms 856 KB Output is correct
26 Correct 9 ms 856 KB Output is correct
27 Correct 27 ms 896 KB Output is correct
28 Correct 48 ms 896 KB Output is correct
29 Correct 48 ms 896 KB Output is correct
30 Correct 4 ms 896 KB Output is correct
31 Correct 27 ms 896 KB Output is correct
32 Correct 36 ms 896 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 4 ms 904 KB Output is correct
6 Correct 3 ms 904 KB Output is correct
7 Correct 2 ms 904 KB Output is correct
8 Correct 2 ms 904 KB Output is correct
9 Correct 2 ms 904 KB Output is correct
10 Correct 2 ms 904 KB Output is correct
11 Correct 2 ms 904 KB Output is correct
12 Correct 2 ms 904 KB Output is correct
13 Correct 3 ms 904 KB Output is correct
14 Correct 2 ms 904 KB Output is correct
15 Incorrect 2 ms 904 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 904 KB Output is correct
2 Correct 2 ms 904 KB Output is correct
3 Correct 2 ms 904 KB Output is correct
4 Correct 2 ms 904 KB Output is correct
5 Correct 3 ms 904 KB Output is correct
6 Correct 3 ms 904 KB Output is correct
7 Correct 2 ms 904 KB Output is correct
8 Correct 4 ms 904 KB Output is correct
9 Correct 3 ms 904 KB Output is correct
10 Correct 3 ms 904 KB Output is correct
11 Correct 3 ms 904 KB Output is correct
12 Correct 2 ms 904 KB Output is correct
13 Correct 2 ms 904 KB Output is correct
14 Correct 3 ms 904 KB Output is correct
15 Correct 2 ms 904 KB Output is correct
16 Correct 2 ms 904 KB Output is correct
17 Correct 2 ms 904 KB Output is correct
18 Correct 2 ms 904 KB Output is correct
19 Correct 2 ms 904 KB Output is correct
20 Correct 3 ms 904 KB Output is correct
21 Correct 3 ms 904 KB Output is correct
22 Correct 3 ms 904 KB Output is correct
23 Correct 3 ms 904 KB Output is correct
24 Correct 3 ms 904 KB Output is correct
25 Correct 4 ms 904 KB Output is correct
26 Correct 3 ms 904 KB Output is correct
27 Correct 5 ms 904 KB Output is correct
28 Correct 5 ms 904 KB Output is correct
29 Correct 5 ms 992 KB Output is correct
30 Correct 3 ms 992 KB Output is correct
31 Correct 6 ms 992 KB Output is correct
32 Correct 6 ms 992 KB Output is correct
33 Correct 5 ms 992 KB Output is correct
34 Correct 7 ms 992 KB Output is correct
35 Correct 5 ms 992 KB Output is correct
36 Correct 11 ms 992 KB Output is correct
37 Correct 24 ms 992 KB Output is correct
38 Correct 48 ms 992 KB Output is correct
39 Correct 55 ms 992 KB Output is correct
40 Correct 3 ms 992 KB Output is correct
41 Correct 25 ms 992 KB Output is correct
42 Correct 37 ms 992 KB Output is correct
43 Correct 8 ms 992 KB Output is correct
44 Correct 9 ms 992 KB Output is correct
45 Correct 24 ms 992 KB Output is correct
46 Correct 46 ms 992 KB Output is correct
47 Correct 46 ms 992 KB Output is correct
48 Correct 3 ms 992 KB Output is correct
49 Correct 49 ms 992 KB Output is correct
50 Correct 49 ms 992 KB Output is correct
51 Incorrect 10 ms 992 KB Output isn't correct
52 Halted 0 ms 0 KB -