Submission #882676

# Submission time Handle Problem Language Result Execution time Memory
882676 2023-12-03T12:55:15 Z vjudge1 Bali Sculptures (APIO15_sculpture) C++17
Compilation error
0 ms 0 KB
#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 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]|=1LL<<59;
		}
		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);
		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]|=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:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
sculpture.cpp: In function 'int32_t main()':
sculpture.cpp:97:29: error: cannot bind non-const lvalue reference of type 'cbitset<2001>&' to an rvalue of type 'cbitset<2001>'
   97 |       dp[r][l]|=dp[r+1][r+1]>>1;
sculpture.cpp:54:31: note:   initializing argument 1 of 'void cbitset<sz>::operator|=(cbitset<sz>&) [with long unsigned int sz = 2001]'
   54 |  void operator|=(cbitset<sz> &bs){
      |                  ~~~~~~~~~~~~~^~