Submission #882468

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
882468	2023-12-03T08:41:23 Z	vjudge1	Bali Sculptures (APIO15_sculpture)	C++17	25 / 100	25 ms	3160 KB

sculpture

#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2", "popcnt")
#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+63)/64];
	int tot = (sz+63)/64;
	int get(){
		return arr[tot-1]&1;
	}
	void set(int ind){
		arr[tot-1-ind/64]|=1LL<<(ind%64);
	}
	cbitset operator>>(int x){
		cbitset<sz> nc;
		for (int i = 0; i < tot; ++i)
		{
			nc.arr[i]=arr[i]>>1;
			if (i && arr[i-1]&1) nc.arr[i-1]|=1LL<<63;
		}
		return nc;
	}
	void operator|=(cbitset<sz> bs){
		for (int i = 0; i < tot; ++i)
		{
			arr[i]|=bs.arr[i];
		}
	}
};
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,vector<cbitset<2001>>(n+1));
		for (int i = a; i <= b; i++){
			dp[n][n].set(i);
		}
		int LOG = 60;
		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[l][r]=dp[l][r+1];
					if (!(query(l,r)&rans)){
						dp[l][r]|=dp[r+1][r+1]>>1;
					}
				}
			}
			if (dp[0][0].get()) ans-=tol(bit);
			else rans-=tol(bit);
		}
		cout<<ans<<endl;
	}
}

Compilation message

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

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 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	576 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	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	344 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	344 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	348 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	360 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	344 KB	Output is correct
34	Correct	2 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	756 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	1 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	544 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	2 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	0 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	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	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	3 ms	860 KB	Output is correct
30	Correct	4 ms	860 KB	Output is correct
31	Correct	5 ms	1116 KB	Output is correct
32	Correct	5 ms	1116 KB	Output is correct
33	Correct	5 ms	1116 KB	Output is correct
34	Correct	5 ms	1116 KB	Output is correct
35	Correct	5 ms	1116 KB	Output is correct
36	Correct	6 ms	1148 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	600 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	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	572 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	2 ms	348 KB	Output is correct
15	Correct	3 ms	420 KB	Output is correct
16	Correct	4 ms	860 KB	Output is correct
17	Correct	4 ms	860 KB	Output is correct
18	Correct	5 ms	1116 KB	Output is correct
19	Correct	5 ms	1140 KB	Output is correct
20	Correct	5 ms	1144 KB	Output is correct
21	Correct	6 ms	1112 KB	Output is correct
22	Correct	5 ms	1116 KB	Output is correct
23	Correct	5 ms	1116 KB	Output is correct
24	Correct	5 ms	1116 KB	Output is correct
25	Correct	9 ms	1372 KB	Output is correct
26	Correct	12 ms	1884 KB	Output is correct
27	Correct	17 ms	2652 KB	Output is correct
28	Correct	24 ms	2908 KB	Output is correct
29	Incorrect	20 ms	3160 KB	Output isn't correct
30	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	1 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	344 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	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	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	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	348 KB	Output is correct
24	Correct	2 ms	348 KB	Output is correct
25	Correct	1 ms	360 KB	Output is correct
26	Correct	2 ms	348 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	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	344 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	3 ms	604 KB	Output is correct
40	Correct	4 ms	944 KB	Output is correct
41	Correct	5 ms	1116 KB	Output is correct
42	Correct	5 ms	1116 KB	Output is correct
43	Correct	6 ms	1112 KB	Output is correct
44	Correct	5 ms	1112 KB	Output is correct
45	Correct	5 ms	1116 KB	Output is correct
46	Correct	6 ms	1116 KB	Output is correct
47	Correct	6 ms	1116 KB	Output is correct
48	Correct	9 ms	1372 KB	Output is correct
49	Correct	12 ms	1880 KB	Output is correct
50	Correct	18 ms	2668 KB	Output is correct
51	Correct	21 ms	3116 KB	Output is correct
52	Incorrect	20 ms	3120 KB	Output isn't correct
53	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	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	2 ms	348 KB	Output is correct
10	Correct	1 ms	600 KB	Output is correct
11	Correct	1 ms	576 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 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	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	2 ms	604 KB	Output is correct
26	Correct	3 ms	860 KB	Output is correct
27	Correct	4 ms	860 KB	Output is correct
28	Correct	5 ms	1148 KB	Output is correct
29	Correct	5 ms	1372 KB	Output is correct
30	Correct	5 ms	1112 KB	Output is correct
31	Correct	7 ms	1116 KB	Output is correct
32	Correct	7 ms	1116 KB	Output is correct
33	Correct	5 ms	1140 KB	Output is correct
34	Correct	7 ms	1304 KB	Output is correct
35	Correct	9 ms	1368 KB	Output is correct
36	Correct	12 ms	1884 KB	Output is correct
37	Correct	17 ms	2652 KB	Output is correct
38	Correct	25 ms	2908 KB	Output is correct
39	Incorrect	25 ms	2904 KB	Output isn't correct
40	Halted	0 ms	0 KB	-

Submission #882468

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0