oj.uz

Submission #523157

# Submission time Handle Problem Language Result Execution time Memory
523157 2022-02-07T06:54:24 Z mansur Bali Sculptures (APIO15_sculpture) C++17
50 / 100
 72 ms 348 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;        

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 5e3 + 1, mod = 998244353;                    

double eps = 1e-6;

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int n, a, b;

int y[N];

int f(int val) {
	int dp[n + 1];
	dp[0] = 0;
	for (int i = 1; i <= n; i++) {
		dp[i] = inf;
		int cur = 0;
		for (int j = i; j >= 1; j--) {
			cur += y[j - 1];
			if ((cur & val) == cur) {
				dp[i] = min(dp[j - 1] + 1, dp[i]);
			}
		}
	}
	return dp[n];
}

main() {                                                         
	//freopen("F.in", "r", stdin);                                                                                     
	//freopen("F.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                       
	cin.tie(NULL);
	cin >> n >> a >> b;
	int mx = 0;
	for (int i = 0; i < n; i++) {
		cin >> y[i];     
		mx = max(mx, y[i]);
	}
	if (n <= 1) {
		int ans = inf;
		for (int mask = 0; mask < (1 << (n - 1)); mask++) {
			int cnt = __builtin_popcount(mask) + 1;
			if (a <= cnt && cnt <= b) {
				int cur = 0, val = 0;
				for (int i = 0; i < n; i++) {
					cur += y[i];
					if (mask >> i & 1) {
					 	val |= cur;
					 	cur = 0;
					}	
				}
				val |= cur;
				ans = min(ans, val);
			}
		}
		cout << ans;
	}else if (n <= 1 && mx <= 10) {
		int dp[n + 1][n + 1][501];
		for (int i = 0; i <= n; i++) {
			for (int j = 0; j <= n; j++) {
				for (int v = 0; v <= 500; v++) dp[i][j][v] = inf;
			}
		}
		for (int v = 0; v <= 500; v++) dp[0][0][v] = v;
		for (int i = 1; i <= n; i++) {
			for (int bl = 1; bl <= i; bl++) {
				for (int v = 0; v <= 500; v++) {
					int cur = 0;
					for (int j = i; j >= 1; j--) {
						cur += y[j - 1];
						dp[i][bl][v] = min(dp[i][bl][v], dp[j - 1][bl - 1][v | cur]);					 	
					}	
				}
			}
		}
		int ans = inf;
		for (int i = a; i <= b; i++) ans = min(ans, dp[n][i][0]);
		cout << ans;
	}else if (a == 1) {
		int ans = 0, cur = (1ll << 40) - 1;
		for (int i = 39; i >= 0; i--) {
			if (f(cur) <= b) {
				cur -= (1ll << i);
			}else {
				cur += (1ll << (i + 1));
				cur -= (1ll << i);
			}
		}
		cout << cur + (f(cur) <= b ? 0 : 1);
	}
}

Compilation message

sculpture.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
sculpture.cpp:56:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   56 | main() {
      | ^~~~
sculpture.cpp: In function 'int main()':
sculpture.cpp:108:7: warning: unused variable 'ans' [-Wunused-variable]
  108 |   int ans = 0, cur = (1ll << 40) - 1;
      |       ^~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 316 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 320 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 316 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 6 ms 316 KB Output is correct
53 Correct 10 ms 320 KB Output is correct
54 Correct 18 ms 332 KB Output is correct
55 Correct 17 ms 324 KB Output is correct
56 Correct 62 ms 332 KB Output is correct
57 Correct 62 ms 344 KB Output is correct
58 Correct 54 ms 336 KB Output is correct
59 Correct 54 ms 348 KB Output is correct
60 Correct 65 ms 348 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 11 ms 328 KB Output is correct
63 Correct 19 ms 340 KB Output is correct
64 Correct 17 ms 324 KB Output is correct
65 Correct 30 ms 328 KB Output is correct
66 Correct 44 ms 332 KB Output is correct
67 Correct 58 ms 344 KB Output is correct
68 Correct 63 ms 340 KB Output is correct
69 Correct 72 ms 332 KB Output is correct