Submission #882680

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
882680	2023-12-03T12:59:38 Z	vjudge1	Bali Sculptures (APIO15_sculpture)	C++17	71 / 100	1000 ms	77584 KB

sculpture

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
template<size_t sz> struct cbitset{
	unsigned int arr[(sz+59)/60];
	int tot = (sz+59)/60;
	int get(){
		return arr[tot-1]&1;
	}
	void set(int ind){
		arr[tot-1-ind/60]|=1LL<<(ind%60);
	}
	cbitset kaydir(int x, int hh){
		cbitset<sz> nc;
		for (int i = 0; i < hh; ++i){
			int el = tot-1-i;
			nc.arr[el]=arr[el]>>1;
			if (el && arr[el-1]&1) nc.arr[el]|=1LL<<59;
		}
		return nc;
	}
	void mamama(cbitset<sz> bs, int hh){
		for (int i = 0; i < hh; ++i)
		{
			arr[tot-i-1]|=bs.arr[tot-i-1];
		}
	}
};
int32_t main(){
	ios;
	int t=1;
	int tno = 0;
	if (!t) cin>>t;
	while (t-(tno++)){
		deci(n);deci(a);deci(b);
		vint(arr(n));
		cinarr(arr);
		vector<int> pref = arr;
		for (int i = 1; i < n; i++){
			pref[i]+=pref[i-1];
		}
		function<int(int,int)> query = [&](int l, int r)->int{
			int hh = 0;
			if (l) hh = pref[l-1];
			return pref[r]-hh;
		};
		int rans = 0;
		int ans = 0;
		vector<vector<cbitset<2001>>> dp(n+1);
		for (int i = 0; i <= n; ++i)
		{
			dp[i].resize(i+1);
		}
		for (int i = a; i <= b; i++){
			dp[n][n].set(i);
		}
		int LOG = 47;
		for (int bit = LOG-1; bit >= 0; bit--){
			ans+=tol(bit);
			rans+=tol(bit);
			for (int l = n-1; l >= 0; l--){
				for (int r = n-1; r >= l; r--){
					dp[r][l]=dp[r+1][l];
					if (!(query(l,r)&rans)){
						dp[r][l].mamama(dp[r+1][r+1].kaydir(1,(r+1+59)/60),(r+1+59)/60);
					}
				}
			}
			if (dp[0][0].get()) ans-=tol(bit);
			else rans-=tol(bit);
		}
		cout<<ans<<endl;
	}
}

Compilation message

sculpture.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      |

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 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	0 ms	348 KB	Output is correct
18	Correct	0 ms	460 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	456 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	456 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct

Subtask #2
16.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	460 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 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	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	716 KB	Output is correct
31	Correct	3 ms	604 KB	Output is correct
32	Correct	3 ms	604 KB	Output is correct
33	Correct	3 ms	604 KB	Output is correct
34	Correct	3 ms	604 KB	Output is correct
35	Correct	4 ms	1056 KB	Output is correct
36	Correct	3 ms	856 KB	Output is correct

Subtask #3
21.0 / 21.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	1 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	604 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	3 ms	604 KB	Output is correct
19	Correct	4 ms	828 KB	Output is correct
20	Correct	3 ms	604 KB	Output is correct
21	Correct	3 ms	600 KB	Output is correct
22	Correct	3 ms	604 KB	Output is correct
23	Correct	3 ms	600 KB	Output is correct
24	Correct	3 ms	604 KB	Output is correct
25	Correct	4 ms	860 KB	Output is correct
26	Correct	6 ms	1328 KB	Output is correct
27	Correct	9 ms	1628 KB	Output is correct
28	Correct	10 ms	1628 KB	Output is correct
29	Correct	10 ms	1868 KB	Output is correct
30	Correct	10 ms	1628 KB	Output is correct
31	Correct	10 ms	1628 KB	Output is correct
32	Correct	10 ms	1876 KB	Output is correct

Subtask #4
25.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	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	456 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	468 KB	Output is correct
15	Correct	0 ms	460 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	460 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	600 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	520 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	2 ms	604 KB	Output is correct
40	Correct	2 ms	604 KB	Output is correct
41	Correct	3 ms	604 KB	Output is correct
42	Correct	3 ms	604 KB	Output is correct
43	Correct	3 ms	824 KB	Output is correct
44	Correct	3 ms	604 KB	Output is correct
45	Correct	3 ms	604 KB	Output is correct
46	Correct	4 ms	824 KB	Output is correct
47	Correct	3 ms	604 KB	Output is correct
48	Correct	5 ms	856 KB	Output is correct
49	Correct	6 ms	1112 KB	Output is correct
50	Correct	8 ms	1628 KB	Output is correct
51	Correct	10 ms	1628 KB	Output is correct
52	Correct	10 ms	1872 KB	Output is correct
53	Correct	10 ms	1628 KB	Output is correct
54	Correct	10 ms	1872 KB	Output is correct
55	Correct	11 ms	1624 KB	Output is correct
56	Correct	2 ms	600 KB	Output is correct
57	Correct	6 ms	1116 KB	Output is correct
58	Correct	8 ms	1628 KB	Output is correct
59	Correct	7 ms	1628 KB	Output is correct
60	Correct	7 ms	1628 KB	Output is correct
61	Correct	8 ms	1628 KB	Output is correct
62	Correct	8 ms	1872 KB	Output is correct
63	Correct	8 ms	1788 KB	Output is correct
64	Correct	9 ms	1372 KB	Output is correct
65	Correct	3 ms	840 KB	Output is correct
66	Correct	4 ms	856 KB	Output is correct
67	Correct	6 ms	1116 KB	Output is correct
68	Correct	6 ms	1624 KB	Output is correct
69	Correct	12 ms	1628 KB	Output is correct
70	Correct	8 ms	1628 KB	Output is correct
71	Correct	7 ms	1872 KB	Output is correct
72	Correct	8 ms	1628 KB	Output is correct
73	Correct	8 ms	1880 KB	Output is correct
74	Correct	8 ms	1876 KB	Output is correct

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	500 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	500 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	596 KB	Output is correct
26	Correct	2 ms	672 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	3 ms	604 KB	Output is correct
29	Correct	3 ms	824 KB	Output is correct
30	Correct	3 ms	604 KB	Output is correct
31	Correct	3 ms	600 KB	Output is correct
32	Correct	4 ms	604 KB	Output is correct
33	Correct	3 ms	820 KB	Output is correct
34	Correct	3 ms	604 KB	Output is correct
35	Correct	4 ms	860 KB	Output is correct
36	Correct	6 ms	1112 KB	Output is correct
37	Correct	10 ms	1628 KB	Output is correct
38	Correct	10 ms	1628 KB	Output is correct
39	Correct	13 ms	1860 KB	Output is correct
40	Correct	11 ms	1628 KB	Output is correct
41	Correct	11 ms	1624 KB	Output is correct
42	Correct	11 ms	1868 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	5 ms	1116 KB	Output is correct
45	Correct	6 ms	1372 KB	Output is correct
46	Correct	7 ms	1624 KB	Output is correct
47	Correct	7 ms	1624 KB	Output is correct
48	Correct	7 ms	1628 KB	Output is correct
49	Correct	8 ms	1880 KB	Output is correct
50	Correct	8 ms	1628 KB	Output is correct
51	Correct	10 ms	1900 KB	Output is correct
52	Correct	859 ms	46228 KB	Output is correct
53	Execution timed out	1069 ms	77584 KB	Time limit exceeded
54	Halted	0 ms	0 KB	-

Submission #882680

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 25.0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
25.0 / 25.0

Subtask #5
0 / 29.0