Submission #552712

#TimeUsernameProblemLanguageResultExecution timeMemory
552712uroskBali Sculptures (APIO15_sculpture)C++14
21 / 100
1 ms340 KiB
//https://oj.uz/problem/view/APIO15_sculpture // __builtin_popcount(x) broj bitova // __builtin_popcountll(x) // __builtin_clz(x) vodece nule // __builtin_clzll(x) // __builtin_ctz(x) nule na pocetku // __builtin_ctzll(x) // 2000000011 // 2000000033 #include "bits/stdc++.h" #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> #define ld double #define ll long long #define ull unsigned long long #define llinf 100000000000000000LL // 10^17 #define iinf 2000000000 // 2*10^9 #define pb push_back #define popb pop_back #define fi first #define sc second #define endl '\n' #define pii pair<int,int> #define pll pair<ll,ll> #define pld pair<ld,ld> #define sz(a) ((ll)(a.size())) #define all(a) a.begin(),a.end() #define rall(a) a.begin(),a.end(),greater<int>() #define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());} #define pi 3.14159265358979323846 #define here cerr<<"=============================================================================\n" #define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;} #define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}} #define yes cout<<"YES"<<endl #define no cout<<"NO"<<endl #define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0); using namespace std; using namespace __gnu_pbds; template<typename T> using vc = vector<T>; template<typename T> using vvc = vc<vc<T>>; typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); ll rnd(ll l,ll r){ return uniform_int_distribution<ll>(l,r)(rng); } void setIO(string inoutname) { freopen((inoutname+".in").c_str(),"r",stdin); freopen((inoutname+".out").c_str(),"w",stdout); } #define mod 1 ll gcd(ll a, ll b) { if(b==0) return a; if(a==0) return b; if(a>=b) return gcd(a%b,b); return gcd(a,b%a); } ll lcm(ll a,ll b){ return (a/gcd(a,b))*b; } ll add(ll x,ll y){ x+=y; if(x<0){ x%=mod; x+=mod; if(x==mod) x = 0; }else{ if(x>=mod) x%=mod; } return x; } ll mul(ll a,ll b){ ll ans = (a*b)%mod; if(ans<0) ans+=mod; return ans; } ll po(ll x,ll y){ if(y==0) return 1LL; ll ans = po(x,y/2); ans = mul(ans,ans); if(y&1) ans = mul(ans,x); return ans; } ll inv(ll x){return po(x,mod-2);} #define maxn 2005 #define lg 20 ll n,la,lb; ll a[maxn]; ll p[maxn]; ll dp2[maxn]; bool dp[maxn][maxn]; bool moe(ll x){ if(la==1){ fill(dp2,dp2+maxn,llinf); dp2[0] = 0; for(ll i = 1;i<=n;i++){ for(ll j = i-1;j>=0;j--){ ll sum = p[i]-p[j]; if((sum|x)==x) dp2[i] = min(dp2[i],dp2[j]+1); } } return dp2[n]<=lb; } for(ll i = 1;i<=n;i++) fill(dp[i],dp[i]+maxn,0); for(ll i = 0;i<=n;i++) dp[0][i] = 1; for(ll i = 1;i<=n;i++){ for(ll b = 1;b<=i;b++){ for(ll j = i-1;j>=0;j--){ ll sum = p[i] - p[j]; if((sum|x)!=x) continue; dp[i][b]|=dp[j][b-1]; } } } for(ll i = la;i<=lb;i++) if(dp[n][i]) return 1; return 0; } void tc(){ daj_mi_malo_vremena cin >> n >> la >> lb; for(ll i = 1;i<=n;i++) cin >> a[i]; for(ll i = 1;i<=n;i++) p[i] = p[i-1] + a[i]; ll ans = (1LL<<lg)-1; for(ll j = lg-1;j>=0;j--){ if(moe(ans-(1<<j))) ans -= (1<<j); } cout<<ans<<endl; } int main(){ daj_mi_malo_vremena //setIO("lol"); int t; t = 1; while(t--){ tc(); } return 0; } /* 6 1 3 8 1 2 1 5 4 */

Compilation message (stderr)

sculpture.cpp: In function 'void setIO(std::string)':
sculpture.cpp:51:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |  freopen((inoutname+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:52:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |      freopen((inoutname+".out").c_str(),"w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...