oj.uz

Submission #41422

# Submission time Handle Problem Language Result Execution time Memory
41422 2018-02-17T08:08:59 Z cmaster Bali Sculptures (APIO15_sculpture) C++14
21 / 100
 1000 ms 748 KB 
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>*/
 
#define pb push_back
#define mp make_pair
#define sz(s) ((int)(s.size()))
#define all(s) s.begin(), s.end()
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --i)
#define onlycin ios_base::sync_with_stdio(false); cin.tie(0) 
#define F first
#define S second
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
/*typedef tree<
pair < int, int >,
null_type,
less< pair < int, int > >,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;*/
// find_by_order() order_of_key()
const int MAXN = (int)5e5+228;
const char nxtl = '\n';
const int mod = (int)1e9+7;
const double eps = (double)1e-7;
template<typename T> inline bool updmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<typename T> inline bool updmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}

int n, l, r, a[MAXN];
int dp[MAXN];

inline bool check(ll lim, ll mid, ll MOD, ll tmp) {
	dp[0] = 0;
	rep(i, 1, n) {
		ll cur = 0ll;
		dp[i] = n+n;
		per(j, i, 1) {
			cur += a[j];
			if(cur >= lim) break;
			if(cur % MOD < mid && (cur & tmp) == 0ll)
				updmin(dp[i], dp[j-1]+1);
		}
		// cerr << dp[i] << ' ';
	}
	return dp[n] <= r;
}

int main() {
	#ifdef accepted
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif
	onlycin;
	cin >> n >> l >> r;
	rep(i, 1, n) cin >> a[i];
	int last = 42, fr = 42;
	ll res = 0ll;
	ll just = 0ll;
	per(bit, 40, 0) {
		ll lim = (1ll << fr*1ll);
		if(last == 42) lim = (1ll << bit);
		if(!check(lim, (1ll<<bit*1ll), (1ll << last*1ll), just)) {
			if(fr == 42) fr = bit+1;
			// cerr << bit << nxtl;
			res |= (1ll << bit*1ll);
			last = bit;
		} else just |= (1ll << bit*1ll);
	}
	cout << res << nxtl;
	
	return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 1 ms 552 KB Output is correct
5 Correct 1 ms 552 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 552 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 2 ms 552 KB Output is correct
10 Correct 2 ms 552 KB Output is correct
11 Correct 2 ms 552 KB Output is correct
12 Correct 2 ms 676 KB Output is correct
13 Correct 2 ms 676 KB Output is correct
14 Correct 1 ms 676 KB Output is correct
15 Incorrect 1 ms 676 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 676 KB Output is correct
2 Correct 2 ms 676 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 1 ms 676 KB Output is correct
5 Correct 1 ms 676 KB Output is correct
6 Correct 1 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 2 ms 676 KB Output is correct
11 Correct 2 ms 676 KB Output is correct
12 Correct 2 ms 676 KB Output is correct
13 Correct 2 ms 676 KB Output is correct
14 Correct 1 ms 676 KB Output is correct
15 Incorrect 2 ms 676 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 2 ms 676 KB Output is correct
2 Correct 2 ms 676 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 1 ms 676 KB Output is correct
5 Correct 1 ms 676 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 1 ms 676 KB Output is correct
11 Correct 2 ms 676 KB Output is correct
12 Correct 2 ms 676 KB Output is correct
13 Correct 1 ms 676 KB Output is correct
14 Correct 2 ms 676 KB Output is correct
15 Correct 2 ms 676 KB Output is correct
16 Correct 2 ms 676 KB Output is correct
17 Correct 2 ms 676 KB Output is correct
18 Correct 2 ms 676 KB Output is correct
19 Correct 3 ms 676 KB Output is correct
20 Correct 2 ms 676 KB Output is correct
21 Correct 2 ms 676 KB Output is correct
22 Correct 2 ms 676 KB Output is correct
23 Correct 2 ms 676 KB Output is correct
24 Correct 3 ms 676 KB Output is correct
25 Correct 3 ms 676 KB Output is correct
26 Correct 4 ms 676 KB Output is correct
27 Correct 3 ms 676 KB Output is correct
28 Correct 4 ms 676 KB Output is correct
29 Correct 5 ms 676 KB Output is correct
30 Correct 4 ms 676 KB Output is correct
31 Correct 5 ms 676 KB Output is correct
32 Correct 4 ms 676 KB Output is correct

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 720 KB Output is correct
2 Correct 1 ms 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 2 ms 720 KB Output is correct
8 Correct 2 ms 720 KB Output is correct
9 Correct 2 ms 720 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 2 ms 720 KB Output is correct
12 Correct 2 ms 720 KB Output is correct
13 Correct 2 ms 720 KB Output is correct
14 Correct 1 ms 720 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 2 ms 720 KB Output is correct
17 Correct 2 ms 720 KB Output is correct
18 Correct 1 ms 720 KB Output is correct
19 Correct 2 ms 720 KB Output is correct
20 Correct 2 ms 720 KB Output is correct
21 Correct 2 ms 720 KB Output is correct
22 Correct 2 ms 720 KB Output is correct
23 Correct 2 ms 720 KB Output is correct
24 Correct 2 ms 720 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 2 ms 728 KB Output is correct
30 Correct 2 ms 728 KB Output is correct
31 Correct 2 ms 728 KB Output is correct
32 Correct 2 ms 728 KB Output is correct
33 Correct 2 ms 728 KB Output is correct
34 Correct 2 ms 728 KB Output is correct
35 Correct 3 ms 728 KB Output is correct
36 Correct 5 ms 728 KB Output is correct
37 Correct 4 ms 728 KB Output is correct
38 Correct 4 ms 728 KB Output is correct
39 Correct 4 ms 728 KB Output is correct
40 Correct 4 ms 728 KB Output is correct
41 Correct 4 ms 728 KB Output is correct
42 Correct 4 ms 728 KB Output is correct
43 Correct 2 ms 728 KB Output is correct
44 Correct 2 ms 728 KB Output is correct
45 Correct 3 ms 728 KB Output is correct
46 Correct 3 ms 728 KB Output is correct
47 Correct 3 ms 728 KB Output is correct
48 Correct 5 ms 728 KB Output is correct
49 Correct 4 ms 728 KB Output is correct
50 Correct 3 ms 728 KB Output is correct
51 Correct 3 ms 728 KB Output is correct
52 Correct 23 ms 728 KB Output is correct
53 Correct 21 ms 728 KB Output is correct
54 Correct 84 ms 728 KB Output is correct
55 Correct 55 ms 728 KB Output is correct
56 Correct 98 ms 748 KB Output is correct
57 Correct 83 ms 748 KB Output is correct
58 Correct 55 ms 748 KB Output is correct
59 Correct 53 ms 748 KB Output is correct
60 Execution timed out 1064 ms 748 KB Time limit exceeded
61 Halted 0 ms 0 KB -